/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_6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:08:36,382 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:08:36,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:08:36,410 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:08:36,411 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:08:36,411 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:08:36,412 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:08:36,413 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:08:36,414 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:08:36,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:08:36,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:08:36,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:08:36,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:08:36,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:08:36,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:08:36,436 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:08:36,437 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:08:36,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:08:36,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:08:36,441 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:08:36,443 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:08:36,456 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:08:36,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:08:36,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:08:36,457 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:08:36,460 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:08:36,460 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:08:36,460 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:08:36,461 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:08:36,461 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:08:36,462 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:08:36,462 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:08:36,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:08:36,463 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:08:36,464 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:08:36,466 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:08:36,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:08:36,467 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:08:36,467 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:08:36,467 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:08:36,468 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:08:36,470 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:08:36,472 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:36,483 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:08:36,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:08:36,485 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:08:36,485 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:08:36,485 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:08:36,485 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:08:36,485 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:08:36,485 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:08:36,485 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:08:36,486 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:08:36,486 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:08:36,486 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:08:36,486 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:08:36,486 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:08:36,487 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:08:36,487 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:08:36,487 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:08:36,487 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:08:36,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:08:36,487 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:08:36,487 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:08:36,488 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:08:36,488 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:08:36,488 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:08:36,488 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:08:36,488 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:36,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:08:36,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:08:36,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:08:36,698 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:08:36,706 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:08:36,706 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/nested_6.c [2022-04-28 04:08:36,746 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bc95c2f3/eba84754f15a4a16a9492a8cc6ef34bf/FLAG38a94d15e [2022-04-28 04:08:37,108 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:08:37,108 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_6.c [2022-04-28 04:08:37,114 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bc95c2f3/eba84754f15a4a16a9492a8cc6ef34bf/FLAG38a94d15e [2022-04-28 04:08:37,125 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bc95c2f3/eba84754f15a4a16a9492a8cc6ef34bf [2022-04-28 04:08:37,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:08:37,128 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:08:37,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:08:37,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:08:37,132 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:08:37,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:08:37" (1/1) ... [2022-04-28 04:08:37,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15a67687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:37, skipping insertion in model container [2022-04-28 04:08:37,136 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:08:37" (1/1) ... [2022-04-28 04:08:37,141 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:08:37,150 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:08:37,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_6.c[959,972] [2022-04-28 04:08:37,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:08:37,286 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:08:37,295 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_6.c[959,972] [2022-04-28 04:08:37,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:08:37,303 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:08:37,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:37 WrapperNode [2022-04-28 04:08:37,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:08:37,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:08:37,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:08:37,305 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:08:37,311 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:37" (1/1) ... [2022-04-28 04:08:37,311 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:37" (1/1) ... [2022-04-28 04:08:37,315 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:37" (1/1) ... [2022-04-28 04:08:37,315 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:37" (1/1) ... [2022-04-28 04:08:37,318 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:37" (1/1) ... [2022-04-28 04:08:37,325 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:37" (1/1) ... [2022-04-28 04:08:37,328 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:37" (1/1) ... [2022-04-28 04:08:37,330 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:08:37,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:08:37,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:08:37,331 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:08:37,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:37" (1/1) ... [2022-04-28 04:08:37,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:08:37,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:08:37,354 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:37,372 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:37,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:08:37,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:08:37,382 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:08:37,382 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:08:37,382 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:08:37,382 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:08:37,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:08:37,382 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:08:37,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:08:37,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:08:37,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:08:37,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:08:37,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:08:37,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:08:37,430 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:08:37,431 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:08:37,568 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:08:37,572 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:08:37,572 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-04-28 04:08:37,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:08:37 BoogieIcfgContainer [2022-04-28 04:08:37,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:08:37,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:08:37,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:08:37,590 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:08:37,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:08:37" (1/3) ... [2022-04-28 04:08:37,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a0cee2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:08:37, skipping insertion in model container [2022-04-28 04:08:37,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:37" (2/3) ... [2022-04-28 04:08:37,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a0cee2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:08:37, skipping insertion in model container [2022-04-28 04:08:37,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:08:37" (3/3) ... [2022-04-28 04:08:37,596 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_6.c [2022-04-28 04:08:37,605 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:08:37,605 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:08:37,639 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:08:37,643 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@28cde4ab, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@49a04eaf [2022-04-28 04:08:37,643 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:08:37,648 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 20 states have (on average 1.7) internal successors, (34), 21 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:08:37,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-28 04:08:37,652 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:37,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:37,653 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:37,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:37,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1187922237, now seen corresponding path program 1 times [2022-04-28 04:08:37,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:37,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [695130660] [2022-04-28 04:08:37,667 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:08:37,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1187922237, now seen corresponding path program 2 times [2022-04-28 04:08:37,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:37,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711247329] [2022-04-28 04:08:37,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:37,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:37,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:37,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {29#true} is VALID [2022-04-28 04:08:37,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-28 04:08:37,861 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #92#return; {29#true} is VALID [2022-04-28 04:08:37,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:37,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {29#true} is VALID [2022-04-28 04:08:37,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-28 04:08:37,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #92#return; {29#true} is VALID [2022-04-28 04:08:37,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret10 := main(); {29#true} is VALID [2022-04-28 04:08:37,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {34#(= main_~a~0 0)} is VALID [2022-04-28 04:08:37,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#(= main_~a~0 0)} assume !(~a~0 < 6); {30#false} is VALID [2022-04-28 04:08:37,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {30#false} is VALID [2022-04-28 04:08:37,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-28 04:08:37,866 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,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:37,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711247329] [2022-04-28 04:08:37,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711247329] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:37,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:37,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:37,869 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:37,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [695130660] [2022-04-28 04:08:37,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [695130660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:37,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:37,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:37,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764088155] [2022-04-28 04:08:37,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:37,873 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:37,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:37,876 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:37,893 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:37,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 04:08:37,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:37,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 04:08:37,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 04:08:37,912 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.7) internal successors, (34), 21 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:38,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:38,067 INFO L93 Difference]: Finished difference Result 58 states and 94 transitions. [2022-04-28 04:08:38,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 04:08:38,067 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:38,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:38,068 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:38,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-28 04:08:38,078 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:38,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-28 04:08:38,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-28 04:08:38,164 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:08:38,186 INFO L225 Difference]: With dead ends: 58 [2022-04-28 04:08:38,186 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 04:08:38,188 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:38,190 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 56 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:38,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 38 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:08:38,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 04:08:38,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 22. [2022-04-28 04:08:38,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:38,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:38,222 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:38,223 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:38,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:38,229 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-28 04:08:38,229 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-28 04:08:38,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:38,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:38,229 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 04:08:38,230 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 04:08:38,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:38,232 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-28 04:08:38,232 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-28 04:08:38,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:38,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:38,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:38,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:38,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:38,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-04-28 04:08:38,235 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 9 [2022-04-28 04:08:38,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:38,238 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-04-28 04:08:38,238 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:38,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 27 transitions. [2022-04-28 04:08:38,278 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:38,278 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-28 04:08:38,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 04:08:38,278 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:38,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:38,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:08:38,279 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:38,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:38,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1138963186, now seen corresponding path program 1 times [2022-04-28 04:08:38,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:38,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [564368868] [2022-04-28 04:08:38,343 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:38,344 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:38,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1831600555, now seen corresponding path program 1 times [2022-04-28 04:08:38,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:38,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508369336] [2022-04-28 04:08:38,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:38,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:38,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:38,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {272#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {266#true} is VALID [2022-04-28 04:08:38,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {266#true} assume true; {266#true} is VALID [2022-04-28 04:08:38,432 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {266#true} {266#true} #92#return; {266#true} is VALID [2022-04-28 04:08:38,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {266#true} call ULTIMATE.init(); {272#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:38,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {272#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {266#true} is VALID [2022-04-28 04:08:38,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {266#true} assume true; {266#true} is VALID [2022-04-28 04:08:38,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {266#true} {266#true} #92#return; {266#true} is VALID [2022-04-28 04:08:38,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {266#true} call #t~ret10 := main(); {266#true} is VALID [2022-04-28 04:08:38,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {266#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {271#(= main_~a~0 0)} is VALID [2022-04-28 04:08:38,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {271#(= main_~a~0 0)} [96] 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] {271#(= main_~a~0 0)} is VALID [2022-04-28 04:08:38,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {271#(= main_~a~0 0)} [95] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {267#false} is VALID [2022-04-28 04:08:38,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {267#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {267#false} is VALID [2022-04-28 04:08:38,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {267#false} assume !false; {267#false} is VALID [2022-04-28 04:08:38,436 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,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:38,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508369336] [2022-04-28 04:08:38,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508369336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:38,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:38,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:38,458 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:38,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [564368868] [2022-04-28 04:08:38,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [564368868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:38,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:38,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:08:38,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067051119] [2022-04-28 04:08:38,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:38,461 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:38,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:38,461 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:38,471 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:38,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:08:38,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:38,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:08:38,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:08:38,473 INFO L87 Difference]: Start difference. First operand 22 states and 27 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:38,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:38,638 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2022-04-28 04:08:38,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:08:38,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:38,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:38,639 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:38,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-28 04:08:38,640 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:38,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-28 04:08:38,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 78 transitions. [2022-04-28 04:08:38,724 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:08:38,729 INFO L225 Difference]: With dead ends: 58 [2022-04-28 04:08:38,729 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 04:08:38,730 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:38,733 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 92 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:38,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 29 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:08:38,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 04:08:38,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 23. [2022-04-28 04:08:38,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:38,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:38,745 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:38,746 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:38,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:38,747 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2022-04-28 04:08:38,747 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2022-04-28 04:08:38,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:38,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:38,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-28 04:08:38,748 INFO L87 Difference]: Start difference. First operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-28 04:08:38,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:38,750 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2022-04-28 04:08:38,750 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2022-04-28 04:08:38,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:38,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:38,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:38,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:38,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:38,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-28 04:08:38,752 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 12 [2022-04-28 04:08:38,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:38,752 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-28 04:08:38,752 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:38,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 28 transitions. [2022-04-28 04:08:38,778 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,778 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-28 04:08:38,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 04:08:38,779 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:38,779 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:38,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 04:08:38,779 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:38,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:38,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1811082743, now seen corresponding path program 1 times [2022-04-28 04:08:38,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:38,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1722613735] [2022-04-28 04:08:38,824 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:38,911 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:38,911 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:38,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1831662059, now seen corresponding path program 1 times [2022-04-28 04:08:38,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:38,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785941977] [2022-04-28 04:08:38,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:38,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:38,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:38,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {534#(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); {528#true} is VALID [2022-04-28 04:08:38,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {528#true} assume true; {528#true} is VALID [2022-04-28 04:08:38,963 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {528#true} {528#true} #92#return; {528#true} is VALID [2022-04-28 04:08:38,963 INFO L272 TraceCheckUtils]: 0: Hoare triple {528#true} call ULTIMATE.init(); {534#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:38,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {534#(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); {528#true} is VALID [2022-04-28 04:08:38,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {528#true} assume true; {528#true} is VALID [2022-04-28 04:08:38,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {528#true} {528#true} #92#return; {528#true} is VALID [2022-04-28 04:08:38,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {528#true} call #t~ret10 := main(); {528#true} is VALID [2022-04-28 04:08:38,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {528#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {533#(= main_~a~0 0)} is VALID [2022-04-28 04:08:38,965 INFO L290 TraceCheckUtils]: 6: Hoare triple {533#(= main_~a~0 0)} [98] 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] {533#(= main_~a~0 0)} is VALID [2022-04-28 04:08:38,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {533#(= main_~a~0 0)} [97] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {529#false} is VALID [2022-04-28 04:08:38,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {529#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {529#false} is VALID [2022-04-28 04:08:38,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {529#false} assume !false; {529#false} is VALID [2022-04-28 04:08:38,966 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,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:38,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785941977] [2022-04-28 04:08:38,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785941977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:38,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:38,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:38,989 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:38,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1722613735] [2022-04-28 04:08:38,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1722613735] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:38,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:38,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:08:38,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880114837] [2022-04-28 04:08:38,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:38,990 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:38,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:38,991 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:38,999 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:38,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:08:38,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:39,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:08:39,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:08:39,000 INFO L87 Difference]: Start difference. First operand 23 states and 28 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:39,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:39,184 INFO L93 Difference]: Finished difference Result 66 states and 89 transitions. [2022-04-28 04:08:39,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 04:08:39,184 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:39,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:39,185 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:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-04-28 04:08:39,186 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:39,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-04-28 04:08:39,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 89 transitions. [2022-04-28 04:08:39,243 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:08:39,244 INFO L225 Difference]: With dead ends: 66 [2022-04-28 04:08:39,244 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 04:08:39,245 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:39,245 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 112 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:39,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 32 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:08:39,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 04:08:39,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 24. [2022-04-28 04:08:39,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:39,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:39,249 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:39,250 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:39,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:39,252 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-28 04:08:39,252 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-28 04:08:39,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:39,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:39,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-28 04:08:39,252 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-28 04:08:39,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:39,254 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-28 04:08:39,254 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-28 04:08:39,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:39,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:39,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:39,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:39,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-04-28 04:08:39,255 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 15 [2022-04-28 04:08:39,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:39,256 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-04-28 04:08:39,256 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:39,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 29 transitions. [2022-04-28 04:08:39,279 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:08:39,279 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-04-28 04:08:39,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 04:08:39,281 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:39,281 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:39,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 04:08:39,283 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:39,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:39,284 INFO L85 PathProgramCache]: Analyzing trace with hash 602992382, now seen corresponding path program 1 times [2022-04-28 04:08:39,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:39,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1777901784] [2022-04-28 04:08:39,312 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:39,341 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:39,410 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:39,411 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:39,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1831723563, now seen corresponding path program 1 times [2022-04-28 04:08:39,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:39,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895248691] [2022-04-28 04:08:39,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:39,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:39,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:39,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {833#(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); {827#true} is VALID [2022-04-28 04:08:39,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {827#true} assume true; {827#true} is VALID [2022-04-28 04:08:39,468 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {827#true} {827#true} #92#return; {827#true} is VALID [2022-04-28 04:08:39,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {827#true} call ULTIMATE.init(); {833#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:39,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {833#(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); {827#true} is VALID [2022-04-28 04:08:39,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {827#true} assume true; {827#true} is VALID [2022-04-28 04:08:39,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {827#true} {827#true} #92#return; {827#true} is VALID [2022-04-28 04:08:39,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {827#true} call #t~ret10 := main(); {827#true} is VALID [2022-04-28 04:08:39,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {827#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {832#(= main_~a~0 0)} is VALID [2022-04-28 04:08:39,470 INFO L290 TraceCheckUtils]: 6: Hoare triple {832#(= main_~a~0 0)} [100] 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] {832#(= main_~a~0 0)} is VALID [2022-04-28 04:08:39,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {832#(= main_~a~0 0)} [99] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {828#false} is VALID [2022-04-28 04:08:39,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {828#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {828#false} is VALID [2022-04-28 04:08:39,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {828#false} assume !false; {828#false} is VALID [2022-04-28 04:08:39,473 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:39,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:39,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895248691] [2022-04-28 04:08:39,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895248691] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:39,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:39,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:39,506 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:39,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1777901784] [2022-04-28 04:08:39,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1777901784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:39,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:39,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:08:39,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127900040] [2022-04-28 04:08:39,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:39,507 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:39,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:39,507 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:39,518 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:39,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 04:08:39,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:39,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 04:08:39,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-28 04:08:39,518 INFO L87 Difference]: Start difference. First operand 24 states and 29 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:39,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:39,688 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2022-04-28 04:08:39,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 04:08:39,689 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:39,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:39,689 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:39,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-04-28 04:08:39,692 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:39,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-04-28 04:08:39,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 97 transitions. [2022-04-28 04:08:39,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:39,758 INFO L225 Difference]: With dead ends: 72 [2022-04-28 04:08:39,758 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 04:08:39,759 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:39,761 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 150 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:39,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 25 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:08:39,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 04:08:39,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 25. [2022-04-28 04:08:39,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:39,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 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:39,770 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 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:39,770 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 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:39,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:39,772 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2022-04-28 04:08:39,772 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2022-04-28 04:08:39,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:39,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:39,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 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 57 states. [2022-04-28 04:08:39,773 INFO L87 Difference]: Start difference. First operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 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 57 states. [2022-04-28 04:08:39,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:39,774 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2022-04-28 04:08:39,774 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2022-04-28 04:08:39,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:39,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:39,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:39,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:39,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 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:39,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-04-28 04:08:39,775 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 18 [2022-04-28 04:08:39,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:39,775 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-04-28 04:08:39,776 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:39,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 30 transitions. [2022-04-28 04:08:39,809 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:39,810 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-04-28 04:08:39,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 04:08:39,810 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:39,810 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:39,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 04:08:39,810 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:39,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:39,811 INFO L85 PathProgramCache]: Analyzing trace with hash 257821531, now seen corresponding path program 1 times [2022-04-28 04:08:39,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:39,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [587011381] [2022-04-28 04:08:39,858 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:39,880 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:39,914 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:39,941 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:39,975 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:40,071 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:40,072 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:40,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1831785067, now seen corresponding path program 1 times [2022-04-28 04:08:40,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:40,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151420687] [2022-04-28 04:08:40,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:40,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:40,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:40,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {1161#(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); {1155#true} is VALID [2022-04-28 04:08:40,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {1155#true} assume true; {1155#true} is VALID [2022-04-28 04:08:40,098 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1155#true} {1155#true} #92#return; {1155#true} is VALID [2022-04-28 04:08:40,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {1155#true} call ULTIMATE.init(); {1161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:40,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {1161#(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); {1155#true} is VALID [2022-04-28 04:08:40,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {1155#true} assume true; {1155#true} is VALID [2022-04-28 04:08:40,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1155#true} {1155#true} #92#return; {1155#true} is VALID [2022-04-28 04:08:40,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {1155#true} call #t~ret10 := main(); {1155#true} is VALID [2022-04-28 04:08:40,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {1155#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {1160#(= main_~a~0 0)} is VALID [2022-04-28 04:08:40,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {1160#(= main_~a~0 0)} [102] 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] {1160#(= main_~a~0 0)} is VALID [2022-04-28 04:08:40,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {1160#(= main_~a~0 0)} [101] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {1156#false} is VALID [2022-04-28 04:08:40,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {1156#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {1156#false} is VALID [2022-04-28 04:08:40,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {1156#false} assume !false; {1156#false} is VALID [2022-04-28 04:08:40,101 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:40,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:40,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151420687] [2022-04-28 04:08:40,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151420687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:40,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:40,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:40,145 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:40,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [587011381] [2022-04-28 04:08:40,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [587011381] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:40,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:40,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:08:40,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199843592] [2022-04-28 04:08:40,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:40,146 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:40,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:40,146 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:40,171 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:40,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 04:08:40,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:40,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 04:08:40,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 04:08:40,172 INFO L87 Difference]: Start difference. First operand 25 states and 30 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:40,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:40,393 INFO L93 Difference]: Finished difference Result 76 states and 102 transitions. [2022-04-28 04:08:40,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 04:08:40,394 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:40,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:40,394 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:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2022-04-28 04:08:40,395 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:40,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2022-04-28 04:08:40,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 102 transitions. [2022-04-28 04:08:40,466 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:08:40,467 INFO L225 Difference]: With dead ends: 76 [2022-04-28 04:08:40,468 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 04:08:40,468 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:40,468 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 153 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:40,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 28 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:08:40,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 04:08:40,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 26. [2022-04-28 04:08:40,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:40,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call 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:40,473 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call 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:40,473 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call 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:40,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:40,474 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2022-04-28 04:08:40,474 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-04-28 04:08:40,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:40,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:40,475 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 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:08:40,475 INFO L87 Difference]: Start difference. First operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 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:08:40,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:40,476 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2022-04-28 04:08:40,477 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-04-28 04:08:40,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:40,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:40,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:40,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:40,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call 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:40,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-28 04:08:40,478 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 21 [2022-04-28 04:08:40,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:40,478 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-28 04:08:40,478 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:40,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 31 transitions. [2022-04-28 04:08:40,507 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:08:40,508 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-28 04:08:40,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 04:08:40,508 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:40,508 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, 1] [2022-04-28 04:08:40,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 04:08:40,509 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:40,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:40,509 INFO L85 PathProgramCache]: Analyzing trace with hash 479277370, now seen corresponding path program 1 times [2022-04-28 04:08:40,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:40,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [821600924] [2022-04-28 04:08:40,547 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:40,572 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:40,608 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:40,633 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:40,669 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:40,730 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 7 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:40,772 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:40,805 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:40,850 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 7 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:41,000 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:41,001 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:41,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1831846571, now seen corresponding path program 1 times [2022-04-28 04:08:41,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:41,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981996270] [2022-04-28 04:08:41,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:41,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:41,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:41,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {1510#(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); {1504#true} is VALID [2022-04-28 04:08:41,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 04:08:41,041 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1504#true} {1504#true} #92#return; {1504#true} is VALID [2022-04-28 04:08:41,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} call ULTIMATE.init(); {1510#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:41,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {1510#(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); {1504#true} is VALID [2022-04-28 04:08:41,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 04:08:41,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1504#true} {1504#true} #92#return; {1504#true} is VALID [2022-04-28 04:08:41,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {1504#true} call #t~ret10 := main(); {1504#true} is VALID [2022-04-28 04:08:41,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {1504#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {1509#(= main_~a~0 0)} is VALID [2022-04-28 04:08:41,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {1509#(= main_~a~0 0)} [104] 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_~f~0_59 v_main_~f~0_58)) (.cse9 (= v_main_~a~0_34 v_main_~a~0_33))) (or (and .cse0 (= |v_main_#t~pre6_50| |v_main_#t~pre6_49|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre6_49| |v_main_#t~pre6_50|) .cse5 .cse6 .cse7 .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_97, main_~f~0=v_main_~f~0_59, 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_~f~0=v_main_~f~0_58, 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_~f~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] {1509#(= main_~a~0 0)} is VALID [2022-04-28 04:08:41,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {1509#(= main_~a~0 0)} [103] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {1505#false} is VALID [2022-04-28 04:08:41,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {1505#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {1505#false} is VALID [2022-04-28 04:08:41,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {1505#false} assume !false; {1505#false} is VALID [2022-04-28 04:08:41,043 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:41,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:41,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981996270] [2022-04-28 04:08:41,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981996270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:41,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:41,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:41,109 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:41,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [821600924] [2022-04-28 04:08:41,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [821600924] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:41,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:41,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 04:08:41,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109101284] [2022-04-28 04:08:41,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:41,110 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 04:08:41,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:41,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:41,124 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:41,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 04:08:41,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:41,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 04:08:41,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-28 04:08:41,125 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:41,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:41,370 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2022-04-28 04:08:41,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 04:08:41,370 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 04:08:41,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:41,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:41,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-28 04:08:41,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:41,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-28 04:08:41,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 104 transitions. [2022-04-28 04:08:41,441 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:08:41,443 INFO L225 Difference]: With dead ends: 78 [2022-04-28 04:08:41,443 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 04:08:41,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-04-28 04:08:41,444 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 178 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:41,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 26 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:08:41,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 04:08:41,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 27. [2022-04-28 04:08:41,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:41,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 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:41,450 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 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:41,450 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 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:41,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:41,452 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2022-04-28 04:08:41,452 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2022-04-28 04:08:41,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:41,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:41,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 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 63 states. [2022-04-28 04:08:41,453 INFO L87 Difference]: Start difference. First operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 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 63 states. [2022-04-28 04:08:41,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:41,454 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2022-04-28 04:08:41,455 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2022-04-28 04:08:41,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:41,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:41,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:41,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:41,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 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:41,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-04-28 04:08:41,456 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 24 [2022-04-28 04:08:41,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:41,456 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-04-28 04:08:41,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:41,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 32 transitions. [2022-04-28 04:08:41,488 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:41,488 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-28 04:08:41,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 04:08:41,488 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:41,488 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, 1, 1, 1] [2022-04-28 04:08:41,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 04:08:41,489 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:41,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:41,489 INFO L85 PathProgramCache]: Analyzing trace with hash 939861656, now seen corresponding path program 1 times [2022-04-28 04:08:41,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:41,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [46376355] [2022-04-28 04:08:45,602 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:08:45,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:08:45,722 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:49,811 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:08:49,900 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:49,950 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:52,641 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:08:52,700 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,741 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:55,478 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:55,521 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:59,613 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:08:59,672 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:59,794 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:59,795 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:59,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1831908075, now seen corresponding path program 1 times [2022-04-28 04:08:59,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:59,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146290733] [2022-04-28 04:08:59,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:59,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:59,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:59,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {1872#(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); {1866#true} is VALID [2022-04-28 04:08:59,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {1866#true} assume true; {1866#true} is VALID [2022-04-28 04:08:59,834 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1866#true} {1866#true} #92#return; {1866#true} is VALID [2022-04-28 04:08:59,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {1866#true} call ULTIMATE.init(); {1872#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:59,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {1872#(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); {1866#true} is VALID [2022-04-28 04:08:59,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {1866#true} assume true; {1866#true} is VALID [2022-04-28 04:08:59,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1866#true} {1866#true} #92#return; {1866#true} is VALID [2022-04-28 04:08:59,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {1866#true} call #t~ret10 := main(); {1866#true} is VALID [2022-04-28 04:08:59,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {1866#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {1871#(= main_~a~0 0)} is VALID [2022-04-28 04:08:59,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {1871#(= main_~a~0 0)} [106] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_34| |v_main_#t~pre5_33|)) (.cse1 (= v_main_~f~0_120 v_main_~f~0_118)) (.cse2 (= |v_main_#t~pre6_57| |v_main_#t~pre6_56|)) (.cse3 (= v_main_~a~0_40 v_main_~a~0_39)) (.cse4 (= v_main_~b~0_55 v_main_~b~0_53)) (.cse5 (= |v_main_#t~pre7_73| |v_main_#t~pre7_72|)) (.cse6 (= |v_main_#t~pre8_82| |v_main_#t~pre8_81|)) (.cse7 (= |v_main_#t~pre9_54| |v_main_#t~pre9_53|)) (.cse8 (= |v_main_#t~pre4_29| |v_main_#t~pre4_28|)) (.cse9 (= v_main_~d~0_108 v_main_~d~0_106)) (.cse10 (= v_main_~c~0_86 v_main_~c~0_84))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~e~0_131 v_main_~e~0_129) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 (= v_main_~e~0_129 v_main_~e~0_131) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) InVars {main_~e~0=v_main_~e~0_131, main_~d~0=v_main_~d~0_108, main_~b~0=v_main_~b~0_55, main_~f~0=v_main_~f~0_120, main_#t~pre7=|v_main_#t~pre7_73|, main_~c~0=v_main_~c~0_86, main_#t~pre8=|v_main_#t~pre8_82|, main_#t~pre9=|v_main_#t~pre9_54|, 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_129, main_~d~0=v_main_~d~0_106, main_~b~0=v_main_~b~0_53, main_~f~0=v_main_~f~0_118, main_#t~pre7=|v_main_#t~pre7_72|, main_~c~0=v_main_~c~0_84, main_#t~pre8=|v_main_#t~pre8_81|, main_#t~pre9=|v_main_#t~pre9_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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {1871#(= main_~a~0 0)} is VALID [2022-04-28 04:08:59,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {1871#(= main_~a~0 0)} [105] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {1867#false} is VALID [2022-04-28 04:08:59,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {1867#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {1867#false} is VALID [2022-04-28 04:08:59,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {1867#false} assume !false; {1867#false} is VALID [2022-04-28 04:08:59,837 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:59,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:59,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146290733] [2022-04-28 04:08:59,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146290733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:59,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:59,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:59,925 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:59,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [46376355] [2022-04-28 04:08:59,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [46376355] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:59,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:59,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 04:08:59,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073681373] [2022-04-28 04:08:59,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:59,926 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 04:08:59,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:59,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:59,943 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:59,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 04:08:59,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:59,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 04:08:59,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-04-28 04:08:59,943 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:00,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:00,221 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2022-04-28 04:09:00,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 04:09:00,221 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 04:09:00,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:00,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:00,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2022-04-28 04:09:00,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:00,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2022-04-28 04:09:00,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 106 transitions. [2022-04-28 04:09:00,295 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:09:00,296 INFO L225 Difference]: With dead ends: 80 [2022-04-28 04:09:00,296 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 04:09:00,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=167, Unknown=0, NotChecked=0, Total=272 [2022-04-28 04:09:00,296 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 144 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:00,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 31 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:09:00,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 04:09:00,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 29. [2022-04-28 04:09:00,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:00,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 29 states, 25 states have (on average 1.24) internal successors, (31), 25 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:00,301 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 29 states, 25 states have (on average 1.24) internal successors, (31), 25 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:00,302 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 29 states, 25 states have (on average 1.24) internal successors, (31), 25 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:00,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:00,303 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2022-04-28 04:09:00,303 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2022-04-28 04:09:00,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:00,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:00,303 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 25 states have (on average 1.24) internal successors, (31), 25 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 65 states. [2022-04-28 04:09:00,303 INFO L87 Difference]: Start difference. First operand has 29 states, 25 states have (on average 1.24) internal successors, (31), 25 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 65 states. [2022-04-28 04:09:00,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:00,305 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2022-04-28 04:09:00,305 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2022-04-28 04:09:00,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:00,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:00,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:00,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:00,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.24) internal successors, (31), 25 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:00,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-04-28 04:09:00,306 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 26 [2022-04-28 04:09:00,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:00,307 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-04-28 04:09:00,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:00,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 34 transitions. [2022-04-28 04:09:00,338 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:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-28 04:09:00,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 04:09:00,339 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:00,339 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, 1, 1, 1] [2022-04-28 04:09:00,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 04:09:00,340 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:00,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:00,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1179729014, now seen corresponding path program 2 times [2022-04-28 04:09:00,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:00,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [427121745] [2022-04-28 04:09:04,435 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:04,483 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:04,521 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:09:07,069 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,119 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:09:11,183 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:11,231 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:11,267 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:09:15,329 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:15,374 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:15,410 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:09:17,930 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:17,973 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:18,105 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:18,106 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:09:18,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1831969579, now seen corresponding path program 1 times [2022-04-28 04:09:18,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:18,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247539952] [2022-04-28 04:09:18,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:18,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:18,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:18,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {2249#(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); {2243#true} is VALID [2022-04-28 04:09:18,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {2243#true} assume true; {2243#true} is VALID [2022-04-28 04:09:18,132 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2243#true} {2243#true} #92#return; {2243#true} is VALID [2022-04-28 04:09:18,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {2243#true} call ULTIMATE.init(); {2249#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:09:18,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {2249#(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); {2243#true} is VALID [2022-04-28 04:09:18,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {2243#true} assume true; {2243#true} is VALID [2022-04-28 04:09:18,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2243#true} {2243#true} #92#return; {2243#true} is VALID [2022-04-28 04:09:18,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {2243#true} call #t~ret10 := main(); {2243#true} is VALID [2022-04-28 04:09:18,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {2243#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {2248#(= main_~a~0 0)} is VALID [2022-04-28 04:09:18,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {2248#(= main_~a~0 0)} [108] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~d~0_120 v_main_~d~0_118)) (.cse1 (= v_main_~f~0_189 v_main_~f~0_186)) (.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_#t~pre9_115| |v_main_#t~pre9_113|)) (.cse5 (= |v_main_#t~pre8_111| |v_main_#t~pre8_110|)) (.cse6 (= v_main_~c~0_96 v_main_~c~0_94)) (.cse7 (= |v_main_#t~pre7_81| |v_main_#t~pre7_80|)) (.cse8 (= v_main_~e~0_165 v_main_~e~0_163)) (.cse9 (= v_main_~a~0_46 v_main_~a~0_45)) (.cse10 (= v_main_~b~0_63 v_main_~b~0_61))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_main_#t~pre5_40| |v_main_#t~pre5_39|) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 (= |v_main_#t~pre5_39| |v_main_#t~pre5_40|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) InVars {main_~e~0=v_main_~e~0_165, main_~d~0=v_main_~d~0_120, main_~b~0=v_main_~b~0_63, main_~f~0=v_main_~f~0_189, main_#t~pre7=|v_main_#t~pre7_81|, main_~c~0=v_main_~c~0_96, main_#t~pre8=|v_main_#t~pre8_111|, main_#t~pre9=|v_main_#t~pre9_115|, 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_163, main_~d~0=v_main_~d~0_118, main_~b~0=v_main_~b~0_61, main_~f~0=v_main_~f~0_186, main_#t~pre7=|v_main_#t~pre7_80|, main_~c~0=v_main_~c~0_94, main_#t~pre8=|v_main_#t~pre8_110|, main_#t~pre9=|v_main_#t~pre9_113|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {2248#(= main_~a~0 0)} is VALID [2022-04-28 04:09:18,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {2248#(= main_~a~0 0)} [107] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {2244#false} is VALID [2022-04-28 04:09:18,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {2244#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {2244#false} is VALID [2022-04-28 04:09:18,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {2244#false} assume !false; {2244#false} is VALID [2022-04-28 04:09:18,134 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:18,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:18,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247539952] [2022-04-28 04:09:18,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247539952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:18,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:18,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:09:18,252 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:18,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [427121745] [2022-04-28 04:09:18,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [427121745] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:18,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:18,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 04:09:18,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792682042] [2022-04-28 04:09:18,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:18,253 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (2), 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 28 [2022-04-28 04:09:18,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:18,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call 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:18,283 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:09:18,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 04:09:18,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:18,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 04:09:18,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2022-04-28 04:09:18,284 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call 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:18,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:18,621 INFO L93 Difference]: Finished difference Result 82 states and 108 transitions. [2022-04-28 04:09:18,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 04:09:18,621 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (2), 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 28 [2022-04-28 04:09:18,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:18,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call 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:18,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 108 transitions. [2022-04-28 04:09:18,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call 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:18,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 108 transitions. [2022-04-28 04:09:18,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 108 transitions. [2022-04-28 04:09:18,724 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:09:18,725 INFO L225 Difference]: With dead ends: 82 [2022-04-28 04:09:18,725 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 04:09:18,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2022-04-28 04:09:18,725 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 202 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:18,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 21 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:09:18,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 04:09:18,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 31. [2022-04-28 04:09:18,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:18,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 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:18,733 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 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:18,734 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 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:18,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:18,736 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2022-04-28 04:09:18,736 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2022-04-28 04:09:18,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:18,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:18,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 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 67 states. [2022-04-28 04:09:18,736 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 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 67 states. [2022-04-28 04:09:18,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:18,738 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2022-04-28 04:09:18,738 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2022-04-28 04:09:18,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:18,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:18,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:18,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:18,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 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:18,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-04-28 04:09:18,739 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 28 [2022-04-28 04:09:18,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:18,739 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-04-28 04:09:18,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call 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:18,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 36 transitions. [2022-04-28 04:09:18,775 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:18,775 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-28 04:09:18,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 04:09:18,775 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:18,775 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, 1, 1, 1] [2022-04-28 04:09:18,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 04:09:18,776 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:18,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:18,776 INFO L85 PathProgramCache]: Analyzing trace with hash -235973932, now seen corresponding path program 3 times [2022-04-28 04:09:18,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:18,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [504773061] [2022-04-28 04:09:22,886 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:22,931 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:22,965 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:09:27,028 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:27,072 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:27,109 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:09:29,816 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:29,870 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:09:33,934 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:33,976 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,013 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:09:38,084 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:38,142 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:38,279 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:38,279 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:09:38,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1832031083, now seen corresponding path program 1 times [2022-04-28 04:09:38,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:38,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711415401] [2022-04-28 04:09:38,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:38,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:38,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:38,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:38,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {2641#(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); {2635#true} is VALID [2022-04-28 04:09:38,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {2635#true} assume true; {2635#true} is VALID [2022-04-28 04:09:38,306 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2635#true} {2635#true} #92#return; {2635#true} is VALID [2022-04-28 04:09:38,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2641#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:09:38,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {2641#(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); {2635#true} is VALID [2022-04-28 04:09:38,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {2635#true} assume true; {2635#true} is VALID [2022-04-28 04:09:38,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2635#true} {2635#true} #92#return; {2635#true} is VALID [2022-04-28 04:09:38,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {2635#true} call #t~ret10 := main(); {2635#true} is VALID [2022-04-28 04:09:38,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {2635#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {2640#(= main_~a~0 0)} is VALID [2022-04-28 04:09:38,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {2640#(= main_~a~0 0)} [110] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre6_71| |v_main_#t~pre6_70|)) (.cse1 (= v_main_~f~0_264 v_main_~f~0_260)) (.cse2 (= |v_main_#t~pre4_39| |v_main_#t~pre4_38|)) (.cse3 (= v_main_~c~0_106 v_main_~c~0_104)) (.cse4 (= v_main_~a~0_52 v_main_~a~0_51)) (.cse5 (= |v_main_#t~pre7_89| |v_main_#t~pre7_88|)) (.cse6 (= v_main_~b~0_71 v_main_~b~0_69)) (.cse7 (= v_main_~d~0_132 v_main_~d~0_130)) (.cse8 (= v_main_~e~0_199 v_main_~e~0_197)) (.cse9 (= |v_main_#t~pre5_46| |v_main_#t~pre5_45|))) (or (and .cse0 (= |v_main_#t~pre8_139| |v_main_#t~pre8_140|) .cse1 .cse2 .cse3 (= |v_main_#t~pre9_178| |v_main_#t~pre9_181|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (= |v_main_#t~pre8_140| |v_main_#t~pre8_139|) .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre9_181| |v_main_#t~pre9_178|) .cse5 .cse6 .cse7 .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_199, main_~d~0=v_main_~d~0_132, main_~b~0=v_main_~b~0_71, main_~f~0=v_main_~f~0_264, main_#t~pre7=|v_main_#t~pre7_89|, main_~c~0=v_main_~c~0_106, main_#t~pre8=|v_main_#t~pre8_140|, main_#t~pre9=|v_main_#t~pre9_181|, 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_197, main_~d~0=v_main_~d~0_130, main_~b~0=v_main_~b~0_69, main_~f~0=v_main_~f~0_260, main_#t~pre7=|v_main_#t~pre7_88|, main_~c~0=v_main_~c~0_104, main_#t~pre8=|v_main_#t~pre8_139|, main_#t~pre9=|v_main_#t~pre9_178|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {2640#(= main_~a~0 0)} is VALID [2022-04-28 04:09:38,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {2640#(= main_~a~0 0)} [109] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {2636#false} is VALID [2022-04-28 04:09:38,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {2636#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {2636#false} is VALID [2022-04-28 04:09:38,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2022-04-28 04:09:38,308 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:38,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:38,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711415401] [2022-04-28 04:09:38,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711415401] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:38,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:38,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:09:38,465 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:38,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [504773061] [2022-04-28 04:09:38,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [504773061] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:38,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:38,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 04:09:38,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239064737] [2022-04-28 04:09:38,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:38,465 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (2), 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 30 [2022-04-28 04:09:38,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:38,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call 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:38,483 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:09:38,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 04:09:38,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:38,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 04:09:38,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-28 04:09:38,484 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call 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:38,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:38,855 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2022-04-28 04:09:38,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 04:09:38,855 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (2), 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 30 [2022-04-28 04:09:38,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:38,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call 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:38,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 110 transitions. [2022-04-28 04:09:38,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call 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:38,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 110 transitions. [2022-04-28 04:09:38,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 110 transitions. [2022-04-28 04:09:38,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:38,932 INFO L225 Difference]: With dead ends: 84 [2022-04-28 04:09:38,932 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 04:09:38,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2022-04-28 04:09:38,933 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 148 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:38,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 31 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:09:38,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 04:09:38,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 33. [2022-04-28 04:09:38,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:38,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 33 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 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:38,939 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 33 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 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:38,939 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 33 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 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:38,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:38,942 INFO L93 Difference]: Finished difference Result 69 states and 89 transitions. [2022-04-28 04:09:38,943 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2022-04-28 04:09:38,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:38,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:38,943 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 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 69 states. [2022-04-28 04:09:38,943 INFO L87 Difference]: Start difference. First operand has 33 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 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 69 states. [2022-04-28 04:09:38,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:38,944 INFO L93 Difference]: Finished difference Result 69 states and 89 transitions. [2022-04-28 04:09:38,944 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2022-04-28 04:09:38,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:38,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:38,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:38,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:38,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 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:38,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-04-28 04:09:38,945 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 30 [2022-04-28 04:09:38,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:38,945 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-04-28 04:09:38,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call 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:38,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 38 transitions. [2022-04-28 04:09:38,988 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:38,988 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-28 04:09:38,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 04:09:38,988 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:38,988 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, 1, 1, 1] [2022-04-28 04:09:38,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 04:09:38,989 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:38,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:38,989 INFO L85 PathProgramCache]: Analyzing trace with hash 778127794, now seen corresponding path program 4 times [2022-04-28 04:09:38,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:38,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1302501514] [2022-04-28 04:09:41,816 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:41,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:09:41,899 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:09:45,979 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:46,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:09:46,062 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:09:50,146 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:50,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:09:50,231 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:09:54,298 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:54,347 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,381 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:09:58,460 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:58,509 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:58,663 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:58,663 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:09:58,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1832092587, now seen corresponding path program 1 times [2022-04-28 04:09:58,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:58,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188370708] [2022-04-28 04:09:58,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:58,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:58,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:58,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {3048#(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); {3042#true} is VALID [2022-04-28 04:09:58,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {3042#true} assume true; {3042#true} is VALID [2022-04-28 04:09:58,708 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3042#true} {3042#true} #92#return; {3042#true} is VALID [2022-04-28 04:09:58,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {3042#true} call ULTIMATE.init(); {3048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:09:58,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {3048#(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); {3042#true} is VALID [2022-04-28 04:09:58,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {3042#true} assume true; {3042#true} is VALID [2022-04-28 04:09:58,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3042#true} {3042#true} #92#return; {3042#true} is VALID [2022-04-28 04:09:58,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {3042#true} call #t~ret10 := main(); {3042#true} is VALID [2022-04-28 04:09:58,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {3042#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {3047#(= main_~a~0 0)} is VALID [2022-04-28 04:09:58,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {3047#(= main_~a~0 0)} [112] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre9_252| |v_main_#t~pre9_248|)) (.cse1 (= |v_main_#t~pre7_97| |v_main_#t~pre7_96|)) (.cse2 (= v_main_~d~0_144 v_main_~d~0_142)) (.cse3 (= |v_main_#t~pre8_169| |v_main_#t~pre8_168|)) (.cse4 (= v_main_~c~0_116 v_main_~c~0_114)) (.cse5 (= v_main_~b~0_79 v_main_~b~0_77)) (.cse6 (= |v_main_#t~pre6_78| |v_main_#t~pre6_77|)) (.cse7 (= |v_main_#t~pre4_44| |v_main_#t~pre4_43|)) (.cse8 (= v_main_~f~0_345 v_main_~f~0_340)) (.cse9 (= |v_main_#t~pre5_52| |v_main_#t~pre5_51|)) (.cse10 (= v_main_~e~0_233 v_main_~e~0_231))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= v_main_~a~0_57 v_main_~a~0_58) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= v_main_~a~0_58 v_main_~a~0_57) .cse10))) InVars {main_~e~0=v_main_~e~0_233, main_~d~0=v_main_~d~0_144, main_~b~0=v_main_~b~0_79, main_~f~0=v_main_~f~0_345, main_#t~pre7=|v_main_#t~pre7_97|, main_~c~0=v_main_~c~0_116, main_#t~pre8=|v_main_#t~pre8_169|, main_#t~pre9=|v_main_#t~pre9_252|, 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_231, main_~d~0=v_main_~d~0_142, main_~b~0=v_main_~b~0_77, main_~f~0=v_main_~f~0_340, main_#t~pre7=|v_main_#t~pre7_96|, main_~c~0=v_main_~c~0_114, main_#t~pre8=|v_main_#t~pre8_168|, main_#t~pre9=|v_main_#t~pre9_248|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {3047#(= main_~a~0 0)} is VALID [2022-04-28 04:09:58,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {3047#(= main_~a~0 0)} [111] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {3043#false} is VALID [2022-04-28 04:09:58,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {3043#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {3043#false} is VALID [2022-04-28 04:09:58,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {3043#false} assume !false; {3043#false} is VALID [2022-04-28 04:09:58,711 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:58,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:58,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188370708] [2022-04-28 04:09:58,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188370708] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:58,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:58,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:09:58,875 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:58,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1302501514] [2022-04-28 04:09:58,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1302501514] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:58,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:58,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 04:09:58,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694592028] [2022-04-28 04:09:58,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:58,876 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (2), 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 32 [2022-04-28 04:09:58,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:58,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call 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,899 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:09:58,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 04:09:58,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:58,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 04:09:58,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-04-28 04:09:58,900 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call 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:59,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:59,324 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2022-04-28 04:09:59,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 04:09:59,325 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (2), 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 32 [2022-04-28 04:09:59,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:59,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call 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:59,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2022-04-28 04:09:59,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call 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:59,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2022-04-28 04:09:59,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 112 transitions. [2022-04-28 04:09:59,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:59,404 INFO L225 Difference]: With dead ends: 86 [2022-04-28 04:09:59,404 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 04:09:59,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=338, Unknown=0, NotChecked=0, Total=506 [2022-04-28 04:09:59,404 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 140 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:59,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 36 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:09:59,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 04:09:59,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 35. [2022-04-28 04:09:59,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:59,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 35 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call 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:59,412 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 35 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call 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:59,412 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 35 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call 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:59,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:59,413 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2022-04-28 04:09:59,413 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2022-04-28 04:09:59,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:59,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:59,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 2 states have call successors, (2), 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 71 states. [2022-04-28 04:09:59,413 INFO L87 Difference]: Start difference. First operand has 35 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 2 states have call successors, (2), 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 71 states. [2022-04-28 04:09:59,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:59,426 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2022-04-28 04:09:59,426 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2022-04-28 04:09:59,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:59,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:59,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:59,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:59,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call 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:59,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-04-28 04:09:59,427 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 32 [2022-04-28 04:09:59,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:59,427 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-04-28 04:09:59,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call 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:59,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 40 transitions. [2022-04-28 04:09:59,477 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:59,477 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-28 04:09:59,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 04:09:59,477 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:59,478 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, 1, 1, 1] [2022-04-28 04:09:59,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 04:09:59,478 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:59,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:59,478 INFO L85 PathProgramCache]: Analyzing trace with hash 372310288, now seen corresponding path program 5 times [2022-04-28 04:09:59,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:59,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1637067106] [2022-04-28 04:10:03,586 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:03,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:10:03,674 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:10:07,735 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:07,776 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,810 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:10:09,882 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:09,922 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:09,956 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:10:12,812 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:12,853 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:12,890 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:10:15,634 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:15,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:10:15,799 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:15,800 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:10:15,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1832154091, now seen corresponding path program 1 times [2022-04-28 04:10:15,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:10:15,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283353625] [2022-04-28 04:10:15,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:15,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:10:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:15,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:10:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:15,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {3470#(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); {3464#true} is VALID [2022-04-28 04:10:15,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {3464#true} assume true; {3464#true} is VALID [2022-04-28 04:10:15,836 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3464#true} {3464#true} #92#return; {3464#true} is VALID [2022-04-28 04:10:15,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {3464#true} call ULTIMATE.init(); {3470#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:10:15,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {3470#(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); {3464#true} is VALID [2022-04-28 04:10:15,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {3464#true} assume true; {3464#true} is VALID [2022-04-28 04:10:15,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3464#true} {3464#true} #92#return; {3464#true} is VALID [2022-04-28 04:10:15,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {3464#true} call #t~ret10 := main(); {3464#true} is VALID [2022-04-28 04:10:15,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {3464#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {3469#(= main_~a~0 0)} is VALID [2022-04-28 04:10:15,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {3469#(= main_~a~0 0)} [114] 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_~e~0_267 v_main_~e~0_265)) (.cse6 (= |v_main_#t~pre6_85| |v_main_#t~pre6_84|)) (.cse7 (= |v_main_#t~pre9_328| |v_main_#t~pre9_323|)) (.cse8 (= |v_main_#t~pre4_49| |v_main_#t~pre4_48|)) (.cse9 (= v_main_~a~0_64 v_main_~a~0_63)) (.cse10 (= |v_main_#t~pre8_198| |v_main_#t~pre8_197|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= v_main_~f~0_426 v_main_~f~0_432) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= v_main_~f~0_432 v_main_~f~0_426) .cse10))) InVars {main_~e~0=v_main_~e~0_267, main_~d~0=v_main_~d~0_156, main_~b~0=v_main_~b~0_87, main_~f~0=v_main_~f~0_432, main_#t~pre7=|v_main_#t~pre7_105|, main_~c~0=v_main_~c~0_126, main_#t~pre8=|v_main_#t~pre8_198|, main_#t~pre9=|v_main_#t~pre9_328|, 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_265, main_~d~0=v_main_~d~0_154, main_~b~0=v_main_~b~0_85, main_~f~0=v_main_~f~0_426, main_#t~pre7=|v_main_#t~pre7_104|, main_~c~0=v_main_~c~0_124, main_#t~pre8=|v_main_#t~pre8_197|, main_#t~pre9=|v_main_#t~pre9_323|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {3469#(= main_~a~0 0)} is VALID [2022-04-28 04:10:15,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {3469#(= main_~a~0 0)} [113] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {3465#false} is VALID [2022-04-28 04:10:15,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {3465#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {3465#false} is VALID [2022-04-28 04:10:15,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {3465#false} assume !false; {3465#false} is VALID [2022-04-28 04:10:15,839 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:15,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:10:15,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283353625] [2022-04-28 04:10:15,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283353625] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:15,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:15,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:10:16,025 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:10:16,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1637067106] [2022-04-28 04:10:16,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1637067106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:16,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:16,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 04:10:16,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813219073] [2022-04-28 04:10:16,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:10:16,026 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 1 states have call successors, (2), 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 34 [2022-04-28 04:10:16,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:10:16,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call 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:16,047 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:10:16,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 04:10:16,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:16,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 04:10:16,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2022-04-28 04:10:16,048 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call 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:16,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:16,479 INFO L93 Difference]: Finished difference Result 88 states and 114 transitions. [2022-04-28 04:10:16,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 04:10:16,479 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 1 states have call successors, (2), 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 34 [2022-04-28 04:10:16,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:16,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call 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:16,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 114 transitions. [2022-04-28 04:10:16,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call 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:16,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 114 transitions. [2022-04-28 04:10:16,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 114 transitions. [2022-04-28 04:10:16,559 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:10:16,560 INFO L225 Difference]: With dead ends: 88 [2022-04-28 04:10:16,560 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 04:10:16,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2022-04-28 04:10:16,561 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 166 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:10:16,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 26 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:10:16,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 04:10:16,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 37. [2022-04-28 04:10:16,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:16,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 37 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 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:10:16,569 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 37 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 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:10:16,569 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 37 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 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:10:16,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:16,572 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2022-04-28 04:10:16,572 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2022-04-28 04:10:16,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:16,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:16,573 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 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 73 states. [2022-04-28 04:10:16,573 INFO L87 Difference]: Start difference. First operand has 37 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 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 73 states. [2022-04-28 04:10:16,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:16,574 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2022-04-28 04:10:16,574 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2022-04-28 04:10:16,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:16,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:16,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:16,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:16,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 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:10:16,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-04-28 04:10:16,575 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 34 [2022-04-28 04:10:16,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:16,575 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-04-28 04:10:16,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call 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:16,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 42 transitions. [2022-04-28 04:10:16,628 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:16,628 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-28 04:10:16,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 04:10:16,629 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:16,629 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, 1, 1, 1] [2022-04-28 04:10:16,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 04:10:16,629 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:16,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:16,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1223710958, now seen corresponding path program 6 times [2022-04-28 04:10:16,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:16,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1787663717] [2022-04-28 04:10:20,768 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:20,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:10:20,937 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:10:25,013 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:25,074 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:25,202 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:10:27,323 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,439 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:10:29,299 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:29,422 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:10:33,508 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:33,550 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:33,690 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:33,691 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:10:33,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1832215595, now seen corresponding path program 1 times [2022-04-28 04:10:33,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:10:33,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485720851] [2022-04-28 04:10:33,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:33,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:10:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:33,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:10:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:33,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {3907#(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); {3901#true} is VALID [2022-04-28 04:10:33,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {3901#true} assume true; {3901#true} is VALID [2022-04-28 04:10:33,729 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3901#true} {3901#true} #92#return; {3901#true} is VALID [2022-04-28 04:10:33,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {3901#true} call ULTIMATE.init(); {3907#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:10:33,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {3907#(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); {3901#true} is VALID [2022-04-28 04:10:33,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {3901#true} assume true; {3901#true} is VALID [2022-04-28 04:10:33,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3901#true} {3901#true} #92#return; {3901#true} is VALID [2022-04-28 04:10:33,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {3901#true} call #t~ret10 := main(); {3901#true} is VALID [2022-04-28 04:10:33,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {3901#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {3906#(= main_~a~0 0)} is VALID [2022-04-28 04:10:33,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {3906#(= main_~a~0 0)} [116] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_64| |v_main_#t~pre5_63|)) (.cse1 (= |v_main_#t~pre8_227| |v_main_#t~pre8_226|)) (.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_~f~0_525 v_main_~f~0_518)) (.cse5 (= |v_main_#t~pre6_92| |v_main_#t~pre6_91|)) (.cse6 (= |v_main_#t~pre9_409| |v_main_#t~pre9_403|)) (.cse7 (= v_main_~d~0_168 v_main_~d~0_166)) (.cse8 (= |v_main_#t~pre7_113| |v_main_#t~pre7_112|)) (.cse9 (= v_main_~e~0_301 v_main_~e~0_299)) (.cse10 (= v_main_~b~0_95 v_main_~b~0_93))) (or (and (= v_main_~a~0_69 v_main_~a~0_70) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= v_main_~a~0_70 v_main_~a~0_69)))) InVars {main_~e~0=v_main_~e~0_301, main_~d~0=v_main_~d~0_168, main_~b~0=v_main_~b~0_95, main_~f~0=v_main_~f~0_525, main_#t~pre7=|v_main_#t~pre7_113|, main_~c~0=v_main_~c~0_136, main_#t~pre8=|v_main_#t~pre8_227|, main_#t~pre9=|v_main_#t~pre9_409|, 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_299, main_~d~0=v_main_~d~0_166, main_~b~0=v_main_~b~0_93, main_~f~0=v_main_~f~0_518, main_#t~pre7=|v_main_#t~pre7_112|, main_~c~0=v_main_~c~0_134, main_#t~pre8=|v_main_#t~pre8_226|, main_#t~pre9=|v_main_#t~pre9_403|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {3906#(= main_~a~0 0)} is VALID [2022-04-28 04:10:33,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {3906#(= main_~a~0 0)} [115] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {3902#false} is VALID [2022-04-28 04:10:33,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {3902#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {3902#false} is VALID [2022-04-28 04:10:33,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {3902#false} assume !false; {3902#false} is VALID [2022-04-28 04:10:33,736 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:33,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:10:33,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485720851] [2022-04-28 04:10:33,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485720851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:33,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:33,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:10:33,992 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:10:33,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1787663717] [2022-04-28 04:10:33,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1787663717] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:33,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:33,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 04:10:33,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960834404] [2022-04-28 04:10:33,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:10:33,993 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:10:33,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:10:33,993 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:10:34,015 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:10:34,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 04:10:34,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:34,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 04:10:34,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-04-28 04:10:34,016 INFO L87 Difference]: Start difference. First operand 37 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:10:34,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:34,566 INFO L93 Difference]: Finished difference Result 88 states and 114 transitions. [2022-04-28 04:10:34,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 04:10:34,566 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:10:34,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:34,566 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:10:34,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 114 transitions. [2022-04-28 04:10:34,567 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:10:34,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 114 transitions. [2022-04-28 04:10:34,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 114 transitions. [2022-04-28 04:10:34,645 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:10:34,646 INFO L225 Difference]: With dead ends: 88 [2022-04-28 04:10:34,646 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 04:10:34,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=584, Unknown=0, NotChecked=0, Total=812 [2022-04-28 04:10:34,647 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 153 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:10:34,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 35 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:10:34,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 04:10:34,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 41. [2022-04-28 04:10:34,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:34,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 41 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call 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:34,657 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 41 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call 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:34,657 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 41 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call 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:34,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:34,658 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-04-28 04:10:34,658 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2022-04-28 04:10:34,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:34,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:34,658 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 2 states have call successors, (2), 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:34,658 INFO L87 Difference]: Start difference. First operand has 41 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 2 states have call successors, (2), 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:34,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:34,659 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-04-28 04:10:34,659 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2022-04-28 04:10:34,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:34,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:34,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:34,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:34,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call 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:34,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-04-28 04:10:34,660 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 36 [2022-04-28 04:10:34,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:34,660 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-04-28 04:10:34,660 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:10:34,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 46 transitions. [2022-04-28 04:10:34,725 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:34,725 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-28 04:10:34,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 04:10:34,725 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:34,725 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, 1, 1, 1] [2022-04-28 04:10:34,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 04:10:34,726 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:34,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:34,726 INFO L85 PathProgramCache]: Analyzing trace with hash -989686073, now seen corresponding path program 7 times [2022-04-28 04:10:34,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:34,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1636169505] [2022-04-28 04:10:38,909 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:38,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:10:39,046 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:39,069 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:10:39,069 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:10:39,097 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:10:41,242 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:41,285 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,376 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,400 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:10:41,400 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:10:41,432 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:10:45,487 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:45,529 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,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:10:45,654 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:10:45,654 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:10:45,684 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:10:49,747 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:49,788 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,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:10:49,899 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:10:49,899 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:10:49,925 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:10:53,251 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:53,292 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:53,375 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:53,543 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:53,544 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:10:53,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1832277099, now seen corresponding path program 1 times [2022-04-28 04:10:53,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:10:53,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727335678] [2022-04-28 04:10:53,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:53,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:10:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:53,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:10:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:53,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {4358#(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); {4352#true} is VALID [2022-04-28 04:10:53,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {4352#true} assume true; {4352#true} is VALID [2022-04-28 04:10:53,567 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4352#true} {4352#true} #92#return; {4352#true} is VALID [2022-04-28 04:10:53,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {4352#true} call ULTIMATE.init(); {4358#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:10:53,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {4358#(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); {4352#true} is VALID [2022-04-28 04:10:53,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {4352#true} assume true; {4352#true} is VALID [2022-04-28 04:10:53,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4352#true} {4352#true} #92#return; {4352#true} is VALID [2022-04-28 04:10:53,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {4352#true} call #t~ret10 := main(); {4352#true} is VALID [2022-04-28 04:10:53,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {4352#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {4357#(= main_~a~0 0)} is VALID [2022-04-28 04:10:53,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {4357#(= main_~a~0 0)} [118] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~e~0_377 v_main_~e~0_374)) (.cse1 (= |v_main_#t~pre6_99| |v_main_#t~pre6_98|)) (.cse2 (= |v_main_#t~pre7_121| |v_main_#t~pre7_120|)) (.cse3 (= v_main_~a~0_76 v_main_~a~0_75)) (.cse4 (= v_main_~c~0_146 v_main_~c~0_144)) (.cse5 (= |v_main_#t~pre9_474| |v_main_#t~pre9_468|)) (.cse6 (= v_main_~b~0_103 v_main_~b~0_101)) (.cse7 (= |v_main_#t~pre4_59| |v_main_#t~pre4_58|)) (.cse8 (= |v_main_#t~pre8_291| |v_main_#t~pre8_289|))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~d~0_178 v_main_~d~0_180) .cse4 .cse5 .cse6 .cse7 .cse8 (= |v_main_#t~pre5_69| |v_main_#t~pre5_70|) (= v_main_~f~0_647 v_main_~f~0_655)) (and .cse0 .cse1 .cse2 .cse3 (= v_main_~d~0_180 v_main_~d~0_178) .cse4 .cse5 .cse6 .cse7 (= |v_main_#t~pre5_70| |v_main_#t~pre5_69|) .cse8 (= v_main_~f~0_655 v_main_~f~0_647)))) InVars {main_~e~0=v_main_~e~0_377, main_~d~0=v_main_~d~0_180, main_~b~0=v_main_~b~0_103, main_~f~0=v_main_~f~0_655, main_#t~pre7=|v_main_#t~pre7_121|, main_~c~0=v_main_~c~0_146, main_#t~pre8=|v_main_#t~pre8_291|, main_#t~pre9=|v_main_#t~pre9_474|, 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_374, main_~d~0=v_main_~d~0_178, main_~b~0=v_main_~b~0_101, main_~f~0=v_main_~f~0_647, main_#t~pre7=|v_main_#t~pre7_120|, main_~c~0=v_main_~c~0_144, main_#t~pre8=|v_main_#t~pre8_289|, main_#t~pre9=|v_main_#t~pre9_468|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {4357#(= main_~a~0 0)} is VALID [2022-04-28 04:10:53,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {4357#(= main_~a~0 0)} [117] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {4353#false} is VALID [2022-04-28 04:10:53,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {4353#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {4353#false} is VALID [2022-04-28 04:10:53,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {4353#false} assume !false; {4353#false} is VALID [2022-04-28 04:10:53,570 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:53,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:10:53,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727335678] [2022-04-28 04:10:53,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727335678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:53,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:53,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:10:53,834 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:10:53,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1636169505] [2022-04-28 04:10:53,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1636169505] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:53,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:53,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 04:10:53,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464484006] [2022-04-28 04:10:53,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:10:53,835 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-28 04:10:53,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:10:53,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call 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,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:53,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 04:10:53,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:53,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 04:10:53,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2022-04-28 04:10:53,863 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call 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:54,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:54,498 INFO L93 Difference]: Finished difference Result 90 states and 115 transitions. [2022-04-28 04:10:54,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 04:10:54,499 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-28 04:10:54,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:54,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call 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:54,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 115 transitions. [2022-04-28 04:10:54,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call 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:54,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 115 transitions. [2022-04-28 04:10:54,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 115 transitions. [2022-04-28 04:10:54,583 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:10:54,583 INFO L225 Difference]: With dead ends: 90 [2022-04-28 04:10:54,583 INFO L226 Difference]: Without dead ends: 75 [2022-04-28 04:10:54,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=246, Invalid=684, Unknown=0, NotChecked=0, Total=930 [2022-04-28 04:10:54,584 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 156 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:10:54,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 35 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:10:54,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-28 04:10:54,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 42. [2022-04-28 04:10:54,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:54,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 42 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 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:10:54,596 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 42 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 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:10:54,597 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 42 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 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:10:54,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:54,598 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2022-04-28 04:10:54,598 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2022-04-28 04:10:54,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:54,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:54,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 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 75 states. [2022-04-28 04:10:54,598 INFO L87 Difference]: Start difference. First operand has 42 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 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 75 states. [2022-04-28 04:10:54,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:54,599 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2022-04-28 04:10:54,599 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2022-04-28 04:10:54,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:54,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:54,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:54,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:54,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 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:10:54,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-28 04:10:54,600 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 39 [2022-04-28 04:10:54,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:54,600 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-28 04:10:54,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call 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:54,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 47 transitions. [2022-04-28 04:10:54,667 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:10:54,667 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-28 04:10:54,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 04:10:54,668 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:54,668 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, 1, 1, 1] [2022-04-28 04:10:54,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 04:10:54,668 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:54,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:54,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1984733979, now seen corresponding path program 8 times [2022-04-28 04:10:54,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:54,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [217763643] [2022-04-28 04:10:54,895 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:54,983 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:55,115 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:10:55,165 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:10:55,255 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:55,340 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:55,469 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:10:55,507 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:10:55,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:10:55,685 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:55,807 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:10:55,845 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:10:55,933 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:56,015 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:56,140 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:10:56,178 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:10:56,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:10:56,344 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:56,500 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:56,500 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:10:56,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1832338603, now seen corresponding path program 1 times [2022-04-28 04:10:56,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:10:56,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010229515] [2022-04-28 04:10:56,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:56,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:10:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:56,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:10:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:56,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {4822#(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); {4816#true} is VALID [2022-04-28 04:10:56,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {4816#true} assume true; {4816#true} is VALID [2022-04-28 04:10:56,530 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4816#true} {4816#true} #92#return; {4816#true} is VALID [2022-04-28 04:10:56,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {4816#true} call ULTIMATE.init(); {4822#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:10:56,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {4822#(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); {4816#true} is VALID [2022-04-28 04:10:56,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {4816#true} assume true; {4816#true} is VALID [2022-04-28 04:10:56,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4816#true} {4816#true} #92#return; {4816#true} is VALID [2022-04-28 04:10:56,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {4816#true} call #t~ret10 := main(); {4816#true} is VALID [2022-04-28 04:10:56,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {4816#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {4821#(= main_~a~0 0)} is VALID [2022-04-28 04:10:56,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {4821#(= main_~a~0 0)} [120] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_76| |v_main_#t~pre5_75|)) (.cse1 (= |v_main_#t~pre8_372| |v_main_#t~pre8_370|)) (.cse2 (= |v_main_#t~pre7_129| |v_main_#t~pre7_128|)) (.cse3 (= |v_main_#t~pre6_106| |v_main_#t~pre6_105|)) (.cse4 (= v_main_~a~0_82 v_main_~a~0_81)) (.cse5 (= |v_main_#t~pre4_64| |v_main_#t~pre4_63|)) (.cse6 (= v_main_~e~0_467 v_main_~e~0_464)) (.cse7 (= v_main_~c~0_156 v_main_~c~0_154))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~b~0_111 v_main_~b~0_109) (= v_main_~d~0_192 v_main_~d~0_190) .cse4 (= |v_main_#t~pre9_581| |v_main_#t~pre9_574|) .cse5 .cse6 (= v_main_~f~0_810 v_main_~f~0_801) .cse7) (and .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~pre9_574| |v_main_#t~pre9_581|) (= v_main_~f~0_801 v_main_~f~0_810) (= v_main_~d~0_190 v_main_~d~0_192) .cse4 .cse5 .cse6 .cse7 (= v_main_~b~0_109 v_main_~b~0_111)))) InVars {main_~e~0=v_main_~e~0_467, main_~d~0=v_main_~d~0_192, main_~b~0=v_main_~b~0_111, main_~f~0=v_main_~f~0_810, main_#t~pre7=|v_main_#t~pre7_129|, main_~c~0=v_main_~c~0_156, main_#t~pre8=|v_main_#t~pre8_372|, main_#t~pre9=|v_main_#t~pre9_581|, 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_464, main_~d~0=v_main_~d~0_190, main_~b~0=v_main_~b~0_109, main_~f~0=v_main_~f~0_801, main_#t~pre7=|v_main_#t~pre7_128|, main_~c~0=v_main_~c~0_154, main_#t~pre8=|v_main_#t~pre8_370|, main_#t~pre9=|v_main_#t~pre9_574|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {4821#(= main_~a~0 0)} is VALID [2022-04-28 04:10:56,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {4821#(= main_~a~0 0)} [119] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {4817#false} is VALID [2022-04-28 04:10:56,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {4817#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {4817#false} is VALID [2022-04-28 04:10:56,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {4817#false} assume !false; {4817#false} is VALID [2022-04-28 04:10:56,533 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:56,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:10:56,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010229515] [2022-04-28 04:10:56,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010229515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:56,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:56,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:10:56,805 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:10:56,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [217763643] [2022-04-28 04:10:56,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [217763643] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:56,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:56,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 04:10:56,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779952898] [2022-04-28 04:10:56,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:10:56,806 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (2), 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 41 [2022-04-28 04:10:56,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:10:56,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call 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:56,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:56,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 04:10:56,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:56,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 04:10:56,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-04-28 04:10:56,832 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call 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:57,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:57,524 INFO L93 Difference]: Finished difference Result 92 states and 117 transitions. [2022-04-28 04:10:57,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 04:10:57,525 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (2), 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 41 [2022-04-28 04:10:57,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:57,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call 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:57,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 117 transitions. [2022-04-28 04:10:57,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call 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:57,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 117 transitions. [2022-04-28 04:10:57,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 117 transitions. [2022-04-28 04:10:57,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:57,619 INFO L225 Difference]: With dead ends: 92 [2022-04-28 04:10:57,619 INFO L226 Difference]: Without dead ends: 77 [2022-04-28 04:10:57,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=792, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 04:10:57,620 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 143 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:10:57,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 50 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:10:57,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-28 04:10:57,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 44. [2022-04-28 04:10:57,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:57,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 44 states, 40 states have (on average 1.15) internal successors, (46), 40 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:57,636 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 44 states, 40 states have (on average 1.15) internal successors, (46), 40 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:57,636 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 44 states, 40 states have (on average 1.15) internal successors, (46), 40 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:57,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:57,637 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2022-04-28 04:10:57,637 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2022-04-28 04:10:57,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:57,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:57,638 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 40 states have (on average 1.15) internal successors, (46), 40 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 77 states. [2022-04-28 04:10:57,638 INFO L87 Difference]: Start difference. First operand has 44 states, 40 states have (on average 1.15) internal successors, (46), 40 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 77 states. [2022-04-28 04:10:57,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:57,639 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2022-04-28 04:10:57,639 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2022-04-28 04:10:57,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:57,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:57,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:57,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.15) internal successors, (46), 40 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:57,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2022-04-28 04:10:57,640 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 41 [2022-04-28 04:10:57,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:57,640 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2022-04-28 04:10:57,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call 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:57,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 49 transitions. [2022-04-28 04:10:57,708 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:57,708 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-28 04:10:57,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 04:10:57,708 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:57,709 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, 1, 1, 1] [2022-04-28 04:10:57,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 04:10:57,709 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:57,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:57,709 INFO L85 PathProgramCache]: Analyzing trace with hash -448064637, now seen corresponding path program 9 times [2022-04-28 04:10:57,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:57,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [33453867] [2022-04-28 04:11:01,910 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:01,952 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,035 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,057 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:11:02,057 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:11:02,087 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:11:06,144 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:06,187 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,289 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,312 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:11:06,312 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:11:06,345 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:11:08,427 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:08,468 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:08,551 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:08,575 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:11:08,575 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:11:08,604 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:11:12,668 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:12,709 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:12,795 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:12,820 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:11:12,820 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:11:12,850 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:11:16,924 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:16,964 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:17,044 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:17,197 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:17,197 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:11:17,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1832400107, now seen corresponding path program 1 times [2022-04-28 04:11:17,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:11:17,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333383054] [2022-04-28 04:11:17,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:11:17,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:11:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:17,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:11:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:17,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {5301#(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); {5295#true} is VALID [2022-04-28 04:11:17,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {5295#true} assume true; {5295#true} is VALID [2022-04-28 04:11:17,227 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5295#true} {5295#true} #92#return; {5295#true} is VALID [2022-04-28 04:11:17,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {5295#true} call ULTIMATE.init(); {5301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:11:17,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {5301#(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); {5295#true} is VALID [2022-04-28 04:11:17,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {5295#true} assume true; {5295#true} is VALID [2022-04-28 04:11:17,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5295#true} {5295#true} #92#return; {5295#true} is VALID [2022-04-28 04:11:17,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {5295#true} call #t~ret10 := main(); {5295#true} is VALID [2022-04-28 04:11:17,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {5295#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {5300#(= main_~a~0 0)} is VALID [2022-04-28 04:11:17,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {5300#(= main_~a~0 0)} [122] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_166 v_main_~c~0_164)) (.cse1 (= |v_main_#t~pre7_137| |v_main_#t~pre7_136|)) (.cse2 (= |v_main_#t~pre8_437| |v_main_#t~pre8_435|)) (.cse3 (= v_main_~e~0_545 v_main_~e~0_542)) (.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)) (.cse9 (= v_main_~d~0_204 v_main_~d~0_202))) (or (and .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~pre9_677| |v_main_#t~pre9_669|) .cse4 .cse5 .cse6 .cse7 .cse8 (= v_main_~f~0_955 v_main_~f~0_945) .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |v_main_#t~pre9_669| |v_main_#t~pre9_677|) .cse8 .cse9 (= v_main_~f~0_945 v_main_~f~0_955)))) InVars {main_~e~0=v_main_~e~0_545, main_~d~0=v_main_~d~0_204, main_~b~0=v_main_~b~0_119, main_~f~0=v_main_~f~0_955, main_#t~pre7=|v_main_#t~pre7_137|, main_~c~0=v_main_~c~0_166, main_#t~pre8=|v_main_#t~pre8_437|, main_#t~pre9=|v_main_#t~pre9_677|, 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_542, main_~d~0=v_main_~d~0_202, main_~b~0=v_main_~b~0_117, main_~f~0=v_main_~f~0_945, main_#t~pre7=|v_main_#t~pre7_136|, main_~c~0=v_main_~c~0_164, main_#t~pre8=|v_main_#t~pre8_435|, main_#t~pre9=|v_main_#t~pre9_669|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {5300#(= main_~a~0 0)} is VALID [2022-04-28 04:11:17,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {5300#(= main_~a~0 0)} [121] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {5296#false} is VALID [2022-04-28 04:11:17,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {5296#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {5296#false} is VALID [2022-04-28 04:11:17,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {5296#false} assume !false; {5296#false} is VALID [2022-04-28 04:11:17,232 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:17,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:11:17,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333383054] [2022-04-28 04:11:17,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333383054] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:17,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:17,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:11:17,559 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:11:17,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [33453867] [2022-04-28 04:11:17,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [33453867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:17,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:17,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 04:11:17,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298422481] [2022-04-28 04:11:17,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:11:17,560 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (2), 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 43 [2022-04-28 04:11:17,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:11:17,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call 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:17,589 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:11:17,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 04:11:17,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:17,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 04:11:17,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-04-28 04:11:17,590 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call 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:18,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:18,413 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2022-04-28 04:11:18,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 04:11:18,413 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (2), 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 43 [2022-04-28 04:11:18,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:11:18,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call 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:18,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 119 transitions. [2022-04-28 04:11:18,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call 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:18,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 119 transitions. [2022-04-28 04:11:18,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 119 transitions. [2022-04-28 04:11:18,499 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:11:18,500 INFO L225 Difference]: With dead ends: 94 [2022-04-28 04:11:18,500 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 04:11:18,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=282, Invalid=908, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 04:11:18,500 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 170 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:11:18,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 40 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 04:11:18,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 04:11:18,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 46. [2022-04-28 04:11:18,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:11:18,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 46 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 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:11:18,513 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 46 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 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:11:18,513 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 46 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 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:11:18,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:18,514 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2022-04-28 04:11:18,514 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-04-28 04:11:18,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:18,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:18,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 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 79 states. [2022-04-28 04:11:18,514 INFO L87 Difference]: Start difference. First operand has 46 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 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 79 states. [2022-04-28 04:11:18,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:18,515 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2022-04-28 04:11:18,515 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-04-28 04:11:18,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:18,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:18,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:11:18,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:11:18,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 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:11:18,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-04-28 04:11:18,516 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 43 [2022-04-28 04:11:18,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:11:18,517 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-04-28 04:11:18,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call 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:18,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 51 transitions. [2022-04-28 04:11:18,589 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:18,589 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-28 04:11:18,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 04:11:18,589 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:11:18,589 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, 1, 1, 1] [2022-04-28 04:11:18,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 04:11:18,589 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:11:18,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:11:18,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1177576799, now seen corresponding path program 10 times [2022-04-28 04:11:18,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:18,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1095490414] [2022-04-28 04:11:18,851 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:18,934 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:18,957 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:11:18,957 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:11:18,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:11:19,083 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:19,175 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:19,200 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:11:19,201 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:11:19,232 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:11:19,334 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:19,428 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:19,450 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:11:19,450 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:11:19,500 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:11:19,604 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:19,685 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:19,708 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:11:19,708 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:11:19,738 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:11:19,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:11:19,919 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:20,061 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:20,061 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:11:20,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1832461611, now seen corresponding path program 1 times [2022-04-28 04:11:20,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:11:20,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316922419] [2022-04-28 04:11:20,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:11:20,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:11:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:20,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:11:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:20,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {5795#(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); {5789#true} is VALID [2022-04-28 04:11:20,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {5789#true} assume true; {5789#true} is VALID [2022-04-28 04:11:20,087 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5789#true} {5789#true} #92#return; {5789#true} is VALID [2022-04-28 04:11:20,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {5789#true} call ULTIMATE.init(); {5795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:11:20,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {5795#(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); {5789#true} is VALID [2022-04-28 04:11:20,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {5789#true} assume true; {5789#true} is VALID [2022-04-28 04:11:20,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5789#true} {5789#true} #92#return; {5789#true} is VALID [2022-04-28 04:11:20,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {5789#true} call #t~ret10 := main(); {5789#true} is VALID [2022-04-28 04:11:20,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {5789#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {5794#(= main_~a~0 0)} is VALID [2022-04-28 04:11:20,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {5794#(= main_~a~0 0)} [124] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_94 v_main_~a~0_93)) (.cse1 (= |v_main_#t~pre8_502| |v_main_#t~pre8_500|)) (.cse2 (= v_main_~e~0_623 v_main_~e~0_620)) (.cse3 (= v_main_~c~0_176 v_main_~c~0_174)) (.cse4 (= v_main_~b~0_127 v_main_~b~0_125)) (.cse5 (= v_main_~d~0_216 v_main_~d~0_214)) (.cse6 (= |v_main_#t~pre5_88| |v_main_#t~pre5_87|)) (.cse7 (= |v_main_#t~pre4_74| |v_main_#t~pre4_73|)) (.cse8 (= v_main_~f~0_1106 v_main_~f~0_1095)) (.cse9 (= |v_main_#t~pre7_145| |v_main_#t~pre7_144|))) (or (and .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~pre6_119| |v_main_#t~pre6_120|) .cse4 .cse5 .cse6 (= |v_main_#t~pre9_769| |v_main_#t~pre9_778|) .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~pre6_120| |v_main_#t~pre6_119|) .cse4 .cse5 (= |v_main_#t~pre9_778| |v_main_#t~pre9_769|) .cse6 .cse7 .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_623, main_~d~0=v_main_~d~0_216, main_~b~0=v_main_~b~0_127, main_~f~0=v_main_~f~0_1106, main_#t~pre7=|v_main_#t~pre7_145|, main_~c~0=v_main_~c~0_176, main_#t~pre8=|v_main_#t~pre8_502|, main_#t~pre9=|v_main_#t~pre9_778|, 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_620, main_~d~0=v_main_~d~0_214, main_~b~0=v_main_~b~0_125, main_~f~0=v_main_~f~0_1095, main_#t~pre7=|v_main_#t~pre7_144|, main_~c~0=v_main_~c~0_174, main_#t~pre8=|v_main_#t~pre8_500|, main_#t~pre9=|v_main_#t~pre9_769|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {5794#(= main_~a~0 0)} is VALID [2022-04-28 04:11:20,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {5794#(= main_~a~0 0)} [123] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {5790#false} is VALID [2022-04-28 04:11:20,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {5790#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {5790#false} is VALID [2022-04-28 04:11:20,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {5790#false} assume !false; {5790#false} is VALID [2022-04-28 04:11:20,105 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:20,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:11:20,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316922419] [2022-04-28 04:11:20,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316922419] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:20,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:20,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:11:20,433 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:11:20,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1095490414] [2022-04-28 04:11:20,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1095490414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:20,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:20,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 04:11:20,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479064253] [2022-04-28 04:11:20,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:11:20,434 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (2), 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 45 [2022-04-28 04:11:20,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:11:20,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call 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:20,462 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:11:20,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 04:11:20,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:20,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 04:11:20,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2022-04-28 04:11:20,463 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call 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:21,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:21,260 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2022-04-28 04:11:21,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 04:11:21,260 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (2), 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 45 [2022-04-28 04:11:21,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:11:21,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call 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:21,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 121 transitions. [2022-04-28 04:11:21,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call 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:21,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 121 transitions. [2022-04-28 04:11:21,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 121 transitions. [2022-04-28 04:11:21,343 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:11:21,344 INFO L225 Difference]: With dead ends: 96 [2022-04-28 04:11:21,344 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 04:11:21,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=1032, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 04:11:21,345 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 204 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:11:21,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 25 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 04:11:21,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 04:11:21,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 48. [2022-04-28 04:11:21,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:11:21,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 48 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call 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:21,359 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 48 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call 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:21,359 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 48 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call 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:21,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:21,360 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-28 04:11:21,360 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-28 04:11:21,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:21,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:21,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 2 states have call successors, (2), 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 81 states. [2022-04-28 04:11:21,360 INFO L87 Difference]: Start difference. First operand has 48 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 2 states have call successors, (2), 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 81 states. [2022-04-28 04:11:21,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:21,361 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-28 04:11:21,361 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-28 04:11:21,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:21,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:21,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:11:21,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:11:21,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call 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:21,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-04-28 04:11:21,362 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 45 [2022-04-28 04:11:21,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:11:21,362 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-04-28 04:11:21,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call 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:21,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 53 transitions. [2022-04-28 04:11:21,441 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:21,442 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-04-28 04:11:21,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 04:11:21,442 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:11:21,442 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, 1, 1, 1] [2022-04-28 04:11:21,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 04:11:21,442 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:11:21,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:11:21,442 INFO L85 PathProgramCache]: Analyzing trace with hash 2135872063, now seen corresponding path program 11 times [2022-04-28 04:11:21,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:21,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1509329187] [2022-04-28 04:11:21,681 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:21,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:11:21,785 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:11:21,785 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:11:21,815 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:11:21,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:11:22,003 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:22,026 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:11:22,026 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:11:22,056 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:11:22,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:11:22,253 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:22,275 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:11:22,275 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:11:22,304 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:11:22,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:11:22,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:11:22,510 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:11:22,511 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:11:22,540 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:11:22,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:11:22,722 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:22,872 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:22,872 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:11:22,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1832523115, now seen corresponding path program 1 times [2022-04-28 04:11:22,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:11:22,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191129191] [2022-04-28 04:11:22,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:11:22,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:11:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:22,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:11:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:22,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {6304#(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); {6298#true} is VALID [2022-04-28 04:11:22,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {6298#true} assume true; {6298#true} is VALID [2022-04-28 04:11:22,904 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6298#true} {6298#true} #92#return; {6298#true} is VALID [2022-04-28 04:11:22,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {6298#true} call ULTIMATE.init(); {6304#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:11:22,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {6304#(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); {6298#true} is VALID [2022-04-28 04:11:22,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {6298#true} assume true; {6298#true} is VALID [2022-04-28 04:11:22,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6298#true} {6298#true} #92#return; {6298#true} is VALID [2022-04-28 04:11:22,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {6298#true} call #t~ret10 := main(); {6298#true} is VALID [2022-04-28 04:11:22,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {6298#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {6303#(= main_~a~0 0)} is VALID [2022-04-28 04:11:22,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {6303#(= main_~a~0 0)} [126] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~d~0_228 v_main_~d~0_226)) (.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_~f~0_1263 v_main_~f~0_1251)) (.cse4 (= |v_main_#t~pre8_567| |v_main_#t~pre8_565|)) (.cse5 (= v_main_~e~0_701 v_main_~e~0_698)) (.cse6 (= |v_main_#t~pre7_153| |v_main_#t~pre7_152|)) (.cse7 (= v_main_~a~0_100 v_main_~a~0_99)) (.cse8 (= v_main_~b~0_135 v_main_~b~0_133)) (.cse9 (= v_main_~c~0_186 v_main_~c~0_184))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre9_884| |v_main_#t~pre9_874|) .cse5 .cse6 .cse7 (= |v_main_#t~pre4_79| |v_main_#t~pre4_78|) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~pre9_874| |v_main_#t~pre9_884|) .cse4 .cse5 .cse6 (= |v_main_#t~pre4_78| |v_main_#t~pre4_79|) .cse7 .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_701, main_~d~0=v_main_~d~0_228, main_~b~0=v_main_~b~0_135, main_~f~0=v_main_~f~0_1263, main_#t~pre7=|v_main_#t~pre7_153|, main_~c~0=v_main_~c~0_186, main_#t~pre8=|v_main_#t~pre8_567|, main_#t~pre9=|v_main_#t~pre9_884|, 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_698, main_~d~0=v_main_~d~0_226, main_~b~0=v_main_~b~0_133, main_~f~0=v_main_~f~0_1251, main_#t~pre7=|v_main_#t~pre7_152|, main_~c~0=v_main_~c~0_184, main_#t~pre8=|v_main_#t~pre8_565|, main_#t~pre9=|v_main_#t~pre9_874|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {6303#(= main_~a~0 0)} is VALID [2022-04-28 04:11:22,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {6303#(= main_~a~0 0)} [125] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {6299#false} is VALID [2022-04-28 04:11:22,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {6299#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {6299#false} is VALID [2022-04-28 04:11:22,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {6299#false} assume !false; {6299#false} is VALID [2022-04-28 04:11:22,906 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:22,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:11:22,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191129191] [2022-04-28 04:11:22,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191129191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:22,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:22,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:11:23,302 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:11:23,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1509329187] [2022-04-28 04:11:23,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1509329187] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:23,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:23,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 04:11:23,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144596891] [2022-04-28 04:11:23,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:11:23,303 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (2), 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 47 [2022-04-28 04:11:23,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:11:23,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call 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:23,337 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:11:23,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 04:11:23,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:23,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 04:11:23,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-04-28 04:11:23,337 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call 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:24,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:24,265 INFO L93 Difference]: Finished difference Result 98 states and 123 transitions. [2022-04-28 04:11:24,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 04:11:24,265 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (2), 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 47 [2022-04-28 04:11:24,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:11:24,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call 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:24,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 123 transitions. [2022-04-28 04:11:24,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call 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:24,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 123 transitions. [2022-04-28 04:11:24,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 123 transitions. [2022-04-28 04:11:24,361 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:11:24,362 INFO L225 Difference]: With dead ends: 98 [2022-04-28 04:11:24,362 INFO L226 Difference]: Without dead ends: 83 [2022-04-28 04:11:24,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=318, Invalid=1164, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 04:11:24,363 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 181 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:11:24,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 30 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 04:11:24,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-28 04:11:24,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 50. [2022-04-28 04:11:24,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:11:24,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 50 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 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:11:24,378 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 50 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 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:11:24,378 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 50 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 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:11:24,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:24,379 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2022-04-28 04:11:24,379 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2022-04-28 04:11:24,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:24,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:24,380 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 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 83 states. [2022-04-28 04:11:24,380 INFO L87 Difference]: Start difference. First operand has 50 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 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 83 states. [2022-04-28 04:11:24,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:24,381 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2022-04-28 04:11:24,381 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2022-04-28 04:11:24,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:24,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:24,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:11:24,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:11:24,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 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:11:24,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-04-28 04:11:24,382 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 47 [2022-04-28 04:11:24,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:11:24,382 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-04-28 04:11:24,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call 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:24,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 55 transitions. [2022-04-28 04:11:24,472 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:24,472 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-04-28 04:11:24,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 04:11:24,472 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:11:24,472 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, 1, 1, 1] [2022-04-28 04:11:24,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 04:11:24,473 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:11:24,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:11:24,474 INFO L85 PathProgramCache]: Analyzing trace with hash -505505187, now seen corresponding path program 12 times [2022-04-28 04:11:24,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:24,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [951563278] [2022-04-28 04:11:24,688 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,776 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,799 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:11:24,799 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:11:24,828 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:11:24,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:11:24,996 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:25,020 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:11:25,020 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:11:25,056 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:11:25,140 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:25,223 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:25,246 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:11:25,246 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:11:25,277 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:11:25,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:11:25,442 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:25,464 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:11:25,464 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:11:25,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:11:25,581 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:25,664 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:25,799 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:25,800 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:11:25,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1832584619, now seen corresponding path program 1 times [2022-04-28 04:11:25,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:11:25,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173051659] [2022-04-28 04:11:25,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:11:25,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:11:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:25,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:11:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:25,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {6828#(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); {6822#true} is VALID [2022-04-28 04:11:25,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {6822#true} assume true; {6822#true} is VALID [2022-04-28 04:11:25,848 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6822#true} {6822#true} #92#return; {6822#true} is VALID [2022-04-28 04:11:25,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {6822#true} call ULTIMATE.init(); {6828#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:11:25,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {6828#(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); {6822#true} is VALID [2022-04-28 04:11:25,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {6822#true} assume true; {6822#true} is VALID [2022-04-28 04:11:25,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6822#true} {6822#true} #92#return; {6822#true} is VALID [2022-04-28 04:11:25,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {6822#true} call #t~ret10 := main(); {6822#true} is VALID [2022-04-28 04:11:25,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {6822#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {6827#(= main_~a~0 0)} is VALID [2022-04-28 04:11:25,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {6827#(= main_~a~0 0)} [128] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre8_632| |v_main_#t~pre8_630|)) (.cse1 (= |v_main_#t~pre6_134| |v_main_#t~pre6_133|)) (.cse2 (= |v_main_#t~pre9_995| |v_main_#t~pre9_984|)) (.cse3 (= v_main_~b~0_143 v_main_~b~0_141)) (.cse4 (= v_main_~d~0_240 v_main_~d~0_238)) (.cse5 (= v_main_~a~0_106 v_main_~a~0_105)) (.cse6 (= v_main_~c~0_196 v_main_~c~0_194)) (.cse7 (= |v_main_#t~pre7_161| |v_main_#t~pre7_160|)) (.cse8 (= |v_main_#t~pre4_84| |v_main_#t~pre4_83|)) (.cse9 (= v_main_~f~0_1426 v_main_~f~0_1413))) (or (and .cse0 .cse1 .cse2 (= v_main_~e~0_776 v_main_~e~0_779) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |v_main_#t~pre5_99| |v_main_#t~pre5_100|) .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre5_100| |v_main_#t~pre5_99|) .cse5 .cse6 (= v_main_~e~0_779 v_main_~e~0_776) .cse7 .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_779, main_~d~0=v_main_~d~0_240, main_~b~0=v_main_~b~0_143, main_~f~0=v_main_~f~0_1426, main_#t~pre7=|v_main_#t~pre7_161|, main_~c~0=v_main_~c~0_196, main_#t~pre8=|v_main_#t~pre8_632|, main_#t~pre9=|v_main_#t~pre9_995|, 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_776, main_~d~0=v_main_~d~0_238, main_~b~0=v_main_~b~0_141, main_~f~0=v_main_~f~0_1413, main_#t~pre7=|v_main_#t~pre7_160|, main_~c~0=v_main_~c~0_194, main_#t~pre8=|v_main_#t~pre8_630|, main_#t~pre9=|v_main_#t~pre9_984|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {6827#(= main_~a~0 0)} is VALID [2022-04-28 04:11:25,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {6827#(= main_~a~0 0)} [127] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {6823#false} is VALID [2022-04-28 04:11:25,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {6823#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {6823#false} is VALID [2022-04-28 04:11:25,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {6823#false} assume !false; {6823#false} is VALID [2022-04-28 04:11:25,851 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:25,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:11:25,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173051659] [2022-04-28 04:11:25,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173051659] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:25,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:25,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:11:26,277 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:11:26,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [951563278] [2022-04-28 04:11:26,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [951563278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:26,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:26,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 04:11:26,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68391169] [2022-04-28 04:11:26,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:11:26,278 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 1 states have call successors, (2), 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 49 [2022-04-28 04:11:26,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:11:26,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call 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:26,308 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:11:26,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 04:11:26,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:26,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 04:11:26,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2022-04-28 04:11:26,309 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call 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:27,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:27,306 INFO L93 Difference]: Finished difference Result 102 states and 128 transitions. [2022-04-28 04:11:27,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 04:11:27,306 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 1 states have call successors, (2), 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 49 [2022-04-28 04:11:27,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:11:27,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call 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:27,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 128 transitions. [2022-04-28 04:11:27,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call 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:27,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 128 transitions. [2022-04-28 04:11:27,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 128 transitions. [2022-04-28 04:11:27,398 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:11:27,398 INFO L225 Difference]: With dead ends: 102 [2022-04-28 04:11:27,398 INFO L226 Difference]: Without dead ends: 87 [2022-04-28 04:11:27,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=336, Invalid=1304, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 04:11:27,399 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 163 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:11:27,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 30 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 04:11:27,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-28 04:11:27,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 54. [2022-04-28 04:11:27,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:11:27,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 54 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call 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:27,420 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 54 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call 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:27,420 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 54 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call 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:27,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:27,422 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2022-04-28 04:11:27,422 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2022-04-28 04:11:27,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:27,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:27,422 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 2 states have call successors, (2), 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 87 states. [2022-04-28 04:11:27,422 INFO L87 Difference]: Start difference. First operand has 54 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 2 states have call successors, (2), 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 87 states. [2022-04-28 04:11:27,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:27,423 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2022-04-28 04:11:27,423 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2022-04-28 04:11:27,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:27,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:27,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:11:27,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:11:27,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call 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:27,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2022-04-28 04:11:27,424 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 49 [2022-04-28 04:11:27,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:11:27,425 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2022-04-28 04:11:27,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call 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:27,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 59 transitions. [2022-04-28 04:11:27,518 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:27,518 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2022-04-28 04:11:27,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 04:11:27,518 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:11:27,519 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, 1, 1, 1] [2022-04-28 04:11:27,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 04:11:27,519 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:11:27,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:11:27,519 INFO L85 PathProgramCache]: Analyzing trace with hash -543370501, now seen corresponding path program 13 times [2022-04-28 04:11:27,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:27,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1015308682] [2022-04-28 04:11:31,709 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:31,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:11:31,834 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:31,861 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:11:31,862 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:11:33,967 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:34,059 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:34,085 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:11:34,085 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:11:38,151 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:38,192 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:38,277 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:38,300 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:11:38,300 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:11:42,364 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:42,407 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:42,487 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:42,511 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:11:42,511 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:11:46,576 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:46,617 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,701 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:46,856 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:46,857 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:11:46,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1832646123, now seen corresponding path program 1 times [2022-04-28 04:11:46,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:11:46,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358428812] [2022-04-28 04:11:46,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:11:46,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:11:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:46,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:11:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:46,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {7379#(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); {7373#true} is VALID [2022-04-28 04:11:46,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {7373#true} assume true; {7373#true} is VALID [2022-04-28 04:11:46,884 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7373#true} {7373#true} #92#return; {7373#true} is VALID [2022-04-28 04:11:46,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {7373#true} call ULTIMATE.init(); {7379#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:11:46,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {7379#(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); {7373#true} is VALID [2022-04-28 04:11:46,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {7373#true} assume true; {7373#true} is VALID [2022-04-28 04:11:46,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7373#true} {7373#true} #92#return; {7373#true} is VALID [2022-04-28 04:11:46,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {7373#true} call #t~ret10 := main(); {7373#true} is VALID [2022-04-28 04:11:46,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {7373#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {7378#(= main_~a~0 0)} is VALID [2022-04-28 04:11:46,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {7378#(= main_~a~0 0)} [130] 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_#t~pre8_676| |v_main_#t~pre8_674|)) (.cse3 (= v_main_~a~0_112 v_main_~a~0_111)) (.cse4 (= |v_main_#t~pre5_106| |v_main_#t~pre5_105|)) (.cse5 (= |v_main_#t~pre7_169| |v_main_#t~pre7_168|)) (.cse6 (= v_main_~f~0_1568 v_main_~f~0_1554)) (.cse7 (= |v_main_#t~pre4_89| |v_main_#t~pre4_88|)) (.cse8 (= v_main_~d~0_252 v_main_~d~0_250))) (or (and .cse0 .cse1 (= v_main_~b~0_151 v_main_~b~0_149) .cse2 .cse3 (= v_main_~e~0_835 v_main_~e~0_832) .cse4 (= |v_main_#t~pre9_1085| |v_main_#t~pre9_1073|) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 (= |v_main_#t~pre9_1073| |v_main_#t~pre9_1085|) .cse2 .cse3 (= v_main_~b~0_149 v_main_~b~0_151) .cse4 .cse5 .cse6 .cse7 (= v_main_~e~0_832 v_main_~e~0_835) .cse8))) InVars {main_~e~0=v_main_~e~0_835, main_~d~0=v_main_~d~0_252, main_~b~0=v_main_~b~0_151, main_~f~0=v_main_~f~0_1568, main_#t~pre7=|v_main_#t~pre7_169|, main_~c~0=v_main_~c~0_206, main_#t~pre8=|v_main_#t~pre8_676|, main_#t~pre9=|v_main_#t~pre9_1085|, 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_832, main_~d~0=v_main_~d~0_250, main_~b~0=v_main_~b~0_149, main_~f~0=v_main_~f~0_1554, main_#t~pre7=|v_main_#t~pre7_168|, main_~c~0=v_main_~c~0_204, main_#t~pre8=|v_main_#t~pre8_674|, main_#t~pre9=|v_main_#t~pre9_1073|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {7378#(= main_~a~0 0)} is VALID [2022-04-28 04:11:46,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {7378#(= main_~a~0 0)} [129] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {7374#false} is VALID [2022-04-28 04:11:46,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {7374#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {7374#false} is VALID [2022-04-28 04:11:46,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {7374#false} assume !false; {7374#false} is VALID [2022-04-28 04:11:46,886 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:46,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:11:46,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358428812] [2022-04-28 04:11:46,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358428812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:46,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:46,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:11:47,319 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:11:47,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1015308682] [2022-04-28 04:11:47,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1015308682] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:47,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:47,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 04:11:47,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787261069] [2022-04-28 04:11:47,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:11:47,320 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:47,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:11:47,321 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:47,352 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:47,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 04:11:47,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:47,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 04:11:47,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2022-04-28 04:11:47,353 INFO L87 Difference]: Start difference. First operand 54 states and 59 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:48,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:48,451 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2022-04-28 04:11:48,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 04:11:48,452 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:48,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:11:48,452 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:48,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 128 transitions. [2022-04-28 04:11:48,453 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:48,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 128 transitions. [2022-04-28 04:11:48,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 128 transitions. [2022-04-28 04:11:48,539 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:11:48,539 INFO L225 Difference]: With dead ends: 103 [2022-04-28 04:11:48,539 INFO L226 Difference]: Without dead ends: 88 [2022-04-28 04:11:48,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=354, Invalid=1452, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 04:11:48,540 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 184 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:11:48,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 50 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 04:11:48,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-28 04:11:48,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 56. [2022-04-28 04:11:48,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:11:48,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 56 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call 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:48,559 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 56 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call 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:48,560 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 56 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call 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:48,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:48,560 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2022-04-28 04:11:48,561 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-28 04:11:48,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:48,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:48,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 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:11:48,561 INFO L87 Difference]: Start difference. First operand has 56 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 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:11:48,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:48,562 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2022-04-28 04:11:48,562 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-28 04:11:48,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:48,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:48,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:11:48,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:11:48,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call 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:48,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-28 04:11:48,563 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 51 [2022-04-28 04:11:48,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:11:48,563 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-28 04:11:48,563 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:48,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 61 transitions. [2022-04-28 04:11:48,663 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:11:48,663 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-28 04:11:48,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 04:11:48,663 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:11:48,663 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, 1, 1, 1] [2022-04-28 04:11:48,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 04:11:48,664 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:11:48,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:11:48,664 INFO L85 PathProgramCache]: Analyzing trace with hash -699284070, now seen corresponding path program 14 times [2022-04-28 04:11:48,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:48,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [803732478] [2022-04-28 04:11:52,861 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:52,902 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:52,991 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:53,143 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:11:53,178 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:11:56,149 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:56,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:11:56,275 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:56,415 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:11:56,452 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:11:59,900 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:59,940 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:00,028 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:00,172 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:12:00,208 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:12:04,264 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:12:04,304 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:04,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:12:04,548 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:12:04,584 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:12:08,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:12:08,408 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:08,551 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:08,551 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:12:08,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1832707627, now seen corresponding path program 1 times [2022-04-28 04:12:08,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:12:08,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271485803] [2022-04-28 04:12:08,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:12:08,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:12:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:08,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:12:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:08,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {7941#(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); {7935#true} is VALID [2022-04-28 04:12:08,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {7935#true} assume true; {7935#true} is VALID [2022-04-28 04:12:08,580 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7935#true} {7935#true} #92#return; {7935#true} is VALID [2022-04-28 04:12:08,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {7935#true} call ULTIMATE.init(); {7941#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:12:08,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {7941#(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); {7935#true} is VALID [2022-04-28 04:12:08,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {7935#true} assume true; {7935#true} is VALID [2022-04-28 04:12:08,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7935#true} {7935#true} #92#return; {7935#true} is VALID [2022-04-28 04:12:08,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {7935#true} call #t~ret10 := main(); {7935#true} is VALID [2022-04-28 04:12:08,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {7935#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {7940#(= main_~a~0 0)} is VALID [2022-04-28 04:12:08,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {7940#(= main_~a~0 0)} [132] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre9_1191| |v_main_#t~pre9_1179|)) (.cse1 (= v_main_~a~0_118 v_main_~a~0_117)) (.cse2 (= v_main_~f~0_1752 v_main_~f~0_1737)) (.cse3 (= |v_main_#t~pre7_177| |v_main_#t~pre7_176|)) (.cse4 (= |v_main_#t~pre6_148| |v_main_#t~pre6_147|)) (.cse5 (= v_main_~c~0_216 v_main_~c~0_214)) (.cse6 (= v_main_~b~0_159 v_main_~b~0_157)) (.cse7 (= v_main_~d~0_264 v_main_~d~0_262)) (.cse8 (= |v_main_#t~pre4_94| |v_main_#t~pre4_93|)) (.cse9 (= |v_main_#t~pre5_112| |v_main_#t~pre5_111|))) (or (and .cse0 (= v_main_~e~0_930 v_main_~e~0_926) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |v_main_#t~pre8_761| |v_main_#t~pre8_758|)) (and .cse0 (= v_main_~e~0_926 v_main_~e~0_930) (= |v_main_#t~pre8_758| |v_main_#t~pre8_761|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_930, main_~d~0=v_main_~d~0_264, main_~b~0=v_main_~b~0_159, main_~f~0=v_main_~f~0_1752, main_#t~pre7=|v_main_#t~pre7_177|, main_~c~0=v_main_~c~0_216, main_#t~pre8=|v_main_#t~pre8_761|, main_#t~pre9=|v_main_#t~pre9_1191|, 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_926, main_~d~0=v_main_~d~0_262, main_~b~0=v_main_~b~0_157, main_~f~0=v_main_~f~0_1737, main_#t~pre7=|v_main_#t~pre7_176|, main_~c~0=v_main_~c~0_214, main_#t~pre8=|v_main_#t~pre8_758|, main_#t~pre9=|v_main_#t~pre9_1179|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {7940#(= main_~a~0 0)} is VALID [2022-04-28 04:12:08,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {7940#(= main_~a~0 0)} [131] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {7936#false} is VALID [2022-04-28 04:12:08,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {7936#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {7936#false} is VALID [2022-04-28 04:12:08,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {7936#false} assume !false; {7936#false} is VALID [2022-04-28 04:12:08,583 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:08,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:12:08,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271485803] [2022-04-28 04:12:08,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271485803] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:08,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:08,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:12:09,038 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:12:09,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [803732478] [2022-04-28 04:12:09,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [803732478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:09,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:09,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 04:12:09,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777113521] [2022-04-28 04:12:09,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:12:09,039 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 23 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-28 04:12:09,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:12:09,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.125) internal successors, (51), 23 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call 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:09,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:09,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 04:12:09,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:09,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 04:12:09,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2022-04-28 04:12:09,074 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 24 states, 24 states have (on average 2.125) internal successors, (51), 23 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call 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:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:10,289 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2022-04-28 04:12:10,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 04:12:10,289 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 23 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-28 04:12:10,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:12:10,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.125) internal successors, (51), 23 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call 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:10,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 130 transitions. [2022-04-28 04:12:10,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.125) internal successors, (51), 23 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call 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:10,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 130 transitions. [2022-04-28 04:12:10,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 130 transitions. [2022-04-28 04:12:10,391 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:12:10,393 INFO L225 Difference]: With dead ends: 105 [2022-04-28 04:12:10,393 INFO L226 Difference]: Without dead ends: 90 [2022-04-28 04:12:10,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=372, Invalid=1608, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 04:12:10,393 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 168 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 04:12:10,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 30 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 04:12:10,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-28 04:12:10,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 57. [2022-04-28 04:12:10,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:12:10,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 57 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 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:12:10,414 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 57 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 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:12:10,414 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 57 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 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:12:10,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:10,416 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2022-04-28 04:12:10,416 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2022-04-28 04:12:10,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:10,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:10,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 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 90 states. [2022-04-28 04:12:10,416 INFO L87 Difference]: Start difference. First operand has 57 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 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 90 states. [2022-04-28 04:12:10,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:10,417 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2022-04-28 04:12:10,417 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2022-04-28 04:12:10,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:10,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:10,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:12:10,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:12:10,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 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:12:10,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-04-28 04:12:10,418 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 54 [2022-04-28 04:12:10,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:12:10,418 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-04-28 04:12:10,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 23 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call 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:10,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 62 transitions. [2022-04-28 04:12:10,528 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:12:10,528 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-04-28 04:12:10,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-28 04:12:10,528 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:12:10,528 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, 1, 1, 1] [2022-04-28 04:12:10,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 04:12:10,529 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:12:10,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:12:10,529 INFO L85 PathProgramCache]: Analyzing trace with hash -2081283336, now seen corresponding path program 15 times [2022-04-28 04:12:10,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:10,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1093624072] [2022-04-28 04:12:10,767 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,847 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:10,870 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:12:10,870 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:12:10,899 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:12:10,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:12:11,074 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:11,099 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:12:11,099 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:12:11,129 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:12:11,213 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:11,296 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:11,318 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:12:11,318 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:12:11,348 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:12:11,431 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:11,543 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:11,570 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:12:11,570 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:12:11,604 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:12:11,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:11,781 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:11,938 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:11,938 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:12:11,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1832769131, now seen corresponding path program 1 times [2022-04-28 04:12:11,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:12:11,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160752469] [2022-04-28 04:12:11,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:12:11,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:12:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:11,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:12:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:11,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {8516#(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); {8510#true} is VALID [2022-04-28 04:12:11,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {8510#true} assume true; {8510#true} is VALID [2022-04-28 04:12:11,978 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8510#true} {8510#true} #92#return; {8510#true} is VALID [2022-04-28 04:12:11,979 INFO L272 TraceCheckUtils]: 0: Hoare triple {8510#true} call ULTIMATE.init(); {8516#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:12:11,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {8516#(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); {8510#true} is VALID [2022-04-28 04:12:11,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {8510#true} assume true; {8510#true} is VALID [2022-04-28 04:12:11,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8510#true} {8510#true} #92#return; {8510#true} is VALID [2022-04-28 04:12:11,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {8510#true} call #t~ret10 := main(); {8510#true} is VALID [2022-04-28 04:12:11,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {8510#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {8515#(= main_~a~0 0)} is VALID [2022-04-28 04:12:11,980 INFO L290 TraceCheckUtils]: 6: Hoare triple {8515#(= main_~a~0 0)} [134] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_124 v_main_~a~0_123)) (.cse1 (= |v_main_#t~pre9_1306| |v_main_#t~pre9_1293|)) (.cse2 (= v_main_~e~0_1013 v_main_~e~0_1009)) (.cse3 (= |v_main_#t~pre4_99| |v_main_#t~pre4_98|)) (.cse4 (= v_main_~b~0_167 v_main_~b~0_165)) (.cse5 (= |v_main_#t~pre5_118| |v_main_#t~pre5_117|)) (.cse6 (= |v_main_#t~pre7_185| |v_main_#t~pre7_184|)) (.cse7 (= v_main_~c~0_226 v_main_~c~0_224)) (.cse8 (= |v_main_#t~pre6_155| |v_main_#t~pre6_154|)) (.cse9 (= v_main_~f~0_1926 v_main_~f~0_1910)) (.cse10 (= v_main_~d~0_276 v_main_~d~0_274))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_main_#t~pre8_830| |v_main_#t~pre8_827|) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre8_827| |v_main_#t~pre8_830|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) InVars {main_~e~0=v_main_~e~0_1013, main_~d~0=v_main_~d~0_276, main_~b~0=v_main_~b~0_167, main_~f~0=v_main_~f~0_1926, main_#t~pre7=|v_main_#t~pre7_185|, main_~c~0=v_main_~c~0_226, main_#t~pre8=|v_main_#t~pre8_830|, main_#t~pre9=|v_main_#t~pre9_1306|, 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_1009, main_~d~0=v_main_~d~0_274, main_~b~0=v_main_~b~0_165, main_~f~0=v_main_~f~0_1910, main_#t~pre7=|v_main_#t~pre7_184|, main_~c~0=v_main_~c~0_224, main_#t~pre8=|v_main_#t~pre8_827|, main_#t~pre9=|v_main_#t~pre9_1293|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {8515#(= main_~a~0 0)} is VALID [2022-04-28 04:12:11,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {8515#(= main_~a~0 0)} [133] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {8511#false} is VALID [2022-04-28 04:12:11,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {8511#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {8511#false} is VALID [2022-04-28 04:12:11,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {8511#false} assume !false; {8511#false} is VALID [2022-04-28 04:12:11,981 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:11,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:12:11,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160752469] [2022-04-28 04:12:11,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160752469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:11,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:11,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:12:12,486 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:12:12,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1093624072] [2022-04-28 04:12:12,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1093624072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:12,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:12,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 04:12:12,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638641055] [2022-04-28 04:12:12,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:12:12,487 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.12) internal successors, (53), 24 states have internal predecessors, (53), 1 states have call successors, (2), 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 56 [2022-04-28 04:12:12,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:12:12,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.12) internal successors, (53), 24 states have internal predecessors, (53), 1 states have call successors, (2), 2 states have call 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:12,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:12,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 04:12:12,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:12,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 04:12:12,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2022-04-28 04:12:12,522 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 25 states, 25 states have (on average 2.12) internal successors, (53), 24 states have internal predecessors, (53), 1 states have call successors, (2), 2 states have call 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:13,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:13,752 INFO L93 Difference]: Finished difference Result 107 states and 132 transitions. [2022-04-28 04:12:13,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 04:12:13,752 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.12) internal successors, (53), 24 states have internal predecessors, (53), 1 states have call successors, (2), 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 56 [2022-04-28 04:12:13,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:12:13,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.12) internal successors, (53), 24 states have internal predecessors, (53), 1 states have call successors, (2), 2 states have call 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:13,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 132 transitions. [2022-04-28 04:12:13,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.12) internal successors, (53), 24 states have internal predecessors, (53), 1 states have call successors, (2), 2 states have call 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:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 132 transitions. [2022-04-28 04:12:13,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 132 transitions. [2022-04-28 04:12:13,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:13,854 INFO L225 Difference]: With dead ends: 107 [2022-04-28 04:12:13,854 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 04:12:13,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=390, Invalid=1772, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 04:12:13,855 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 211 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 04:12:13,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 35 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 04:12:13,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 04:12:13,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 59. [2022-04-28 04:12:13,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:12:13,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 59 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 55 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:12:13,879 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 59 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 55 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:12:13,879 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 59 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 55 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:12:13,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:13,880 INFO L93 Difference]: Finished difference Result 92 states and 111 transitions. [2022-04-28 04:12:13,880 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 111 transitions. [2022-04-28 04:12:13,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:13,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:13,880 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 55 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 92 states. [2022-04-28 04:12:13,881 INFO L87 Difference]: Start difference. First operand has 59 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 55 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 92 states. [2022-04-28 04:12:13,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:13,882 INFO L93 Difference]: Finished difference Result 92 states and 111 transitions. [2022-04-28 04:12:13,882 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 111 transitions. [2022-04-28 04:12:13,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:13,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:13,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:12:13,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:12:13,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 55 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:12:13,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2022-04-28 04:12:13,883 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 56 [2022-04-28 04:12:13,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:12:13,883 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2022-04-28 04:12:13,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.12) internal successors, (53), 24 states have internal predecessors, (53), 1 states have call successors, (2), 2 states have call 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:13,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 64 transitions. [2022-04-28 04:12:14,001 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:12:14,002 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-04-28 04:12:14,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 04:12:14,002 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:12:14,002 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, 1, 1, 1] [2022-04-28 04:12:14,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 04:12:14,002 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:12:14,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:12:14,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1257283798, now seen corresponding path program 16 times [2022-04-28 04:12:14,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:14,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [617418676] [2022-04-28 04:12:14,257 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,337 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,359 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:12:14,359 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:12:14,388 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:12:14,495 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,575 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,598 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:12:14,598 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:12:14,637 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:12:14,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:14,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:12:14,851 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:12:14,851 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:12:14,880 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:12:14,981 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:15,071 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:15,093 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:12:15,093 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:12:15,123 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:12:15,222 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:15,303 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:15,450 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:15,450 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:12:15,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1832830635, now seen corresponding path program 1 times [2022-04-28 04:12:15,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:12:15,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621652021] [2022-04-28 04:12:15,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:12:15,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:12:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:15,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:12:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:15,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {9106#(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); {9100#true} is VALID [2022-04-28 04:12:15,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {9100#true} assume true; {9100#true} is VALID [2022-04-28 04:12:15,488 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9100#true} {9100#true} #92#return; {9100#true} is VALID [2022-04-28 04:12:15,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {9100#true} call ULTIMATE.init(); {9106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:12:15,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {9106#(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); {9100#true} is VALID [2022-04-28 04:12:15,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {9100#true} assume true; {9100#true} is VALID [2022-04-28 04:12:15,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9100#true} {9100#true} #92#return; {9100#true} is VALID [2022-04-28 04:12:15,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {9100#true} call #t~ret10 := main(); {9100#true} is VALID [2022-04-28 04:12:15,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {9100#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {9105#(= main_~a~0 0)} is VALID [2022-04-28 04:12:15,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {9105#(= main_~a~0 0)} [136] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~b~0_175 v_main_~b~0_173)) (.cse1 (= v_main_~e~0_1096 v_main_~e~0_1092)) (.cse2 (= v_main_~c~0_236 v_main_~c~0_234)) (.cse3 (= v_main_~f~0_2106 v_main_~f~0_2089)) (.cse4 (= |v_main_#t~pre4_104| |v_main_#t~pre4_103|)) (.cse5 (= |v_main_#t~pre9_1426| |v_main_#t~pre9_1412|)) (.cse6 (= |v_main_#t~pre6_162| |v_main_#t~pre6_161|)) (.cse7 (= |v_main_#t~pre8_899| |v_main_#t~pre8_896|)) (.cse8 (= v_main_~d~0_288 v_main_~d~0_286)) (.cse9 (= |v_main_#t~pre5_124| |v_main_#t~pre5_123|))) (or (and .cse0 (= |v_main_#t~pre7_193| |v_main_#t~pre7_192|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= v_main_~a~0_130 v_main_~a~0_129)) (and .cse0 .cse1 .cse2 (= |v_main_#t~pre7_192| |v_main_#t~pre7_193|) (= v_main_~a~0_129 v_main_~a~0_130) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_1096, main_~d~0=v_main_~d~0_288, main_~b~0=v_main_~b~0_175, main_~f~0=v_main_~f~0_2106, main_#t~pre7=|v_main_#t~pre7_193|, main_~c~0=v_main_~c~0_236, main_#t~pre8=|v_main_#t~pre8_899|, main_#t~pre9=|v_main_#t~pre9_1426|, 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_1092, main_~d~0=v_main_~d~0_286, main_~b~0=v_main_~b~0_173, main_~f~0=v_main_~f~0_2089, main_#t~pre7=|v_main_#t~pre7_192|, main_~c~0=v_main_~c~0_234, main_#t~pre8=|v_main_#t~pre8_896|, main_#t~pre9=|v_main_#t~pre9_1412|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {9105#(= main_~a~0 0)} is VALID [2022-04-28 04:12:15,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {9105#(= main_~a~0 0)} [135] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {9101#false} is VALID [2022-04-28 04:12:15,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {9101#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {9101#false} is VALID [2022-04-28 04:12:15,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {9101#false} assume !false; {9101#false} is VALID [2022-04-28 04:12:15,491 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:15,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:12:15,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621652021] [2022-04-28 04:12:15,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621652021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:15,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:15,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:12:16,048 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:12:16,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [617418676] [2022-04-28 04:12:16,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [617418676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:16,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:16,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 04:12:16,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226448923] [2022-04-28 04:12:16,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:12:16,049 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 1 states have call successors, (2), 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 58 [2022-04-28 04:12:16,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:12:16,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call 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:16,099 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:12:16,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 04:12:16,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:16,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 04:12:16,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2022-04-28 04:12:16,100 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call 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:17,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:17,598 INFO L93 Difference]: Finished difference Result 109 states and 134 transitions. [2022-04-28 04:12:17,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 04:12:17,598 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 1 states have call successors, (2), 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 58 [2022-04-28 04:12:17,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:12:17,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call 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:17,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 134 transitions. [2022-04-28 04:12:17,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call 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:17,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 134 transitions. [2022-04-28 04:12:17,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 134 transitions. [2022-04-28 04:12:17,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:17,710 INFO L225 Difference]: With dead ends: 109 [2022-04-28 04:12:17,710 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 04:12:17,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 27 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=408, Invalid=1944, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 04:12:17,711 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 218 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:12:17,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 30 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 04:12:17,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 04:12:17,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 61. [2022-04-28 04:12:17,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:12:17,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 61 states, 57 states have (on average 1.105263157894737) internal successors, (63), 57 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:12:17,735 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 61 states, 57 states have (on average 1.105263157894737) internal successors, (63), 57 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:12:17,735 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 61 states, 57 states have (on average 1.105263157894737) internal successors, (63), 57 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:12:17,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:17,736 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2022-04-28 04:12:17,736 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2022-04-28 04:12:17,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:17,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:17,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 57 states have (on average 1.105263157894737) internal successors, (63), 57 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 94 states. [2022-04-28 04:12:17,736 INFO L87 Difference]: Start difference. First operand has 61 states, 57 states have (on average 1.105263157894737) internal successors, (63), 57 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 94 states. [2022-04-28 04:12:17,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:17,737 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2022-04-28 04:12:17,737 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2022-04-28 04:12:17,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:17,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:17,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:12:17,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:12:17,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 57 states have (on average 1.105263157894737) internal successors, (63), 57 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:12:17,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2022-04-28 04:12:17,738 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 58 [2022-04-28 04:12:17,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:12:17,738 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2022-04-28 04:12:17,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call 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:17,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 66 transitions. [2022-04-28 04:12:17,861 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:17,861 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-04-28 04:12:17,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-28 04:12:17,861 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:12:17,862 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, 1, 1, 1] [2022-04-28 04:12:17,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 04:12:17,862 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:12:17,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:12:17,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1279729460, now seen corresponding path program 17 times [2022-04-28 04:12:17,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:17,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [260319443] [2022-04-28 04:12:22,077 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:12:22,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:12:22,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:12:22,239 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:12:22,239 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:12:22,272 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:12:26,340 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:12:26,387 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:26,467 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:26,489 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:12:26,489 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:12:26,518 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:12:30,585 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:12:30,632 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:30,711 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:30,736 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:12:30,736 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:12:30,765 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:12:34,830 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:12:34,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:12:34,958 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,980 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:12:34,980 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:12:35,008 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:12:39,082 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:12:39,129 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:39,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:12:39,382 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:39,382 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:12:39,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1832892139, now seen corresponding path program 1 times [2022-04-28 04:12:39,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:12:39,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147205492] [2022-04-28 04:12:39,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:12:39,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:12:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:39,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:12:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:39,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {9711#(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); {9705#true} is VALID [2022-04-28 04:12:39,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {9705#true} assume true; {9705#true} is VALID [2022-04-28 04:12:39,406 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9705#true} {9705#true} #92#return; {9705#true} is VALID [2022-04-28 04:12:39,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {9705#true} call ULTIMATE.init(); {9711#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:12:39,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {9711#(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); {9705#true} is VALID [2022-04-28 04:12:39,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {9705#true} assume true; {9705#true} is VALID [2022-04-28 04:12:39,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9705#true} {9705#true} #92#return; {9705#true} is VALID [2022-04-28 04:12:39,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {9705#true} call #t~ret10 := main(); {9705#true} is VALID [2022-04-28 04:12:39,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {9705#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {9710#(= main_~a~0 0)} is VALID [2022-04-28 04:12:39,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {9710#(= main_~a~0 0)} [138] L23-3-->L23-4_primed: Formula: (and (= |v_main_#t~pre7_201| |v_main_#t~pre7_200|) (= v_main_~f~0_2292 v_main_~f~0_2274) (= v_main_~a~0_136 v_main_~a~0_135) (= v_main_~d~0_300 v_main_~d~0_298) (= |v_main_#t~pre4_109| |v_main_#t~pre4_108|) (= |v_main_#t~pre8_968| |v_main_#t~pre8_965|) (= |v_main_#t~pre9_1551| |v_main_#t~pre9_1536|) (= v_main_~e~0_1179 v_main_~e~0_1175) (= |v_main_#t~pre5_130| |v_main_#t~pre5_129|) (= v_main_~b~0_183 v_main_~b~0_181) (= |v_main_#t~pre6_169| |v_main_#t~pre6_168|) (= v_main_~c~0_246 v_main_~c~0_244)) InVars {main_~e~0=v_main_~e~0_1179, main_~d~0=v_main_~d~0_300, main_~b~0=v_main_~b~0_183, main_~f~0=v_main_~f~0_2292, main_#t~pre7=|v_main_#t~pre7_201|, main_~c~0=v_main_~c~0_246, main_#t~pre8=|v_main_#t~pre8_968|, main_#t~pre9=|v_main_#t~pre9_1551|, 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_1175, main_~d~0=v_main_~d~0_298, main_~b~0=v_main_~b~0_181, main_~f~0=v_main_~f~0_2274, main_#t~pre7=|v_main_#t~pre7_200|, main_~c~0=v_main_~c~0_244, main_#t~pre8=|v_main_#t~pre8_965|, main_#t~pre9=|v_main_#t~pre9_1536|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {9710#(= main_~a~0 0)} is VALID [2022-04-28 04:12:39,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {9710#(= main_~a~0 0)} [137] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {9706#false} is VALID [2022-04-28 04:12:39,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {9706#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {9706#false} is VALID [2022-04-28 04:12:39,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {9706#false} assume !false; {9706#false} is VALID [2022-04-28 04:12:39,412 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:39,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:12:39,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147205492] [2022-04-28 04:12:39,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147205492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:39,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:39,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:12:39,984 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:12:39,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [260319443] [2022-04-28 04:12:39,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [260319443] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:39,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:39,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 04:12:39,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103968389] [2022-04-28 04:12:39,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:12:39,985 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 26 states have internal predecessors, (57), 1 states have call successors, (2), 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 60 [2022-04-28 04:12:39,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:12:39,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 26 states have internal predecessors, (57), 1 states have call successors, (2), 2 states have call 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,055 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:12:40,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 04:12:40,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:40,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 04:12:40,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2022-04-28 04:12:40,056 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 26 states have internal predecessors, (57), 1 states have call successors, (2), 2 states have call 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,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:41,648 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2022-04-28 04:12:41,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 04:12:41,648 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 26 states have internal predecessors, (57), 1 states have call successors, (2), 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 60 [2022-04-28 04:12:41,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:12:41,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 26 states have internal predecessors, (57), 1 states have call successors, (2), 2 states have call 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,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 136 transitions. [2022-04-28 04:12:41,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 26 states have internal predecessors, (57), 1 states have call successors, (2), 2 states have call 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,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 136 transitions. [2022-04-28 04:12:41,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 136 transitions. [2022-04-28 04:12:41,752 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:12:41,753 INFO L225 Difference]: With dead ends: 111 [2022-04-28 04:12:41,753 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 04:12:41,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 26 SyntacticMatches, 10 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=426, Invalid=2124, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 04:12:41,754 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 195 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:12:41,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 65 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 04:12:41,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 04:12:41,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 63. [2022-04-28 04:12:41,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:12:41,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 63 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 59 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call 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,779 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 63 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 59 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call 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,779 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 63 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 59 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call 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,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:41,780 INFO L93 Difference]: Finished difference Result 96 states and 115 transitions. [2022-04-28 04:12:41,780 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2022-04-28 04:12:41,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:41,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:41,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 59 states have internal predecessors, (65), 2 states have call successors, (2), 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 96 states. [2022-04-28 04:12:41,781 INFO L87 Difference]: Start difference. First operand has 63 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 59 states have internal predecessors, (65), 2 states have call successors, (2), 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 96 states. [2022-04-28 04:12:41,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:41,782 INFO L93 Difference]: Finished difference Result 96 states and 115 transitions. [2022-04-28 04:12:41,782 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2022-04-28 04:12:41,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:41,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:41,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:12:41,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:12:41,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 59 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call 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,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2022-04-28 04:12:41,783 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 60 [2022-04-28 04:12:41,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:12:41,783 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2022-04-28 04:12:41,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 26 states have internal predecessors, (57), 1 states have call successors, (2), 2 states have call 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,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 68 transitions. [2022-04-28 04:12:41,910 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:41,911 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2022-04-28 04:12:41,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 04:12:41,911 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:12:41,911 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, 1, 1, 1] [2022-04-28 04:12:41,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 04:12:41,911 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:12:41,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:12:41,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1375174162, now seen corresponding path program 18 times [2022-04-28 04:12:41,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:41,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1761581636] [2022-04-28 04:12:42,157 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:42,243 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:42,265 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:12:42,265 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:12:42,295 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:12:42,393 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:42,479 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:42,502 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:12:42,502 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:12:42,531 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:12:42,626 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:42,707 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:42,729 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:12:42,729 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:12:42,759 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:12:42,857 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:42,938 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:42,965 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:12:42,965 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:12:42,995 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:12:43,102 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:43,183 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:43,353 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:43,354 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:12:43,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1832953643, now seen corresponding path program 1 times [2022-04-28 04:12:43,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:12:43,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924314071] [2022-04-28 04:12:43,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:12:43,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:12:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:43,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:12:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:43,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {10331#(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); {10325#true} is VALID [2022-04-28 04:12:43,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {10325#true} assume true; {10325#true} is VALID [2022-04-28 04:12:43,391 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10325#true} {10325#true} #92#return; {10325#true} is VALID [2022-04-28 04:12:43,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {10325#true} call ULTIMATE.init(); {10331#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:12:43,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {10331#(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); {10325#true} is VALID [2022-04-28 04:12:43,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {10325#true} assume true; {10325#true} is VALID [2022-04-28 04:12:43,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10325#true} {10325#true} #92#return; {10325#true} is VALID [2022-04-28 04:12:43,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {10325#true} call #t~ret10 := main(); {10325#true} is VALID [2022-04-28 04:12:43,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {10325#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {10330#(= main_~a~0 0)} is VALID [2022-04-28 04:12:43,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {10330#(= main_~a~0 0)} [140] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre7_209| |v_main_#t~pre7_208|)) (.cse1 (= v_main_~c~0_256 v_main_~c~0_254)) (.cse2 (= |v_main_#t~pre9_1681| |v_main_#t~pre9_1665|)) (.cse3 (= |v_main_#t~pre5_136| |v_main_#t~pre5_135|)) (.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~pre8_1037| |v_main_#t~pre8_1034|)) (.cse7 (= |v_main_#t~pre6_176| |v_main_#t~pre6_175|)) (.cse8 (= v_main_~d~0_312 v_main_~d~0_310)) (.cse9 (= v_main_~f~0_2484 v_main_~f~0_2465))) (or (and (= v_main_~b~0_189 v_main_~b~0_191) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= v_main_~e~0_1258 v_main_~e~0_1262) .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (= v_main_~b~0_191 v_main_~b~0_189) .cse4 .cse5 .cse6 .cse7 (= v_main_~e~0_1262 v_main_~e~0_1258) .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_1262, main_~d~0=v_main_~d~0_312, main_~b~0=v_main_~b~0_191, main_~f~0=v_main_~f~0_2484, main_#t~pre7=|v_main_#t~pre7_209|, main_~c~0=v_main_~c~0_256, main_#t~pre8=|v_main_#t~pre8_1037|, main_#t~pre9=|v_main_#t~pre9_1681|, 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_1258, main_~d~0=v_main_~d~0_310, main_~b~0=v_main_~b~0_189, main_~f~0=v_main_~f~0_2465, main_#t~pre7=|v_main_#t~pre7_208|, main_~c~0=v_main_~c~0_254, main_#t~pre8=|v_main_#t~pre8_1034|, main_#t~pre9=|v_main_#t~pre9_1665|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {10330#(= main_~a~0 0)} is VALID [2022-04-28 04:12:43,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {10330#(= main_~a~0 0)} [139] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {10326#false} is VALID [2022-04-28 04:12:43,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {10326#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {10326#false} is VALID [2022-04-28 04:12:43,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {10326#false} assume !false; {10326#false} is VALID [2022-04-28 04:12:43,394 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:43,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:12:43,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924314071] [2022-04-28 04:12:43,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924314071] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:43,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:43,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:12:44,016 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:12:44,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1761581636] [2022-04-28 04:12:44,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1761581636] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:44,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:44,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 04:12:44,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605015646] [2022-04-28 04:12:44,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:12:44,016 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 states have internal predecessors, (59), 1 states have call successors, (2), 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 62 [2022-04-28 04:12:44,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:12:44,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 states have internal predecessors, (59), 1 states have call successors, (2), 2 states have call 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:44,061 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:12:44,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 04:12:44,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:44,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 04:12:44,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2022-04-28 04:12:44,062 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 states have internal predecessors, (59), 1 states have call successors, (2), 2 states have call 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:45,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:45,680 INFO L93 Difference]: Finished difference Result 113 states and 138 transitions. [2022-04-28 04:12:45,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 04:12:45,680 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 states have internal predecessors, (59), 1 states have call successors, (2), 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 62 [2022-04-28 04:12:45,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:12:45,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 states have internal predecessors, (59), 1 states have call successors, (2), 2 states have call 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:45,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 138 transitions. [2022-04-28 04:12:45,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 states have internal predecessors, (59), 1 states have call successors, (2), 2 states have call 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:45,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 138 transitions. [2022-04-28 04:12:45,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 138 transitions. [2022-04-28 04:12:45,779 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:12:45,780 INFO L225 Difference]: With dead ends: 113 [2022-04-28 04:12:45,780 INFO L226 Difference]: Without dead ends: 98 [2022-04-28 04:12:45,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 26 SyntacticMatches, 11 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=444, Invalid=2312, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 04:12:45,781 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 249 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:12:45,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 30 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 04:12:45,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-28 04:12:45,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 65. [2022-04-28 04:12:45,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:12:45,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 65 states, 61 states have (on average 1.098360655737705) internal successors, (67), 61 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:45,817 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 65 states, 61 states have (on average 1.098360655737705) internal successors, (67), 61 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:45,817 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 65 states, 61 states have (on average 1.098360655737705) internal successors, (67), 61 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:45,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:45,818 INFO L93 Difference]: Finished difference Result 98 states and 117 transitions. [2022-04-28 04:12:45,818 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2022-04-28 04:12:45,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:45,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:45,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 61 states have (on average 1.098360655737705) internal successors, (67), 61 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 98 states. [2022-04-28 04:12:45,818 INFO L87 Difference]: Start difference. First operand has 65 states, 61 states have (on average 1.098360655737705) internal successors, (67), 61 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 98 states. [2022-04-28 04:12:45,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:45,819 INFO L93 Difference]: Finished difference Result 98 states and 117 transitions. [2022-04-28 04:12:45,819 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2022-04-28 04:12:45,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:45,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:45,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:12:45,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:12:45,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.098360655737705) internal successors, (67), 61 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:45,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-04-28 04:12:45,821 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 62 [2022-04-28 04:12:45,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:12:45,821 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-04-28 04:12:45,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 states have internal predecessors, (59), 1 states have call successors, (2), 2 states have call 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:45,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 70 transitions. [2022-04-28 04:12:45,952 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:45,952 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-04-28 04:12:45,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 04:12:45,953 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:12:45,953 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, 1, 1, 1] [2022-04-28 04:12:45,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 04:12:45,953 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:12:45,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:12:45,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1391747728, now seen corresponding path program 19 times [2022-04-28 04:12:45,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:45,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2076924097] [2022-04-28 04:12:46,188 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:46,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:12:46,289 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:12:46,289 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:12:46,318 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:12:46,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:12:46,482 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:46,504 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:12:46,504 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:12:46,533 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:12:46,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:46,702 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:46,730 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:12:46,730 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:12: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:12:46,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:12:46,924 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:46,946 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:12:46,946 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:12:46,975 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:12:47,059 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:47,140 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:47,299 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:47,300 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:12:47,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1833015147, now seen corresponding path program 1 times [2022-04-28 04:12:47,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:12:47,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909453471] [2022-04-28 04:12:47,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:12:47,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:12:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:47,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:12:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:47,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {10966#(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); {10960#true} is VALID [2022-04-28 04:12:47,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {10960#true} assume true; {10960#true} is VALID [2022-04-28 04:12:47,328 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10960#true} {10960#true} #92#return; {10960#true} is VALID [2022-04-28 04:12:47,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {10960#true} call ULTIMATE.init(); {10966#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:12:47,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {10966#(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); {10960#true} is VALID [2022-04-28 04:12:47,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {10960#true} assume true; {10960#true} is VALID [2022-04-28 04:12:47,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10960#true} {10960#true} #92#return; {10960#true} is VALID [2022-04-28 04:12:47,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {10960#true} call #t~ret10 := main(); {10960#true} is VALID [2022-04-28 04:12:47,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {10960#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {10965#(= main_~a~0 0)} is VALID [2022-04-28 04:12:47,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {10965#(= main_~a~0 0)} [142] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre7_217| |v_main_#t~pre7_216|)) (.cse1 (= v_main_~e~0_1345 v_main_~e~0_1341)) (.cse2 (= v_main_~c~0_266 v_main_~c~0_264)) (.cse3 (= v_main_~d~0_324 v_main_~d~0_322)) (.cse4 (= v_main_~b~0_199 v_main_~b~0_197)) (.cse5 (= |v_main_#t~pre9_1816| |v_main_#t~pre9_1799|)) (.cse6 (= v_main_~a~0_148 v_main_~a~0_147)) (.cse7 (= |v_main_#t~pre5_142| |v_main_#t~pre5_141|)) (.cse8 (= v_main_~f~0_2682 v_main_~f~0_2662)) (.cse9 (= |v_main_#t~pre4_119| |v_main_#t~pre4_118|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre6_183| |v_main_#t~pre6_182|) .cse5 .cse6 .cse7 (= |v_main_#t~pre8_1106| |v_main_#t~pre8_1103|) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |v_main_#t~pre8_1103| |v_main_#t~pre8_1106|) (= |v_main_#t~pre6_182| |v_main_#t~pre6_183|) .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_1345, main_~d~0=v_main_~d~0_324, main_~b~0=v_main_~b~0_199, main_~f~0=v_main_~f~0_2682, main_#t~pre7=|v_main_#t~pre7_217|, main_~c~0=v_main_~c~0_266, main_#t~pre8=|v_main_#t~pre8_1106|, main_#t~pre9=|v_main_#t~pre9_1816|, 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_1341, main_~d~0=v_main_~d~0_322, main_~b~0=v_main_~b~0_197, main_~f~0=v_main_~f~0_2662, main_#t~pre7=|v_main_#t~pre7_216|, main_~c~0=v_main_~c~0_264, main_#t~pre8=|v_main_#t~pre8_1103|, main_#t~pre9=|v_main_#t~pre9_1799|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {10965#(= main_~a~0 0)} is VALID [2022-04-28 04:12:47,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {10965#(= main_~a~0 0)} [141] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {10961#false} is VALID [2022-04-28 04:12:47,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {10961#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {10961#false} is VALID [2022-04-28 04:12:47,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {10961#false} assume !false; {10961#false} is VALID [2022-04-28 04:12:47,330 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:47,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:12:47,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909453471] [2022-04-28 04:12:47,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909453471] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:47,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:47,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:12:47,989 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:12:47,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2076924097] [2022-04-28 04:12:47,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2076924097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:47,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:47,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 04:12:47,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59065026] [2022-04-28 04:12:47,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:12:47,990 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 28 states have internal predecessors, (61), 1 states have call successors, (2), 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 64 [2022-04-28 04:12:47,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:12:47,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 28 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call 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:48,031 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:12:48,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 04:12:48,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:48,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 04:12:48,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2022-04-28 04:12:48,032 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 28 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call 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:49,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:49,755 INFO L93 Difference]: Finished difference Result 117 states and 143 transitions. [2022-04-28 04:12:49,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 04:12:49,756 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 28 states have internal predecessors, (61), 1 states have call successors, (2), 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 64 [2022-04-28 04:12:49,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:12:49,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 28 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call 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:49,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 143 transitions. [2022-04-28 04:12:49,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 28 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call 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:49,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 143 transitions. [2022-04-28 04:12:49,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 143 transitions. [2022-04-28 04:12:49,860 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:12:49,861 INFO L225 Difference]: With dead ends: 117 [2022-04-28 04:12:49,861 INFO L226 Difference]: Without dead ends: 102 [2022-04-28 04:12:49,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=462, Invalid=2508, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 04:12:49,862 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 208 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 04:12:49,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 45 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 04:12:49,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-28 04:12:49,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 69. [2022-04-28 04:12:49,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:12:49,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 69 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 65 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:49,893 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 69 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 65 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:49,893 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 69 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 65 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:49,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:49,894 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2022-04-28 04:12:49,894 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2022-04-28 04:12:49,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:49,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:49,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 65 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 102 states. [2022-04-28 04:12:49,895 INFO L87 Difference]: Start difference. First operand has 69 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 65 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 102 states. [2022-04-28 04:12:49,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:49,896 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2022-04-28 04:12:49,896 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2022-04-28 04:12:49,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:49,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:49,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:12:49,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:12:49,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 65 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:49,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2022-04-28 04:12:49,897 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 64 [2022-04-28 04:12:49,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:12:49,897 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2022-04-28 04:12:49,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 28 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call 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:49,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 74 transitions. [2022-04-28 04:12:50,045 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:12:50,045 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2022-04-28 04:12:50,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 04:12:50,045 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:12:50,045 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, 1, 1, 1] [2022-04-28 04:12:50,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 04:12:50,046 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:12:50,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:12:50,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1818927794, now seen corresponding path program 20 times [2022-04-28 04:12:50,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:50,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1842955669] [2022-04-28 04:12:54,245 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:12:54,285 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,370 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:54,393 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:12:54,393 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:12:58,455 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:12:58,495 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,577 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,601 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:12:58,601 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:13:00,662 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:00,706 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:00,800 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:00,823 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:13:00,824 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:13:02,878 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:02,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:13:02,996 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:03,018 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:13:03,018 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:13:07,084 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:07,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:13:07,208 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:07,363 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:07,364 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:13:07,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1833076651, now seen corresponding path program 1 times [2022-04-28 04:13:07,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:13:07,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550602844] [2022-04-28 04:13:07,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:13:07,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:13:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:07,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:13:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:07,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {11628#(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); {11622#true} is VALID [2022-04-28 04:13:07,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {11622#true} assume true; {11622#true} is VALID [2022-04-28 04:13:07,388 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11622#true} {11622#true} #92#return; {11622#true} is VALID [2022-04-28 04:13:07,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {11622#true} call ULTIMATE.init(); {11628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:13:07,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {11628#(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); {11622#true} is VALID [2022-04-28 04:13:07,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {11622#true} assume true; {11622#true} is VALID [2022-04-28 04:13:07,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11622#true} {11622#true} #92#return; {11622#true} is VALID [2022-04-28 04:13:07,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {11622#true} call #t~ret10 := main(); {11622#true} is VALID [2022-04-28 04:13:07,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {11622#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {11627#(= main_~a~0 0)} is VALID [2022-04-28 04:13:07,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {11627#(= main_~a~0 0)} [144] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_276 v_main_~c~0_274)) (.cse1 (= |v_main_#t~pre9_1930| |v_main_#t~pre9_1912|)) (.cse2 (= |v_main_#t~pre4_124| |v_main_#t~pre4_123|)) (.cse3 (= v_main_~f~0_2859 v_main_~f~0_2838)) (.cse4 (= v_main_~d~0_336 v_main_~d~0_334)) (.cse5 (= |v_main_#t~pre7_225| |v_main_#t~pre7_224|)) (.cse6 (= v_main_~b~0_207 v_main_~b~0_205)) (.cse7 (= |v_main_#t~pre5_148| |v_main_#t~pre5_147|)) (.cse8 (= |v_main_#t~pre6_190| |v_main_#t~pre6_189|)) (.cse9 (= |v_main_#t~pre8_1154| |v_main_#t~pre8_1151|)) (.cse10 (= v_main_~a~0_154 v_main_~a~0_153))) (or (and .cse0 .cse1 (= v_main_~e~0_1406 v_main_~e~0_1402) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 (= v_main_~e~0_1402 v_main_~e~0_1406) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) InVars {main_~e~0=v_main_~e~0_1406, main_~d~0=v_main_~d~0_336, main_~b~0=v_main_~b~0_207, main_~f~0=v_main_~f~0_2859, main_#t~pre7=|v_main_#t~pre7_225|, main_~c~0=v_main_~c~0_276, main_#t~pre8=|v_main_#t~pre8_1154|, main_#t~pre9=|v_main_#t~pre9_1930|, 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_1402, main_~d~0=v_main_~d~0_334, main_~b~0=v_main_~b~0_205, main_~f~0=v_main_~f~0_2838, main_#t~pre7=|v_main_#t~pre7_224|, main_~c~0=v_main_~c~0_274, main_#t~pre8=|v_main_#t~pre8_1151|, main_#t~pre9=|v_main_#t~pre9_1912|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {11627#(= main_~a~0 0)} is VALID [2022-04-28 04:13:07,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {11627#(= main_~a~0 0)} [143] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {11623#false} is VALID [2022-04-28 04:13:07,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {11623#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {11623#false} is VALID [2022-04-28 04:13:07,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {11623#false} assume !false; {11623#false} is VALID [2022-04-28 04:13:07,392 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:07,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:13:07,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550602844] [2022-04-28 04:13:07,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550602844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:07,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:07,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:13:08,155 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:13:08,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1842955669] [2022-04-28 04:13:08,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1842955669] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:08,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:08,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 04:13:08,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971205741] [2022-04-28 04:13:08,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:13:08,156 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:13:08,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:13:08,156 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:13:08,198 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:13:08,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 04:13:08,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:08,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 04:13:08,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2022-04-28 04:13:08,198 INFO L87 Difference]: Start difference. First operand 69 states and 74 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:13:10,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:10,240 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2022-04-28 04:13:10,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 04:13:10,240 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:13:10,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:13:10,240 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:13:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 143 transitions. [2022-04-28 04:13:10,241 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:13:10,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 143 transitions. [2022-04-28 04:13:10,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 143 transitions. [2022-04-28 04:13:10,336 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:13:10,337 INFO L225 Difference]: With dead ends: 118 [2022-04-28 04:13:10,337 INFO L226 Difference]: Without dead ends: 103 [2022-04-28 04:13:10,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 27 SyntacticMatches, 12 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=480, Invalid=2712, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 04:13:10,339 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 194 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 04:13:10,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 45 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 04:13:10,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-28 04:13:10,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2022-04-28 04:13:10,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:13:10,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call 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:10,375 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call 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:10,375 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call 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:10,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:10,376 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2022-04-28 04:13:10,376 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2022-04-28 04:13:10,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:10,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:10,376 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 2 states have call successors, (2), 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:10,377 INFO L87 Difference]: Start difference. First operand has 71 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 2 states have call successors, (2), 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:10,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:10,377 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2022-04-28 04:13:10,377 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2022-04-28 04:13:10,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:10,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:10,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:13:10,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:13:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call 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:10,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2022-04-28 04:13:10,378 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 66 [2022-04-28 04:13:10,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:13:10,379 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2022-04-28 04:13:10,379 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:13:10,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 76 transitions. [2022-04-28 04:13:10,537 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:10,537 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-04-28 04:13:10,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 04:13:10,539 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:13:10,539 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, 1, 1, 1] [2022-04-28 04:13:10,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 04:13:10,539 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:13:10,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:13:10,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1044035175, now seen corresponding path program 21 times [2022-04-28 04:13:10,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:10,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1782064347] [2022-04-28 04:13:10,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:10,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:13:13,018 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:13:13,055 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:13:13,158 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:13,245 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:17,341 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:17,402 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:13:17,437 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:13:17,533 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:17,616 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:21,710 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:21,773 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:13:21,809 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:13:21,913 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,007 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:26,105 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:26,166 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:13:26,201 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:13:26,295 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:26,374 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:26,560 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:26,561 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:13:26,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1833138155, now seen corresponding path program 1 times [2022-04-28 04:13:26,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:13:26,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104738208] [2022-04-28 04:13:26,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:13:26,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:13:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:26,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:13:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:26,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {12301#(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); {12295#true} is VALID [2022-04-28 04:13:26,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {12295#true} assume true; {12295#true} is VALID [2022-04-28 04:13:26,591 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12295#true} {12295#true} #92#return; {12295#true} is VALID [2022-04-28 04:13:26,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {12295#true} call ULTIMATE.init(); {12301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:13:26,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {12301#(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); {12295#true} is VALID [2022-04-28 04:13:26,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {12295#true} assume true; {12295#true} is VALID [2022-04-28 04:13:26,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12295#true} {12295#true} #92#return; {12295#true} is VALID [2022-04-28 04:13:26,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {12295#true} call #t~ret10 := main(); {12295#true} is VALID [2022-04-28 04:13:26,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {12295#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {12300#(= main_~a~0 0)} is VALID [2022-04-28 04:13:26,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {12300#(= main_~a~0 0)} [146] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_129| |v_main_#t~pre4_128|)) (.cse1 (= v_main_~f~0_3078 v_main_~f~0_3056)) (.cse2 (= v_main_~d~0_348 v_main_~d~0_346)) (.cse3 (= v_main_~c~0_286 v_main_~c~0_284)) (.cse4 (= v_main_~b~0_215 v_main_~b~0_213)) (.cse5 (= |v_main_#t~pre9_2060| |v_main_#t~pre9_2042|)) (.cse6 (= |v_main_#t~pre6_197| |v_main_#t~pre6_196|)) (.cse7 (= |v_main_#t~pre7_233| |v_main_#t~pre7_232|)) (.cse8 (= |v_main_#t~pre5_154| |v_main_#t~pre5_153|))) (or (and (= |v_main_#t~pre8_1239| |v_main_#t~pre8_1243|) .cse0 .cse1 .cse2 .cse3 (= v_main_~a~0_159 v_main_~a~0_160) .cse4 .cse5 .cse6 .cse7 (= v_main_~e~0_1501 v_main_~e~0_1506) .cse8) (and .cse0 .cse1 .cse2 .cse3 (= v_main_~e~0_1506 v_main_~e~0_1501) (= v_main_~a~0_160 v_main_~a~0_159) .cse4 .cse5 .cse6 .cse7 .cse8 (= |v_main_#t~pre8_1243| |v_main_#t~pre8_1239|)))) InVars {main_~e~0=v_main_~e~0_1506, main_~d~0=v_main_~d~0_348, main_~b~0=v_main_~b~0_215, main_~f~0=v_main_~f~0_3078, main_#t~pre7=|v_main_#t~pre7_233|, main_~c~0=v_main_~c~0_286, main_#t~pre8=|v_main_#t~pre8_1243|, main_#t~pre9=|v_main_#t~pre9_2060|, 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_1501, main_~d~0=v_main_~d~0_346, main_~b~0=v_main_~b~0_213, main_~f~0=v_main_~f~0_3056, main_#t~pre7=|v_main_#t~pre7_232|, main_~c~0=v_main_~c~0_284, main_#t~pre8=|v_main_#t~pre8_1239|, main_#t~pre9=|v_main_#t~pre9_2042|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {12300#(= main_~a~0 0)} is VALID [2022-04-28 04:13:26,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {12300#(= main_~a~0 0)} [145] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {12296#false} is VALID [2022-04-28 04:13:26,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {12296#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {12296#false} is VALID [2022-04-28 04:13:26,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {12296#false} assume !false; {12296#false} is VALID [2022-04-28 04:13:26,593 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:26,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:13:26,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104738208] [2022-04-28 04:13:26,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104738208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:26,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:26,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:13:27,347 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:13:27,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1782064347] [2022-04-28 04:13:27,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1782064347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:27,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:27,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-28 04:13:27,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006503941] [2022-04-28 04:13:27,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:13:27,348 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 1 states have call successors, (2), 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 69 [2022-04-28 04:13:27,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:13:27,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call 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:27,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:27,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-28 04:13:27,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:27,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-28 04:13:27,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2022-04-28 04:13:27,393 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call 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:29,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:29,356 INFO L93 Difference]: Finished difference Result 120 states and 145 transitions. [2022-04-28 04:13:29,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 04:13:29,356 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 1 states have call successors, (2), 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 69 [2022-04-28 04:13:29,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:13:29,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call 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:29,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 145 transitions. [2022-04-28 04:13:29,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call 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:29,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 145 transitions. [2022-04-28 04:13:29,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 145 transitions. [2022-04-28 04:13:29,452 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:13:29,453 INFO L225 Difference]: With dead ends: 120 [2022-04-28 04:13:29,453 INFO L226 Difference]: Without dead ends: 105 [2022-04-28 04:13:29,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 28 SyntacticMatches, 13 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=498, Invalid=2924, Unknown=0, NotChecked=0, Total=3422 [2022-04-28 04:13:29,455 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 191 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 04:13:29,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 40 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 04:13:29,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-28 04:13:29,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 72. [2022-04-28 04:13:29,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:13:29,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 72 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 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:29,489 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 72 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 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:29,489 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 72 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 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:29,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:29,490 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2022-04-28 04:13:29,490 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2022-04-28 04:13:29,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:29,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:29,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 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 105 states. [2022-04-28 04:13:29,491 INFO L87 Difference]: Start difference. First operand has 72 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 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 105 states. [2022-04-28 04:13:29,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:29,491 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2022-04-28 04:13:29,492 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2022-04-28 04:13:29,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:29,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:29,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:13:29,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:13:29,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 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:29,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2022-04-28 04:13:29,493 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 69 [2022-04-28 04:13:29,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:13:29,493 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2022-04-28 04:13:29,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call 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:29,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 77 transitions. [2022-04-28 04:13:29,656 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:29,656 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2022-04-28 04:13:29,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 04:13:29,656 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:13:29,656 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, 1, 1, 1] [2022-04-28 04:13:29,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-28 04:13:29,657 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:13:29,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:13:29,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1788734331, now seen corresponding path program 22 times [2022-04-28 04:13:29,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:29,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [357830065] [2022-04-28 04:13:29,896 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:29,982 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:30,005 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:13:30,005 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:13:30,034 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:13:30,132 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:30,213 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:30,235 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:13:30,236 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:13:30,264 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:13:30,366 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:30,447 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:30,470 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:13:30,470 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:13:30,499 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:13:30,597 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:30,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:13:30,715 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:13:30,715 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:13:30,745 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:13:30,846 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:30,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:13:31,111 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:31,112 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:13:31,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1833199659, now seen corresponding path program 1 times [2022-04-28 04:13:31,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:13:31,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218167717] [2022-04-28 04:13:31,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:13:31,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:13:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:31,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:13:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:31,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {12987#(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); {12981#true} is VALID [2022-04-28 04:13:31,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {12981#true} assume true; {12981#true} is VALID [2022-04-28 04:13:31,145 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12981#true} {12981#true} #92#return; {12981#true} is VALID [2022-04-28 04:13:31,145 INFO L272 TraceCheckUtils]: 0: Hoare triple {12981#true} call ULTIMATE.init(); {12987#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:13:31,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {12987#(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); {12981#true} is VALID [2022-04-28 04:13:31,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {12981#true} assume true; {12981#true} is VALID [2022-04-28 04:13:31,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12981#true} {12981#true} #92#return; {12981#true} is VALID [2022-04-28 04:13:31,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {12981#true} call #t~ret10 := main(); {12981#true} is VALID [2022-04-28 04:13:31,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {12981#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {12986#(= main_~a~0 0)} is VALID [2022-04-28 04:13:31,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {12986#(= main_~a~0 0)} [148] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~d~0_360 v_main_~d~0_358)) (.cse1 (= v_main_~e~0_1594 v_main_~e~0_1589)) (.cse2 (= v_main_~a~0_166 v_main_~a~0_165)) (.cse3 (= v_main_~f~0_3287 v_main_~f~0_3264)) (.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~pre7_241| |v_main_#t~pre7_240|)) (.cse8 (= |v_main_#t~pre6_204| |v_main_#t~pre6_203|)) (.cse9 (= |v_main_#t~pre8_1316| |v_main_#t~pre8_1312|))) (or (and .cse0 .cse1 (= |v_main_#t~pre5_160| |v_main_#t~pre5_159|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |v_main_#t~pre9_2199| |v_main_#t~pre9_2180|)) (and .cse0 (= |v_main_#t~pre5_159| |v_main_#t~pre5_160|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |v_main_#t~pre9_2180| |v_main_#t~pre9_2199|) .cse9))) InVars {main_~e~0=v_main_~e~0_1594, main_~d~0=v_main_~d~0_360, main_~b~0=v_main_~b~0_223, main_~f~0=v_main_~f~0_3287, main_#t~pre7=|v_main_#t~pre7_241|, main_~c~0=v_main_~c~0_296, main_#t~pre8=|v_main_#t~pre8_1316|, main_#t~pre9=|v_main_#t~pre9_2199|, 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_1589, main_~d~0=v_main_~d~0_358, main_~b~0=v_main_~b~0_221, main_~f~0=v_main_~f~0_3264, main_#t~pre7=|v_main_#t~pre7_240|, main_~c~0=v_main_~c~0_294, main_#t~pre8=|v_main_#t~pre8_1312|, main_#t~pre9=|v_main_#t~pre9_2180|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {12986#(= main_~a~0 0)} is VALID [2022-04-28 04:13:31,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {12986#(= main_~a~0 0)} [147] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {12982#false} is VALID [2022-04-28 04:13:31,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {12982#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {12982#false} is VALID [2022-04-28 04:13:31,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {12982#false} assume !false; {12982#false} is VALID [2022-04-28 04:13:31,147 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:31,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:13:31,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218167717] [2022-04-28 04:13:31,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218167717] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:31,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:31,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:13:31,941 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:13:31,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [357830065] [2022-04-28 04:13:31,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [357830065] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:31,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:31,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 04:13:31,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22533811] [2022-04-28 04:13:31,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:13:31,942 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 1 states have call successors, (2), 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 71 [2022-04-28 04:13:31,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:13:31,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call 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:31,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:31,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 04:13:31,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:31,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 04:13:31,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2022-04-28 04:13:31,987 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call 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:34,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:34,316 INFO L93 Difference]: Finished difference Result 122 states and 147 transitions. [2022-04-28 04:13:34,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 04:13:34,317 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 1 states have call successors, (2), 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 71 [2022-04-28 04:13:34,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:13:34,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call 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:34,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 147 transitions. [2022-04-28 04:13:34,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call 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:34,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 147 transitions. [2022-04-28 04:13:34,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 147 transitions. [2022-04-28 04:13:34,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:34,418 INFO L225 Difference]: With dead ends: 122 [2022-04-28 04:13:34,418 INFO L226 Difference]: Without dead ends: 107 [2022-04-28 04:13:34,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 30 SyntacticMatches, 12 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=516, Invalid=3144, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 04:13:34,419 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 242 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:13:34,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 55 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 04:13:34,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-28 04:13:34,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 74. [2022-04-28 04:13:34,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:13:34,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 74 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 70 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:34,454 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 74 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 70 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:34,454 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 74 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 70 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:34,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:34,455 INFO L93 Difference]: Finished difference Result 107 states and 126 transitions. [2022-04-28 04:13:34,455 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 126 transitions. [2022-04-28 04:13:34,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:34,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:34,455 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 70 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 107 states. [2022-04-28 04:13:34,455 INFO L87 Difference]: Start difference. First operand has 74 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 70 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 107 states. [2022-04-28 04:13:34,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:34,456 INFO L93 Difference]: Finished difference Result 107 states and 126 transitions. [2022-04-28 04:13:34,456 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 126 transitions. [2022-04-28 04:13:34,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:34,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:34,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:13:34,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:13:34,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 70 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:34,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2022-04-28 04:13:34,457 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 71 [2022-04-28 04:13:34,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:13:34,457 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2022-04-28 04:13:34,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call 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:34,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 79 transitions. [2022-04-28 04:13:34,629 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:34,629 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2022-04-28 04:13:34,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 04:13:34,629 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:13:34,629 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, 1, 1, 1] [2022-04-28 04:13:34,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-28 04:13:34,630 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:13:34,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:13:34,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1070963933, now seen corresponding path program 23 times [2022-04-28 04:13:34,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:34,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1797448060] [2022-04-28 04:13:38,840 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:38,885 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:38,983 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:39,009 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:13:39,009 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:13:39,039 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:13:43,099 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:43,141 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,231 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,256 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:13:43,256 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:13:43,289 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:13:47,349 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:47,390 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:47,470 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:47,492 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:13:47,492 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:13:47,522 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:13:50,570 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:50,610 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:50,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:13:50,714 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:13:50,714 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:13:50,744 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:13:54,809 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:54,860 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,940 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:55,126 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:55,126 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:13:55,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1833261163, now seen corresponding path program 1 times [2022-04-28 04:13:55,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:13:55,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499932680] [2022-04-28 04:13:55,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:13:55,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:13:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:55,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:13:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:55,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {13688#(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); {13682#true} is VALID [2022-04-28 04:13:55,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {13682#true} assume true; {13682#true} is VALID [2022-04-28 04:13:55,153 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13682#true} {13682#true} #92#return; {13682#true} is VALID [2022-04-28 04:13:55,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {13682#true} call ULTIMATE.init(); {13688#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:13:55,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {13688#(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); {13682#true} is VALID [2022-04-28 04:13:55,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {13682#true} assume true; {13682#true} is VALID [2022-04-28 04:13:55,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13682#true} {13682#true} #92#return; {13682#true} is VALID [2022-04-28 04:13:55,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {13682#true} call #t~ret10 := main(); {13682#true} is VALID [2022-04-28 04:13:55,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {13682#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {13687#(= main_~a~0 0)} is VALID [2022-04-28 04:13:55,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {13687#(= main_~a~0 0)} [150] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_139| |v_main_#t~pre4_138|)) (.cse1 (= |v_main_#t~pre8_1389| |v_main_#t~pre8_1385|)) (.cse2 (= |v_main_#t~pre7_249| |v_main_#t~pre7_248|)) (.cse3 (= v_main_~a~0_172 v_main_~a~0_171)) (.cse4 (= v_main_~f~0_3502 v_main_~f~0_3478)) (.cse5 (= |v_main_#t~pre9_2343| |v_main_#t~pre9_2323|)) (.cse6 (= v_main_~d~0_372 v_main_~d~0_370)) (.cse7 (= |v_main_#t~pre5_166| |v_main_#t~pre5_165|)) (.cse8 (= |v_main_#t~pre6_211| |v_main_#t~pre6_210|)) (.cse9 (= v_main_~c~0_306 v_main_~c~0_304))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= v_main_~b~0_231 v_main_~b~0_229) (= v_main_~e~0_1682 v_main_~e~0_1677) .cse8 .cse9) (and (= v_main_~b~0_229 v_main_~b~0_231) .cse0 .cse1 (= v_main_~e~0_1677 v_main_~e~0_1682) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_1682, main_~d~0=v_main_~d~0_372, main_~b~0=v_main_~b~0_231, main_~f~0=v_main_~f~0_3502, main_#t~pre7=|v_main_#t~pre7_249|, main_~c~0=v_main_~c~0_306, main_#t~pre8=|v_main_#t~pre8_1389|, main_#t~pre9=|v_main_#t~pre9_2343|, 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_1677, main_~d~0=v_main_~d~0_370, main_~b~0=v_main_~b~0_229, main_~f~0=v_main_~f~0_3478, main_#t~pre7=|v_main_#t~pre7_248|, main_~c~0=v_main_~c~0_304, main_#t~pre8=|v_main_#t~pre8_1385|, main_#t~pre9=|v_main_#t~pre9_2323|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {13687#(= main_~a~0 0)} is VALID [2022-04-28 04:13:55,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {13687#(= main_~a~0 0)} [149] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {13683#false} is VALID [2022-04-28 04:13:55,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {13683#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {13683#false} is VALID [2022-04-28 04:13:55,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {13683#false} assume !false; {13683#false} is VALID [2022-04-28 04:13:55,159 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:55,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:13:55,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499932680] [2022-04-28 04:13:55,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499932680] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:55,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:55,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:13:55,971 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:13:55,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1797448060] [2022-04-28 04:13:55,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1797448060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:55,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:55,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-28 04:13:55,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362372178] [2022-04-28 04:13:55,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:13:55,972 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 1 states have call successors, (2), 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 73 [2022-04-28 04:13:55,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:13:55,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call 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:56,018 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:13:56,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-28 04:13:56,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:56,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-28 04:13:56,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=876, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 04:13:56,019 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call 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:58,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:58,503 INFO L93 Difference]: Finished difference Result 124 states and 149 transitions. [2022-04-28 04:13:58,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 04:13:58,503 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 1 states have call successors, (2), 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 73 [2022-04-28 04:13:58,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:13:58,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call 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:58,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 149 transitions. [2022-04-28 04:13:58,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call 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:58,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 149 transitions. [2022-04-28 04:13:58,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 149 transitions. [2022-04-28 04:13:58,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:58,606 INFO L225 Difference]: With dead ends: 124 [2022-04-28 04:13:58,606 INFO L226 Difference]: Without dead ends: 109 [2022-04-28 04:13:58,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 32 SyntacticMatches, 11 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=534, Invalid=3372, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 04:13:58,607 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 195 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:13:58,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 35 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 04:13:58,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-28 04:13:58,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 76. [2022-04-28 04:13:58,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:13:58,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 76 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 72 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:58,649 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 76 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 72 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:58,649 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 76 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 72 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:58,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:58,652 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2022-04-28 04:13:58,652 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 128 transitions. [2022-04-28 04:13:58,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:58,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:58,652 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 72 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 109 states. [2022-04-28 04:13:58,652 INFO L87 Difference]: Start difference. First operand has 76 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 72 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 109 states. [2022-04-28 04:13:58,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:58,653 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2022-04-28 04:13:58,653 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 128 transitions. [2022-04-28 04:13:58,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:58,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:58,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:13:58,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:13:58,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 72 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:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2022-04-28 04:13:58,654 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 73 [2022-04-28 04:13:58,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:13:58,655 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2022-04-28 04:13:58,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call 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:58,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 81 transitions. [2022-04-28 04:13:58,831 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:58,831 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2022-04-28 04:13:58,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 04:13:58,831 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:13:58,831 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, 1, 1, 1] [2022-04-28 04:13:58,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-28 04:13:58,831 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:13:58,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:13:58,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1511621185, now seen corresponding path program 24 times [2022-04-28 04:13:58,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:58,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [93599600] [2022-04-28 04:14:03,075 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:14:03,115 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:03,197 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:03,221 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:14:03,221 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:14:03,250 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:14:05,318 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:14:05,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:14:05,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:14:05,470 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:14:05,471 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:14:05,500 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:14:07,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:14:07,284 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,308 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:14:07,309 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:14:07,339 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:14:09,484 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:14:09,525 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:09,605 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:09,629 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:14:09,629 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:14:09,659 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:14:13,722 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:14:13,764 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,846 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,031 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:14,031 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:14:14,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1833322667, now seen corresponding path program 1 times [2022-04-28 04:14:14,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:14:14,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666326383] [2022-04-28 04:14:14,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:14:14,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:14:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:14,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:14:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:14,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {14404#(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); {14398#true} is VALID [2022-04-28 04:14:14,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {14398#true} assume true; {14398#true} is VALID [2022-04-28 04:14:14,057 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14398#true} {14398#true} #92#return; {14398#true} is VALID [2022-04-28 04:14:14,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {14398#true} call ULTIMATE.init(); {14404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:14:14,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {14404#(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); {14398#true} is VALID [2022-04-28 04:14:14,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {14398#true} assume true; {14398#true} is VALID [2022-04-28 04:14:14,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14398#true} {14398#true} #92#return; {14398#true} is VALID [2022-04-28 04:14:14,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {14398#true} call #t~ret10 := main(); {14398#true} is VALID [2022-04-28 04:14:14,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {14398#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {14403#(= main_~a~0 0)} is VALID [2022-04-28 04:14:14,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {14403#(= main_~a~0 0)} [152] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~d~0_384 v_main_~d~0_382)) (.cse1 (= |v_main_#t~pre5_172| |v_main_#t~pre5_171|)) (.cse2 (= v_main_~c~0_316 v_main_~c~0_314)) (.cse3 (= v_main_~a~0_178 v_main_~a~0_177)) (.cse4 (= |v_main_#t~pre6_218| |v_main_#t~pre6_217|)) (.cse5 (= v_main_~b~0_239 v_main_~b~0_237)) (.cse6 (= v_main_~f~0_3723 v_main_~f~0_3698)) (.cse7 (= v_main_~e~0_1770 v_main_~e~0_1765)) (.cse8 (= |v_main_#t~pre9_2492| |v_main_#t~pre9_2471|)) (.cse9 (= |v_main_#t~pre7_257| |v_main_#t~pre7_256|)) (.cse10 (= |v_main_#t~pre4_144| |v_main_#t~pre4_143|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |v_main_#t~pre8_1458| |v_main_#t~pre8_1462|) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |v_main_#t~pre8_1462| |v_main_#t~pre8_1458|) .cse10))) InVars {main_~e~0=v_main_~e~0_1770, main_~d~0=v_main_~d~0_384, main_~b~0=v_main_~b~0_239, main_~f~0=v_main_~f~0_3723, main_#t~pre7=|v_main_#t~pre7_257|, main_~c~0=v_main_~c~0_316, main_#t~pre8=|v_main_#t~pre8_1462|, main_#t~pre9=|v_main_#t~pre9_2492|, 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_1765, main_~d~0=v_main_~d~0_382, main_~b~0=v_main_~b~0_237, main_~f~0=v_main_~f~0_3698, main_#t~pre7=|v_main_#t~pre7_256|, main_~c~0=v_main_~c~0_314, main_#t~pre8=|v_main_#t~pre8_1458|, main_#t~pre9=|v_main_#t~pre9_2471|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {14403#(= main_~a~0 0)} is VALID [2022-04-28 04:14:14,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {14403#(= main_~a~0 0)} [151] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {14399#false} is VALID [2022-04-28 04:14:14,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {14399#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {14399#false} is VALID [2022-04-28 04:14:14,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {14399#false} assume !false; {14399#false} is VALID [2022-04-28 04:14:14,064 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,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:14:14,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666326383] [2022-04-28 04:14:14,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666326383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:14,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:14,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:14:14,916 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:14:14,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [93599600] [2022-04-28 04:14:14,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [93599600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:14,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:14,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-28 04:14:14,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844256211] [2022-04-28 04:14:14,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:14:14,917 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 states have internal predecessors, (72), 1 states have call successors, (2), 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 75 [2022-04-28 04:14:14,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:14:14,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call 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:14,964 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:14:14,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-28 04:14:14,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:14,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-28 04:14:14,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=936, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 04:14:14,965 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call 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:17,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:17,709 INFO L93 Difference]: Finished difference Result 126 states and 151 transitions. [2022-04-28 04:14:17,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 04:14:17,709 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 states have internal predecessors, (72), 1 states have call successors, (2), 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 75 [2022-04-28 04:14:17,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:14:17,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call 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:17,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 151 transitions. [2022-04-28 04:14:17,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call 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:17,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 151 transitions. [2022-04-28 04:14:17,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 151 transitions. [2022-04-28 04:14:17,814 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:14:17,815 INFO L225 Difference]: With dead ends: 126 [2022-04-28 04:14:17,815 INFO L226 Difference]: Without dead ends: 111 [2022-04-28 04:14:17,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 35 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=552, Invalid=3608, Unknown=0, NotChecked=0, Total=4160 [2022-04-28 04:14:17,817 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 183 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1684 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:14:17,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 75 Invalid, 1755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1684 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 04:14:17,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-28 04:14:17,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 78. [2022-04-28 04:14:17,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:14:17,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 78 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 74 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call 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:17,856 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 78 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 74 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call 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:17,856 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 78 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 74 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call 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:17,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:17,857 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2022-04-28 04:14:17,857 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2022-04-28 04:14:17,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:17,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:17,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 74 states have internal predecessors, (80), 2 states have call successors, (2), 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 111 states. [2022-04-28 04:14:17,858 INFO L87 Difference]: Start difference. First operand has 78 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 74 states have internal predecessors, (80), 2 states have call successors, (2), 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 111 states. [2022-04-28 04:14:17,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:17,858 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2022-04-28 04:14:17,858 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2022-04-28 04:14:17,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:17,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:17,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:14:17,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:14:17,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 74 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call 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:17,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2022-04-28 04:14:17,859 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 75 [2022-04-28 04:14:17,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:14:17,860 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2022-04-28 04:14:17,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call 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:17,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 83 transitions. [2022-04-28 04:14:18,062 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:18,063 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2022-04-28 04:14:18,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 04:14:18,063 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:14:18,063 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, 1, 1, 1] [2022-04-28 04:14:18,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-28 04:14:18,063 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:14:18,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:14:18,064 INFO L85 PathProgramCache]: Analyzing trace with hash 884822495, now seen corresponding path program 25 times [2022-04-28 04:14:18,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:18,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1877499187] [2022-04-28 04:14:18,318 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:18,404 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:18,543 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:14:18,581 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:14:18,678 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:18,759 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:18,901 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:14:18,946 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:14:19,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:14:19,125 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:19,264 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:14:19,303 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:14:19,398 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:19,478 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:19,616 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:14:19,655 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:14:19,754 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:19,834 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:20,034 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:20,034 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:14:20,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1833384171, now seen corresponding path program 1 times [2022-04-28 04:14:20,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:14:20,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739998517] [2022-04-28 04:14:20,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:14:20,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:14:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:20,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:14:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:20,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {15135#(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); {15129#true} is VALID [2022-04-28 04:14:20,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {15129#true} assume true; {15129#true} is VALID [2022-04-28 04:14:20,066 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15129#true} {15129#true} #92#return; {15129#true} is VALID [2022-04-28 04:14:20,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {15129#true} call ULTIMATE.init(); {15135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:14:20,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {15135#(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); {15129#true} is VALID [2022-04-28 04:14:20,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {15129#true} assume true; {15129#true} is VALID [2022-04-28 04:14:20,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15129#true} {15129#true} #92#return; {15129#true} is VALID [2022-04-28 04:14:20,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {15129#true} call #t~ret10 := main(); {15129#true} is VALID [2022-04-28 04:14:20,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {15129#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {15134#(= main_~a~0 0)} is VALID [2022-04-28 04:14:20,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {15134#(= main_~a~0 0)} [154] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre6_225| |v_main_#t~pre6_224|)) (.cse1 (= v_main_~d~0_396 v_main_~d~0_394)) (.cse2 (= v_main_~b~0_247 v_main_~b~0_245)) (.cse3 (= v_main_~f~0_3966 v_main_~f~0_3940)) (.cse4 (= v_main_~a~0_184 v_main_~a~0_183)) (.cse5 (= |v_main_#t~pre9_2662| |v_main_#t~pre9_2640|)) (.cse6 (= |v_main_#t~pre5_178| |v_main_#t~pre5_177|)) (.cse7 (= v_main_~e~0_1870 v_main_~e~0_1865)) (.cse8 (= |v_main_#t~pre7_265| |v_main_#t~pre7_264|)) (.cse9 (= |v_main_#t~pre4_149| |v_main_#t~pre4_148|)) (.cse10 (= v_main_~c~0_326 v_main_~c~0_324))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_main_#t~pre8_1551| |v_main_#t~pre8_1547|) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |v_main_#t~pre8_1547| |v_main_#t~pre8_1551|) .cse9 .cse10))) InVars {main_~e~0=v_main_~e~0_1870, main_~d~0=v_main_~d~0_396, main_~b~0=v_main_~b~0_247, main_~f~0=v_main_~f~0_3966, main_#t~pre7=|v_main_#t~pre7_265|, main_~c~0=v_main_~c~0_326, main_#t~pre8=|v_main_#t~pre8_1551|, main_#t~pre9=|v_main_#t~pre9_2662|, 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_1865, main_~d~0=v_main_~d~0_394, main_~b~0=v_main_~b~0_245, main_~f~0=v_main_~f~0_3940, main_#t~pre7=|v_main_#t~pre7_264|, main_~c~0=v_main_~c~0_324, main_#t~pre8=|v_main_#t~pre8_1547|, main_#t~pre9=|v_main_#t~pre9_2640|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {15134#(= main_~a~0 0)} is VALID [2022-04-28 04:14:20,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {15134#(= main_~a~0 0)} [153] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {15130#false} is VALID [2022-04-28 04:14:20,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {15130#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {15130#false} is VALID [2022-04-28 04:14:20,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {15130#false} assume !false; {15130#false} is VALID [2022-04-28 04:14:20,068 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:20,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:14:20,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739998517] [2022-04-28 04:14:20,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739998517] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:20,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:20,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:14:20,989 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:14:20,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1877499187] [2022-04-28 04:14:20,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1877499187] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:20,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:20,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-28 04:14:20,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202280841] [2022-04-28 04:14:20,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:14:20,990 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 states have internal predecessors, (74), 1 states have call successors, (2), 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 77 [2022-04-28 04:14:20,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:14:20,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 states have internal predecessors, (74), 1 states have call successors, (2), 2 states have call 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:21,039 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:14:21,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-28 04:14:21,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:21,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-28 04:14:21,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=998, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 04:14:21,039 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 states have internal predecessors, (74), 1 states have call successors, (2), 2 states have call 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:23,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:23,662 INFO L93 Difference]: Finished difference Result 128 states and 153 transitions. [2022-04-28 04:14:23,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 04:14:23,662 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 states have internal predecessors, (74), 1 states have call successors, (2), 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 77 [2022-04-28 04:14:23,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:14:23,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 states have internal predecessors, (74), 1 states have call successors, (2), 2 states have call 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:23,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 153 transitions. [2022-04-28 04:14:23,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 states have internal predecessors, (74), 1 states have call successors, (2), 2 states have call 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:23,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 153 transitions. [2022-04-28 04:14:23,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 153 transitions. [2022-04-28 04:14:23,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:23,768 INFO L225 Difference]: With dead ends: 128 [2022-04-28 04:14:23,768 INFO L226 Difference]: Without dead ends: 113 [2022-04-28 04:14:23,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 32 SyntacticMatches, 13 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=570, Invalid=3852, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 04:14:23,769 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 176 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1588 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:14:23,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 65 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1588 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 04:14:23,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-28 04:14:23,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 80. [2022-04-28 04:14:23,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:14:23,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 80 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 76 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:14:23,814 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 80 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 76 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:14:23,814 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 80 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 76 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:14:23,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:23,815 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2022-04-28 04:14:23,815 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions. [2022-04-28 04:14:23,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:23,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:23,821 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 76 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 113 states. [2022-04-28 04:14:23,821 INFO L87 Difference]: Start difference. First operand has 80 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 76 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 113 states. [2022-04-28 04:14:23,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:23,824 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2022-04-28 04:14:23,824 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions. [2022-04-28 04:14:23,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:23,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:23,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:14:23,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:14:23,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 76 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:14:23,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2022-04-28 04:14:23,825 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 77 [2022-04-28 04:14:23,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:14:23,825 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2022-04-28 04:14:23,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 states have internal predecessors, (74), 1 states have call successors, (2), 2 states have call 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:23,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 85 transitions. [2022-04-28 04:14:24,018 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:24,018 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2022-04-28 04:14:24,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 04:14:24,018 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:14:24,018 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, 1, 1, 1] [2022-04-28 04:14:24,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-28 04:14:24,019 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:14:24,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:14:24,019 INFO L85 PathProgramCache]: Analyzing trace with hash -173297155, now seen corresponding path program 26 times [2022-04-28 04:14:24,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:24,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [349138854] [2022-04-28 04:14:28,257 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:14:28,303 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:28,394 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:28,416 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:14:28,416 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:14:28,445 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:14:30,840 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:14:30,888 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:30,977 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:30,999 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:14:30,999 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:14:31,029 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:14:33,150 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:14:33,197 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,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:14:33,298 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:14:33,298 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:14:33,328 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:14:37,396 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:14:37,448 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:37,538 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:37,560 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:14:37,560 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:14:37,590 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:14:41,658 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:14:41,712 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:41,803 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:41,997 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:41,997 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:14:41,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1833445675, now seen corresponding path program 1 times [2022-04-28 04:14:41,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:14:41,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849235555] [2022-04-28 04:14:41,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:14:41,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:14:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:42,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:14:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:42,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {15881#(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); {15875#true} is VALID [2022-04-28 04:14:42,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {15875#true} assume true; {15875#true} is VALID [2022-04-28 04:14:42,019 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15875#true} {15875#true} #92#return; {15875#true} is VALID [2022-04-28 04:14:42,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {15875#true} call ULTIMATE.init(); {15881#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:14:42,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {15881#(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); {15875#true} is VALID [2022-04-28 04:14:42,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {15875#true} assume true; {15875#true} is VALID [2022-04-28 04:14:42,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15875#true} {15875#true} #92#return; {15875#true} is VALID [2022-04-28 04:14:42,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {15875#true} call #t~ret10 := main(); {15875#true} is VALID [2022-04-28 04:14:42,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {15875#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {15880#(= main_~a~0 0)} is VALID [2022-04-28 04:14:42,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {15880#(= main_~a~0 0)} [156] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre9_2821| |v_main_#t~pre9_2798|)) (.cse1 (= v_main_~b~0_255 v_main_~b~0_253)) (.cse2 (= v_main_~d~0_408 v_main_~d~0_406)) (.cse3 (= |v_main_#t~pre7_273| |v_main_#t~pre7_272|)) (.cse4 (= v_main_~f~0_4199 v_main_~f~0_4172)) (.cse5 (= v_main_~c~0_336 v_main_~c~0_334)) (.cse6 (= |v_main_#t~pre6_232| |v_main_#t~pre6_231|)) (.cse7 (= |v_main_#t~pre4_154| |v_main_#t~pre4_153|))) (or (and (= |v_main_#t~pre5_184| |v_main_#t~pre5_183|) (= |v_main_#t~pre8_1624| |v_main_#t~pre8_1620|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= v_main_~e~0_1958 v_main_~e~0_1953) .cse6 (= v_main_~a~0_190 v_main_~a~0_189) .cse7) (and (= |v_main_#t~pre8_1620| |v_main_#t~pre8_1624|) .cse0 (= |v_main_#t~pre5_183| |v_main_#t~pre5_184|) .cse1 (= v_main_~e~0_1953 v_main_~e~0_1958) .cse2 .cse3 (= v_main_~a~0_189 v_main_~a~0_190) .cse4 .cse5 .cse6 .cse7))) InVars {main_~e~0=v_main_~e~0_1958, main_~d~0=v_main_~d~0_408, main_~b~0=v_main_~b~0_255, main_~f~0=v_main_~f~0_4199, main_#t~pre7=|v_main_#t~pre7_273|, main_~c~0=v_main_~c~0_336, main_#t~pre8=|v_main_#t~pre8_1624|, main_#t~pre9=|v_main_#t~pre9_2821|, 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_1953, main_~d~0=v_main_~d~0_406, main_~b~0=v_main_~b~0_253, main_~f~0=v_main_~f~0_4172, main_#t~pre7=|v_main_#t~pre7_272|, main_~c~0=v_main_~c~0_334, main_#t~pre8=|v_main_#t~pre8_1620|, main_#t~pre9=|v_main_#t~pre9_2798|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {15880#(= main_~a~0 0)} is VALID [2022-04-28 04:14:42,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {15880#(= main_~a~0 0)} [155] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {15876#false} is VALID [2022-04-28 04:14:42,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {15876#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {15876#false} is VALID [2022-04-28 04:14:42,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {15876#false} assume !false; {15876#false} is VALID [2022-04-28 04:14:42,023 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:42,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:14:42,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849235555] [2022-04-28 04:14:42,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849235555] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:42,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:42,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:14:43,070 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:14:43,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [349138854] [2022-04-28 04:14:43,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [349138854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:43,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:43,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-28 04:14:43,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732870250] [2022-04-28 04:14:43,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:14:43,071 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 1 states have call successors, (2), 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 79 [2022-04-28 04:14:43,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:14:43,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 1 states have call successors, (2), 2 states have call 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:43,120 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:14:43,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-28 04:14:43,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:43,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-28 04:14:43,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 04:14:43,121 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 1 states have call successors, (2), 2 states have call 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:45,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:45,932 INFO L93 Difference]: Finished difference Result 132 states and 158 transitions. [2022-04-28 04:14:45,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 04:14:45,933 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 1 states have call successors, (2), 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 79 [2022-04-28 04:14:45,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:14:45,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 1 states have call successors, (2), 2 states have call 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:45,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 158 transitions. [2022-04-28 04:14:45,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 1 states have call successors, (2), 2 states have call 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:45,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 158 transitions. [2022-04-28 04:14:45,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 158 transitions. [2022-04-28 04:14:46,045 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:14:46,046 INFO L225 Difference]: With dead ends: 132 [2022-04-28 04:14:46,046 INFO L226 Difference]: Without dead ends: 117 [2022-04-28 04:14:46,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 30 SyntacticMatches, 16 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=588, Invalid=4104, Unknown=0, NotChecked=0, Total=4692 [2022-04-28 04:14:46,047 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 240 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1617 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:14:46,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 25 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1617 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 04:14:46,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-28 04:14:46,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 84. [2022-04-28 04:14:46,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:14:46,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 84 states, 80 states have (on average 1.075) internal successors, (86), 80 states have internal predecessors, (86), 2 states have call successors, (2), 2 states have call 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:46,106 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 84 states, 80 states have (on average 1.075) internal successors, (86), 80 states have internal predecessors, (86), 2 states have call successors, (2), 2 states have call 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:46,106 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 84 states, 80 states have (on average 1.075) internal successors, (86), 80 states have internal predecessors, (86), 2 states have call successors, (2), 2 states have call 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:46,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:46,107 INFO L93 Difference]: Finished difference Result 117 states and 136 transitions. [2022-04-28 04:14:46,107 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2022-04-28 04:14:46,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:46,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:46,107 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 80 states have (on average 1.075) internal successors, (86), 80 states have internal predecessors, (86), 2 states have call successors, (2), 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 117 states. [2022-04-28 04:14:46,108 INFO L87 Difference]: Start difference. First operand has 84 states, 80 states have (on average 1.075) internal successors, (86), 80 states have internal predecessors, (86), 2 states have call successors, (2), 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 117 states. [2022-04-28 04:14:46,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:46,108 INFO L93 Difference]: Finished difference Result 117 states and 136 transitions. [2022-04-28 04:14:46,108 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2022-04-28 04:14:46,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:46,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:46,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:14:46,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:14:46,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 80 states have (on average 1.075) internal successors, (86), 80 states have internal predecessors, (86), 2 states have call successors, (2), 2 states have call 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:46,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2022-04-28 04:14:46,110 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 79 [2022-04-28 04:14:46,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:14:46,110 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2022-04-28 04:14:46,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 1 states have call successors, (2), 2 states have call 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:46,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 89 transitions. [2022-04-28 04:14:46,331 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:46,331 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2022-04-28 04:14:46,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-28 04:14:46,331 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:14:46,332 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, 1, 1, 1] [2022-04-28 04:14:46,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-28 04:14:46,332 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:14:46,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:14:46,332 INFO L85 PathProgramCache]: Analyzing trace with hash 880968347, now seen corresponding path program 27 times [2022-04-28 04:14:46,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:46,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [66258817] [2022-04-28 04:14:46,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:14:46,701 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:49,762 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:14:49,821 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:14:49,928 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:50,009 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:54,107 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:14:54,174 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:14:54,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:14:54,375 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,773 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:14:56,837 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:14:56,948 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:57,029 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:59,223 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:14:59,339 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:59,419 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:59,593 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:59,593 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:14:59,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1833507179, now seen corresponding path program 1 times [2022-04-28 04:14:59,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:14:59,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101775501] [2022-04-28 04:14:59,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:14:59,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:14:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:59,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:14:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:59,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {16654#(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); {16648#true} is VALID [2022-04-28 04:14:59,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {16648#true} assume true; {16648#true} is VALID [2022-04-28 04:14:59,624 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16648#true} {16648#true} #92#return; {16648#true} is VALID [2022-04-28 04:14:59,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {16648#true} call ULTIMATE.init(); {16654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:14:59,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {16654#(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); {16648#true} is VALID [2022-04-28 04:14:59,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {16648#true} assume true; {16648#true} is VALID [2022-04-28 04:14:59,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16648#true} {16648#true} #92#return; {16648#true} is VALID [2022-04-28 04:14:59,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {16648#true} call #t~ret10 := main(); {16648#true} is VALID [2022-04-28 04:14:59,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {16648#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {16653#(= main_~a~0 0)} is VALID [2022-04-28 04:14:59,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {16653#(= main_~a~0 0)} [158] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre6_239| |v_main_#t~pre6_238|)) (.cse1 (= v_main_~d~0_420 v_main_~d~0_418)) (.cse2 (= v_main_~e~0_2036 v_main_~e~0_2031)) (.cse3 (= |v_main_#t~pre5_190| |v_main_#t~pre5_189|)) (.cse4 (= v_main_~b~0_263 v_main_~b~0_261)) (.cse5 (= v_main_~c~0_346 v_main_~c~0_344)) (.cse6 (= |v_main_#t~pre4_159| |v_main_#t~pre4_158|)) (.cse7 (= |v_main_#t~pre9_2975| |v_main_#t~pre9_2951|)) (.cse8 (= v_main_~a~0_196 v_main_~a~0_195)) (.cse9 (= v_main_~f~0_4427 v_main_~f~0_4399))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_main_#t~pre7_280| |v_main_#t~pre7_281|) .cse6 .cse7 .cse8 (= |v_main_#t~pre8_1688| |v_main_#t~pre8_1692|) .cse9) (and .cse0 .cse1 .cse2 (= |v_main_#t~pre8_1692| |v_main_#t~pre8_1688|) .cse3 .cse4 .cse5 .cse6 .cse7 (= |v_main_#t~pre7_281| |v_main_#t~pre7_280|) .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_2036, main_~d~0=v_main_~d~0_420, main_~b~0=v_main_~b~0_263, main_~f~0=v_main_~f~0_4427, main_#t~pre7=|v_main_#t~pre7_281|, main_~c~0=v_main_~c~0_346, main_#t~pre8=|v_main_#t~pre8_1692|, main_#t~pre9=|v_main_#t~pre9_2975|, 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_2031, main_~d~0=v_main_~d~0_418, main_~b~0=v_main_~b~0_261, main_~f~0=v_main_~f~0_4399, main_#t~pre7=|v_main_#t~pre7_280|, main_~c~0=v_main_~c~0_344, main_#t~pre8=|v_main_#t~pre8_1688|, main_#t~pre9=|v_main_#t~pre9_2951|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {16653#(= main_~a~0 0)} is VALID [2022-04-28 04:14:59,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {16653#(= main_~a~0 0)} [157] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {16649#false} is VALID [2022-04-28 04:14:59,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {16649#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {16649#false} is VALID [2022-04-28 04:14:59,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {16649#false} assume !false; {16649#false} is VALID [2022-04-28 04:14:59,627 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:59,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:14:59,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101775501] [2022-04-28 04:14:59,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101775501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:59,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:59,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:15:00,707 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:15:00,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [66258817] [2022-04-28 04:15:00,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [66258817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:15:00,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:15:00,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-28 04:15:00,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289748568] [2022-04-28 04:15:00,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:15:00,708 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:15:00,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:15:00,708 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:15:00,762 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:15:00,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-28 04:15:00,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:15:00,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-28 04:15:00,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1128, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 04:15:00,762 INFO L87 Difference]: Start difference. First operand 84 states and 89 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:15:04,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:04,134 INFO L93 Difference]: Finished difference Result 133 states and 158 transitions. [2022-04-28 04:15:04,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 04:15:04,135 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:15:04,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:15:04,135 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:15:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 158 transitions. [2022-04-28 04:15:04,136 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:15:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 158 transitions. [2022-04-28 04:15:04,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 158 transitions. [2022-04-28 04:15:04,251 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:15:04,253 INFO L225 Difference]: With dead ends: 133 [2022-04-28 04:15:04,253 INFO L226 Difference]: Without dead ends: 118 [2022-04-28 04:15:04,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 31 SyntacticMatches, 16 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=606, Invalid=4364, Unknown=0, NotChecked=0, Total=4970 [2022-04-28 04:15:04,253 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 228 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1919 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 2030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:15:04,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 35 Invalid, 2030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1919 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 04:15:04,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-28 04:15:04,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 86. [2022-04-28 04:15:04,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:15:04,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 86 states, 82 states have (on average 1.0731707317073171) internal successors, (88), 82 states have internal predecessors, (88), 2 states have call successors, (2), 2 states have call 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,314 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 86 states, 82 states have (on average 1.0731707317073171) internal successors, (88), 82 states have internal predecessors, (88), 2 states have call successors, (2), 2 states have call 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,314 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 86 states, 82 states have (on average 1.0731707317073171) internal successors, (88), 82 states have internal predecessors, (88), 2 states have call successors, (2), 2 states have call 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,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:04,315 INFO L93 Difference]: Finished difference Result 118 states and 137 transitions. [2022-04-28 04:15:04,315 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 137 transitions. [2022-04-28 04:15:04,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:15:04,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:15:04,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 82 states have (on average 1.0731707317073171) internal successors, (88), 82 states have internal predecessors, (88), 2 states have call successors, (2), 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:04,316 INFO L87 Difference]: Start difference. First operand has 86 states, 82 states have (on average 1.0731707317073171) internal successors, (88), 82 states have internal predecessors, (88), 2 states have call successors, (2), 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:04,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:04,317 INFO L93 Difference]: Finished difference Result 118 states and 137 transitions. [2022-04-28 04:15:04,317 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 137 transitions. [2022-04-28 04:15:04,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:15:04,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:15:04,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:15:04,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:15:04,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 82 states have (on average 1.0731707317073171) internal successors, (88), 82 states have internal predecessors, (88), 2 states have call successors, (2), 2 states have call 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,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2022-04-28 04:15:04,318 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 81 [2022-04-28 04:15:04,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:15:04,318 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2022-04-28 04:15:04,318 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:15:04,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 91 transitions. [2022-04-28 04:15:04,560 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,560 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-04-28 04:15:04,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 04:15:04,560 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:15:04,560 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, 1, 1, 1] [2022-04-28 04:15:04,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-28 04:15:04,561 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:15:04,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:15:04,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1797419514, now seen corresponding path program 28 times [2022-04-28 04:15:04,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:15:04,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [705714120] [2022-04-28 04:15:08,794 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:15:08,835 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:08,921 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:09,068 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:15:09,106 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:15:11,177 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:15:11,219 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:11,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:11,449 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:15:11,485 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:15:15,545 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:15:15,585 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:15,664 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:15,807 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:15:15,842 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:15:19,899 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:15:19,942 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,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:20,190 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:15:20,225 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:15:22,347 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:15:22,389 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:22,472 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,678 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:22,678 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:15:22,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1833568683, now seen corresponding path program 1 times [2022-04-28 04:15:22,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:15:22,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474066175] [2022-04-28 04:15:22,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:15:22,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:15:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:15:22,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:15:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:15:22,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {17438#(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); {17432#true} is VALID [2022-04-28 04:15:22,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {17432#true} assume true; {17432#true} is VALID [2022-04-28 04:15:22,700 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17432#true} {17432#true} #92#return; {17432#true} is VALID [2022-04-28 04:15:22,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {17432#true} call ULTIMATE.init(); {17438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:15:22,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {17438#(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); {17432#true} is VALID [2022-04-28 04:15:22,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {17432#true} assume true; {17432#true} is VALID [2022-04-28 04:15:22,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17432#true} {17432#true} #92#return; {17432#true} is VALID [2022-04-28 04:15:22,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {17432#true} call #t~ret10 := main(); {17432#true} is VALID [2022-04-28 04:15:22,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {17432#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {17437#(= main_~a~0 0)} is VALID [2022-04-28 04:15:22,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {17437#(= main_~a~0 0)} [160] 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_#t~pre9_3129| |v_main_#t~pre9_3105|)) (.cse3 (= v_main_~c~0_356 v_main_~c~0_354)) (.cse4 (= |v_main_#t~pre6_246| |v_main_#t~pre6_245|)) (.cse5 (= v_main_~a~0_202 v_main_~a~0_201)) (.cse6 (= |v_main_#t~pre7_289| |v_main_#t~pre7_288|)) (.cse7 (= v_main_~d~0_432 v_main_~d~0_430)) (.cse8 (= v_main_~f~0_4681 v_main_~f~0_4652)) (.cse9 (= v_main_~e~0_2141 v_main_~e~0_2135)) (.cse10 (= |v_main_#t~pre8_1785| |v_main_#t~pre8_1780|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= v_main_~b~0_269 v_main_~b~0_271)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= v_main_~b~0_271 v_main_~b~0_269) .cse9 .cse10))) InVars {main_~e~0=v_main_~e~0_2141, main_~d~0=v_main_~d~0_432, main_~b~0=v_main_~b~0_271, main_~f~0=v_main_~f~0_4681, main_#t~pre7=|v_main_#t~pre7_289|, main_~c~0=v_main_~c~0_356, main_#t~pre8=|v_main_#t~pre8_1785|, main_#t~pre9=|v_main_#t~pre9_3129|, 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_2135, main_~d~0=v_main_~d~0_430, main_~b~0=v_main_~b~0_269, main_~f~0=v_main_~f~0_4652, main_#t~pre7=|v_main_#t~pre7_288|, main_~c~0=v_main_~c~0_354, main_#t~pre8=|v_main_#t~pre8_1780|, main_#t~pre9=|v_main_#t~pre9_3105|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {17437#(= main_~a~0 0)} is VALID [2022-04-28 04:15:22,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {17437#(= main_~a~0 0)} [159] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {17433#false} is VALID [2022-04-28 04:15:22,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {17433#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {17433#false} is VALID [2022-04-28 04:15:22,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {17433#false} assume !false; {17433#false} is VALID [2022-04-28 04:15:22,704 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:22,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:15:22,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474066175] [2022-04-28 04:15:22,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474066175] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:15:22,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:15:22,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:15:23,840 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:15:23,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [705714120] [2022-04-28 04:15:23,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [705714120] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:15:23,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:15:23,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-28 04:15:23,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464757980] [2022-04-28 04:15:23,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:15:23,841 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 1 states have call successors, (2), 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 84 [2022-04-28 04:15:23,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:15:23,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call 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:23,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:15:23,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-28 04:15:23,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:15:23,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-28 04:15:23,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1196, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 04:15:23,898 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call 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:27,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:27,241 INFO L93 Difference]: Finished difference Result 135 states and 160 transitions. [2022-04-28 04:15:27,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 04:15:27,241 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 1 states have call successors, (2), 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 84 [2022-04-28 04:15:27,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:15:27,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call 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:27,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 160 transitions. [2022-04-28 04:15:27,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call 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:27,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 160 transitions. [2022-04-28 04:15:27,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 160 transitions. [2022-04-28 04:15:27,352 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:15:27,353 INFO L225 Difference]: With dead ends: 135 [2022-04-28 04:15:27,353 INFO L226 Difference]: Without dead ends: 120 [2022-04-28 04:15:27,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 31 SyntacticMatches, 18 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=624, Invalid=4632, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 04:15:27,353 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 236 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1981 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 2085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:15:27,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 75 Invalid, 2085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1981 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 04:15:27,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-28 04:15:27,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 87. [2022-04-28 04:15:27,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:15:27,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 87 states, 83 states have (on average 1.072289156626506) internal successors, (89), 83 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:15:27,402 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 87 states, 83 states have (on average 1.072289156626506) internal successors, (89), 83 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:15:27,402 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 87 states, 83 states have (on average 1.072289156626506) internal successors, (89), 83 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:15:27,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:27,403 INFO L93 Difference]: Finished difference Result 120 states and 139 transitions. [2022-04-28 04:15:27,403 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 139 transitions. [2022-04-28 04:15:27,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:15:27,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:15:27,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 83 states have (on average 1.072289156626506) internal successors, (89), 83 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 120 states. [2022-04-28 04:15:27,404 INFO L87 Difference]: Start difference. First operand has 87 states, 83 states have (on average 1.072289156626506) internal successors, (89), 83 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 120 states. [2022-04-28 04:15:27,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:27,405 INFO L93 Difference]: Finished difference Result 120 states and 139 transitions. [2022-04-28 04:15:27,405 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 139 transitions. [2022-04-28 04:15:27,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:15:27,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:15:27,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:15:27,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:15:27,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.072289156626506) internal successors, (89), 83 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:15:27,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2022-04-28 04:15:27,406 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 84 [2022-04-28 04:15:27,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:15:27,406 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2022-04-28 04:15:27,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call 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:27,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 92 transitions. [2022-04-28 04:15:27,639 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:15:27,639 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2022-04-28 04:15:27,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 04:15:27,640 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:15:27,640 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, 1, 1, 1] [2022-04-28 04:15:27,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-28 04:15:27,640 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:15:27,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:15:27,648 INFO L85 PathProgramCache]: Analyzing trace with hash 659109720, now seen corresponding path program 29 times [2022-04-28 04:15:27,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:15:27,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [443077820] [2022-04-28 04:15:30,941 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:15:30,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:15:31,070 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:35,161 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:15:35,218 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:15:35,259 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:15:39,322 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:15:39,363 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:39,442 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:42,713 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:15:42,766 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:15:42,806 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:15:46,868 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:15:46,910 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:46,991 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,083 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:15:51,137 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:15:51,178 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:15:53,297 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:53,377 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,462 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:15:57,518 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:15:57,560 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:16:01,618 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:16:01,662 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:01,752 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:01,939 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:01,940 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:16:01,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1833630187, now seen corresponding path program 1 times [2022-04-28 04:16:01,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:16:01,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263399621] [2022-04-28 04:16:01,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:16:01,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:16:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:16:01,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:16:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:16:01,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {18235#(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); {18229#true} is VALID [2022-04-28 04:16:01,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {18229#true} assume true; {18229#true} is VALID [2022-04-28 04:16:01,967 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18229#true} {18229#true} #92#return; {18229#true} is VALID [2022-04-28 04:16:01,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {18229#true} call ULTIMATE.init(); {18235#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:16:01,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {18235#(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); {18229#true} is VALID [2022-04-28 04:16:01,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {18229#true} assume true; {18229#true} is VALID [2022-04-28 04:16:01,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18229#true} {18229#true} #92#return; {18229#true} is VALID [2022-04-28 04:16:01,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {18229#true} call #t~ret10 := main(); {18229#true} is VALID [2022-04-28 04:16:01,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {18229#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {18234#(= main_~a~0 0)} is VALID [2022-04-28 04:16:01,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {18234#(= main_~a~0 0)} [162] L23-3-->L23-4_primed: Formula: (and (= v_main_~b~0_279 v_main_~b~0_277) (= v_main_~d~0_444 v_main_~d~0_442) (= v_main_~e~0_2246 v_main_~e~0_2240) (= |v_main_#t~pre4_169| |v_main_#t~pre4_168|) (= v_main_~a~0_208 v_main_~a~0_207) (= |v_main_#t~pre5_202| |v_main_#t~pre5_201|) (= |v_main_#t~pre7_297| |v_main_#t~pre7_296|) (= |v_main_#t~pre9_3308| |v_main_#t~pre9_3283|) (= v_main_~f~0_4941 v_main_~f~0_4911) (= v_main_~c~0_366 v_main_~c~0_364) (= |v_main_#t~pre8_1878| |v_main_#t~pre8_1873|) (= |v_main_#t~pre6_253| |v_main_#t~pre6_252|)) InVars {main_~e~0=v_main_~e~0_2246, main_~d~0=v_main_~d~0_444, main_~b~0=v_main_~b~0_279, main_~f~0=v_main_~f~0_4941, main_#t~pre7=|v_main_#t~pre7_297|, main_~c~0=v_main_~c~0_366, main_#t~pre8=|v_main_#t~pre8_1878|, main_#t~pre9=|v_main_#t~pre9_3308|, 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_2240, main_~d~0=v_main_~d~0_442, main_~b~0=v_main_~b~0_277, main_~f~0=v_main_~f~0_4911, main_#t~pre7=|v_main_#t~pre7_296|, main_~c~0=v_main_~c~0_364, main_#t~pre8=|v_main_#t~pre8_1873|, main_#t~pre9=|v_main_#t~pre9_3283|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {18234#(= main_~a~0 0)} is VALID [2022-04-28 04:16:01,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {18234#(= main_~a~0 0)} [161] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {18230#false} is VALID [2022-04-28 04:16:01,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {18230#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {18230#false} is VALID [2022-04-28 04:16:01,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {18230#false} assume !false; {18230#false} is VALID [2022-04-28 04:16:01,969 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:01,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:16:01,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263399621] [2022-04-28 04:16:01,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263399621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:16:01,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:16:01,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:16:03,024 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:16:03,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [443077820] [2022-04-28 04:16:03,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [443077820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:16:03,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:16:03,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-28 04:16:03,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745931873] [2022-04-28 04:16:03,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:16:03,025 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 1 states have call successors, (2), 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 86 [2022-04-28 04:16:03,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:16:03,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 1 states have call successors, (2), 2 states have call 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:03,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:03,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-28 04:16:03,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:16:03,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-28 04:16:03,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1266, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 04:16:03,080 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 1 states have call successors, (2), 2 states have call 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:06,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:06,834 INFO L93 Difference]: Finished difference Result 137 states and 162 transitions. [2022-04-28 04:16:06,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-28 04:16:06,835 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 1 states have call successors, (2), 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 86 [2022-04-28 04:16:06,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:16:06,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 1 states have call successors, (2), 2 states have call 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:06,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 162 transitions. [2022-04-28 04:16:06,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 1 states have call successors, (2), 2 states have call 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:06,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 162 transitions. [2022-04-28 04:16:06,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 162 transitions. [2022-04-28 04:16:06,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:06,950 INFO L225 Difference]: With dead ends: 137 [2022-04-28 04:16:06,950 INFO L226 Difference]: Without dead ends: 122 [2022-04-28 04:16:06,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 39 SyntacticMatches, 11 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=642, Invalid=4908, Unknown=0, NotChecked=0, Total=5550 [2022-04-28 04:16:06,951 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 224 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 2231 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 2342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 2231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:16:06,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 55 Invalid, 2342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 2231 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 04:16:06,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-28 04:16:07,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 89. [2022-04-28 04:16:07,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:16:07,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 89 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 85 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:16:07,002 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 89 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 85 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:16:07,002 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 89 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 85 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:16:07,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:07,003 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2022-04-28 04:16:07,003 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2022-04-28 04:16:07,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:16:07,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:16:07,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 85 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 122 states. [2022-04-28 04:16:07,010 INFO L87 Difference]: Start difference. First operand has 89 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 85 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 122 states. [2022-04-28 04:16:07,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:07,011 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2022-04-28 04:16:07,011 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2022-04-28 04:16:07,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:16:07,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:16:07,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:16:07,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:16:07,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 85 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:16:07,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2022-04-28 04:16:07,013 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 86 [2022-04-28 04:16:07,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:16:07,013 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2022-04-28 04:16:07,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 1 states have call successors, (2), 2 states have call 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,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 94 transitions. [2022-04-28 04:16:07,258 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:16:07,259 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2022-04-28 04:16:07,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-28 04:16:07,259 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:16:07,259 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, 1, 1, 1] [2022-04-28 04:16:07,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-28 04:16:07,259 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:16:07,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:16:07,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1960058166, now seen corresponding path program 30 times [2022-04-28 04:16:07,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:16:07,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1592141547] [2022-04-28 04:16:11,491 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:16:11,531 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:11,610 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:15,711 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:16:15,772 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:16:15,827 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:16:19,893 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:16:19,938 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,029 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:22,679 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:16:22,749 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:16:22,789 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:16:26,849 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:16:26,893 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:26,979 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:31,081 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:16:31,145 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:16:31,187 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:16:33,752 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:16:33,794 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:33,874 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,968 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:16:38,029 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:16:38,072 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:16:40,292 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:16:40,334 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:40,414 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:40,604 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:40,604 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:16:40,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1833691691, now seen corresponding path program 1 times [2022-04-28 04:16:40,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:16:40,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920173676] [2022-04-28 04:16:40,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:16:40,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:16:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:16:40,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:16:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:16:40,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {19047#(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); {19041#true} is VALID [2022-04-28 04:16:40,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {19041#true} assume true; {19041#true} is VALID [2022-04-28 04:16:40,632 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19041#true} {19041#true} #92#return; {19041#true} is VALID [2022-04-28 04:16:40,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {19041#true} call ULTIMATE.init(); {19047#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:16:40,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {19047#(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); {19041#true} is VALID [2022-04-28 04:16:40,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {19041#true} assume true; {19041#true} is VALID [2022-04-28 04:16:40,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19041#true} {19041#true} #92#return; {19041#true} is VALID [2022-04-28 04:16:40,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {19041#true} call #t~ret10 := main(); {19041#true} is VALID [2022-04-28 04:16:40,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {19041#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {19046#(= main_~a~0 0)} is VALID [2022-04-28 04:16:40,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {19046#(= main_~a~0 0)} [164] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~f~0_5207 v_main_~f~0_5176)) (.cse1 (= v_main_~d~0_456 v_main_~d~0_454)) (.cse2 (= v_main_~a~0_214 v_main_~a~0_213)) (.cse3 (= v_main_~b~0_287 v_main_~b~0_285)) (.cse4 (= |v_main_#t~pre7_305| |v_main_#t~pre7_304|)) (.cse5 (= v_main_~c~0_376 v_main_~c~0_374)) (.cse6 (= |v_main_#t~pre9_3492| |v_main_#t~pre9_3466|)) (.cse7 (= |v_main_#t~pre5_208| |v_main_#t~pre5_207|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre8_1971| |v_main_#t~pre8_1966|) .cse5 .cse6 (= |v_main_#t~pre4_174| |v_main_#t~pre4_173|) (= v_main_~e~0_2351 v_main_~e~0_2345) .cse7 (= |v_main_#t~pre6_260| |v_main_#t~pre6_259|)) (and (= |v_main_#t~pre4_173| |v_main_#t~pre4_174|) .cse0 .cse1 .cse2 (= |v_main_#t~pre6_259| |v_main_#t~pre6_260|) .cse3 .cse4 .cse5 .cse6 (= v_main_~e~0_2345 v_main_~e~0_2351) .cse7 (= |v_main_#t~pre8_1966| |v_main_#t~pre8_1971|)))) InVars {main_~e~0=v_main_~e~0_2351, main_~d~0=v_main_~d~0_456, main_~b~0=v_main_~b~0_287, main_~f~0=v_main_~f~0_5207, main_#t~pre7=|v_main_#t~pre7_305|, main_~c~0=v_main_~c~0_376, main_#t~pre8=|v_main_#t~pre8_1971|, main_#t~pre9=|v_main_#t~pre9_3492|, 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_2345, main_~d~0=v_main_~d~0_454, main_~b~0=v_main_~b~0_285, main_~f~0=v_main_~f~0_5176, main_#t~pre7=|v_main_#t~pre7_304|, main_~c~0=v_main_~c~0_374, main_#t~pre8=|v_main_#t~pre8_1966|, main_#t~pre9=|v_main_#t~pre9_3466|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {19046#(= main_~a~0 0)} is VALID [2022-04-28 04:16:40,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {19046#(= main_~a~0 0)} [163] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {19042#false} is VALID [2022-04-28 04:16:40,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {19042#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {19042#false} is VALID [2022-04-28 04:16:40,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {19042#false} assume !false; {19042#false} is VALID [2022-04-28 04:16:40,634 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:40,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:16:40,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920173676] [2022-04-28 04:16:40,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920173676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:16:40,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:16:40,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:16:41,840 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:16:41,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1592141547] [2022-04-28 04:16:41,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1592141547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:16:41,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:16:41,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-28 04:16:41,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405155087] [2022-04-28 04:16:41,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:16:41,841 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 1 states have call successors, (2), 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 88 [2022-04-28 04:16:41,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:16:41,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 1 states have call successors, (2), 2 states have call 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:41,900 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:16:41,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-28 04:16:41,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:16:41,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-28 04:16:41,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1338, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 04:16:41,901 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 1 states have call successors, (2), 2 states have call 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,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:45,460 INFO L93 Difference]: Finished difference Result 139 states and 164 transitions. [2022-04-28 04:16:45,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 04:16:45,460 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 1 states have call successors, (2), 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 88 [2022-04-28 04:16:45,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:16:45,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 1 states have call successors, (2), 2 states have call 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,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 164 transitions. [2022-04-28 04:16:45,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 1 states have call successors, (2), 2 states have call 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,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 164 transitions. [2022-04-28 04:16:45,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 164 transitions. [2022-04-28 04:16:45,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:45,586 INFO L225 Difference]: With dead ends: 139 [2022-04-28 04:16:45,586 INFO L226 Difference]: Without dead ends: 124 [2022-04-28 04:16:45,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 36 SyntacticMatches, 15 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=660, Invalid=5192, Unknown=0, NotChecked=0, Total=5852 [2022-04-28 04:16:45,587 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 250 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 2066 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 2203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 2066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 04:16:45,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 40 Invalid, 2203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 2066 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 04:16:45,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-28 04:16:45,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 91. [2022-04-28 04:16:45,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:16:45,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 91 states, 87 states have (on average 1.0689655172413792) internal successors, (93), 87 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:16:45,641 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 91 states, 87 states have (on average 1.0689655172413792) internal successors, (93), 87 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:16:45,641 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 91 states, 87 states have (on average 1.0689655172413792) internal successors, (93), 87 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:16:45,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:45,642 INFO L93 Difference]: Finished difference Result 124 states and 143 transitions. [2022-04-28 04:16:45,642 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 143 transitions. [2022-04-28 04:16:45,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:16:45,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:16:45,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 87 states have (on average 1.0689655172413792) internal successors, (93), 87 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 124 states. [2022-04-28 04:16:45,643 INFO L87 Difference]: Start difference. First operand has 91 states, 87 states have (on average 1.0689655172413792) internal successors, (93), 87 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 124 states. [2022-04-28 04:16:45,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:45,644 INFO L93 Difference]: Finished difference Result 124 states and 143 transitions. [2022-04-28 04:16:45,644 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 143 transitions. [2022-04-28 04:16:45,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:16:45,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:16:45,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:16:45,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:16:45,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 87 states have (on average 1.0689655172413792) internal successors, (93), 87 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:16:45,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2022-04-28 04:16:45,645 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 88 [2022-04-28 04:16:45,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:16:45,645 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2022-04-28 04:16:45,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 1 states have call successors, (2), 2 states have call 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,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 96 transitions. [2022-04-28 04:16:45,894 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:16:45,894 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2022-04-28 04:16:45,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-28 04:16:45,894 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:16:45,895 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, 1, 1, 1] [2022-04-28 04:16:45,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-28 04:16:45,895 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:16:45,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:16:45,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1958935660, now seen corresponding path program 31 times [2022-04-28 04:16:45,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:16:45,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1679182605] [2022-04-28 04:16:46,154 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,234 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,256 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:16:46,256 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:16:46,285 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:16:46,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:16:46,455 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,477 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:16:46,477 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:16:46,507 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:16:46,607 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,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:16:46,715 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:16:46,715 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:16:46,745 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:16:46,834 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,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:16:46,946 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:16:46,946 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:16:46,976 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:16:47,075 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:47,153 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:47,340 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:47,340 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:16:47,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1833753195, now seen corresponding path program 1 times [2022-04-28 04:16:47,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:16:47,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620779373] [2022-04-28 04:16:47,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:16:47,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:16:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:16:47,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:16:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:16:47,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {19874#(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); {19868#true} is VALID [2022-04-28 04:16:47,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {19868#true} assume true; {19868#true} is VALID [2022-04-28 04:16:47,370 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19868#true} {19868#true} #92#return; {19868#true} is VALID [2022-04-28 04:16:47,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {19868#true} call ULTIMATE.init(); {19874#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:16:47,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {19874#(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); {19868#true} is VALID [2022-04-28 04:16:47,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {19868#true} assume true; {19868#true} is VALID [2022-04-28 04:16:47,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19868#true} {19868#true} #92#return; {19868#true} is VALID [2022-04-28 04:16:47,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {19868#true} call #t~ret10 := main(); {19868#true} is VALID [2022-04-28 04:16:47,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {19868#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {19873#(= main_~a~0 0)} is VALID [2022-04-28 04:16:47,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {19873#(= main_~a~0 0)} [166] L23-3-->L23-4_primed: Formula: (and (= |v_main_#t~pre5_214| |v_main_#t~pre5_213|) (= v_main_~f~0_5463 v_main_~f~0_5431) (= v_main_~d~0_468 v_main_~d~0_466) (= v_main_~e~0_2444 v_main_~e~0_2438) (= |v_main_#t~pre8_2048| |v_main_#t~pre8_2043|) (= |v_main_#t~pre4_179| |v_main_#t~pre4_178|) (= |v_main_#t~pre7_313| |v_main_#t~pre7_312|) (= v_main_~c~0_386 v_main_~c~0_384) (= |v_main_#t~pre9_3665| |v_main_#t~pre9_3638|) (= v_main_~a~0_220 v_main_~a~0_219) (= v_main_~b~0_295 v_main_~b~0_293) (= |v_main_#t~pre6_267| |v_main_#t~pre6_266|)) InVars {main_~e~0=v_main_~e~0_2444, main_~d~0=v_main_~d~0_468, main_~b~0=v_main_~b~0_295, main_~f~0=v_main_~f~0_5463, main_#t~pre7=|v_main_#t~pre7_313|, main_~c~0=v_main_~c~0_386, main_#t~pre8=|v_main_#t~pre8_2048|, main_#t~pre9=|v_main_#t~pre9_3665|, 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_2438, main_~d~0=v_main_~d~0_466, main_~b~0=v_main_~b~0_293, main_~f~0=v_main_~f~0_5431, main_#t~pre7=|v_main_#t~pre7_312|, main_~c~0=v_main_~c~0_384, main_#t~pre8=|v_main_#t~pre8_2043|, main_#t~pre9=|v_main_#t~pre9_3638|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {19873#(= main_~a~0 0)} is VALID [2022-04-28 04:16:47,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {19873#(= main_~a~0 0)} [165] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {19869#false} is VALID [2022-04-28 04:16:47,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {19869#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {19869#false} is VALID [2022-04-28 04:16:47,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {19869#false} assume !false; {19869#false} is VALID [2022-04-28 04:16:47,373 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,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:16:47,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620779373] [2022-04-28 04:16:47,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620779373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:16:47,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:16:47,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:16:48,610 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:16:48,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1679182605] [2022-04-28 04:16:48,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1679182605] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:16:48,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:16:48,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-28 04:16:48,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075919962] [2022-04-28 04:16:48,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:16:48,611 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 states have internal predecessors, (87), 1 states have call successors, (2), 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 90 [2022-04-28 04:16:48,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:16:48,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 states have internal predecessors, (87), 1 states have call successors, (2), 2 states have call 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,673 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:16:48,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-28 04:16:48,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:16:48,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-28 04:16:48,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1412, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 04:16:48,674 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 states have internal predecessors, (87), 1 states have call successors, (2), 2 states have call 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:52,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:52,521 INFO L93 Difference]: Finished difference Result 141 states and 166 transitions. [2022-04-28 04:16:52,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-28 04:16:52,522 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 states have internal predecessors, (87), 1 states have call successors, (2), 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 90 [2022-04-28 04:16:52,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:16:52,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 states have internal predecessors, (87), 1 states have call successors, (2), 2 states have call 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:52,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 166 transitions. [2022-04-28 04:16:52,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 states have internal predecessors, (87), 1 states have call successors, (2), 2 states have call 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:52,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 166 transitions. [2022-04-28 04:16:52,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 166 transitions. [2022-04-28 04:16:52,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:52,645 INFO L225 Difference]: With dead ends: 141 [2022-04-28 04:16:52,645 INFO L226 Difference]: Without dead ends: 126 [2022-04-28 04:16:52,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 38 SyntacticMatches, 14 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=678, Invalid=5484, Unknown=0, NotChecked=0, Total=6162 [2022-04-28 04:16:52,646 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 228 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 2359 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 2481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:16:52,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 45 Invalid, 2481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2359 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 04:16:52,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-04-28 04:16:52,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 93. [2022-04-28 04:16:52,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:16:52,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 93 states, 89 states have (on average 1.0674157303370786) internal successors, (95), 89 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call 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:52,711 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 93 states, 89 states have (on average 1.0674157303370786) internal successors, (95), 89 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call 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:52,711 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 93 states, 89 states have (on average 1.0674157303370786) internal successors, (95), 89 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call 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:52,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:52,712 INFO L93 Difference]: Finished difference Result 126 states and 145 transitions. [2022-04-28 04:16:52,712 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 145 transitions. [2022-04-28 04:16:52,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:16:52,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:16:52,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 89 states have (on average 1.0674157303370786) internal successors, (95), 89 states have internal predecessors, (95), 2 states have call successors, (2), 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 126 states. [2022-04-28 04:16:52,712 INFO L87 Difference]: Start difference. First operand has 93 states, 89 states have (on average 1.0674157303370786) internal successors, (95), 89 states have internal predecessors, (95), 2 states have call successors, (2), 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 126 states. [2022-04-28 04:16:52,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:52,713 INFO L93 Difference]: Finished difference Result 126 states and 145 transitions. [2022-04-28 04:16:52,713 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 145 transitions. [2022-04-28 04:16:52,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:16:52,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:16:52,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:16:52,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:16:52,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 89 states have (on average 1.0674157303370786) internal successors, (95), 89 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call 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:52,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2022-04-28 04:16:52,715 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 90 [2022-04-28 04:16:52,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:16:52,715 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2022-04-28 04:16:52,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 states have internal predecessors, (87), 1 states have call successors, (2), 2 states have call 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:52,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 98 transitions. [2022-04-28 04:16:52,977 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:16:52,978 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-04-28 04:16:52,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-28 04:16:52,978 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:16:52,978 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, 1, 1, 1] [2022-04-28 04:16:52,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-28 04:16:52,978 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:16:52,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:16:52,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1425683854, now seen corresponding path program 32 times [2022-04-28 04:16:52,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:16:52,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [99249540] [2022-04-28 04:16:53,252 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:53,333 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:53,355 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:16:53,355 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:16:53,384 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:16:53,479 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:53,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:16:53,585 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:16:53,585 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:16:53,615 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:16:53,710 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:53,790 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:53,813 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:16:53,813 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:16:53,843 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:16:53,941 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:54,022 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:54,044 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:16:54,044 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:16:54,073 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:16:54,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:16:54,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:16:54,439 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:54,439 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:16:54,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1833814699, now seen corresponding path program 1 times [2022-04-28 04:16:54,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:16:54,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852572571] [2022-04-28 04:16:54,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:16:54,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:16:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:16:54,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:16:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:16:54,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {20716#(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); {20710#true} is VALID [2022-04-28 04:16:54,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {20710#true} assume true; {20710#true} is VALID [2022-04-28 04:16:54,488 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20710#true} {20710#true} #92#return; {20710#true} is VALID [2022-04-28 04:16:54,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {20710#true} call ULTIMATE.init(); {20716#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:16:54,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {20716#(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); {20710#true} is VALID [2022-04-28 04:16:54,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {20710#true} assume true; {20710#true} is VALID [2022-04-28 04:16:54,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20710#true} {20710#true} #92#return; {20710#true} is VALID [2022-04-28 04:16:54,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {20710#true} call #t~ret10 := main(); {20710#true} is VALID [2022-04-28 04:16:54,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {20710#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {20715#(= main_~a~0 0)} is VALID [2022-04-28 04:16:54,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {20715#(= main_~a~0 0)} [168] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_226 v_main_~a~0_225)) (.cse1 (= v_main_~f~0_5725 v_main_~f~0_5692)) (.cse2 (= v_main_~d~0_480 v_main_~d~0_478)) (.cse3 (= |v_main_#t~pre8_2125| |v_main_#t~pre8_2120|)) (.cse4 (= |v_main_#t~pre7_321| |v_main_#t~pre7_320|)) (.cse5 (= |v_main_#t~pre6_274| |v_main_#t~pre6_273|)) (.cse6 (= |v_main_#t~pre9_3843| |v_main_#t~pre9_3815|)) (.cse7 (= |v_main_#t~pre4_184| |v_main_#t~pre4_183|)) (.cse8 (= v_main_~b~0_303 v_main_~b~0_301)) (.cse9 (= v_main_~c~0_396 v_main_~c~0_394))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~pre5_220| |v_main_#t~pre5_219|) .cse3 .cse4 .cse5 .cse6 .cse7 (= v_main_~e~0_2537 v_main_~e~0_2531) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre5_219| |v_main_#t~pre5_220|) .cse5 (= v_main_~e~0_2531 v_main_~e~0_2537) .cse6 .cse7 .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_2537, main_~d~0=v_main_~d~0_480, main_~b~0=v_main_~b~0_303, main_~f~0=v_main_~f~0_5725, main_#t~pre7=|v_main_#t~pre7_321|, main_~c~0=v_main_~c~0_396, main_#t~pre8=|v_main_#t~pre8_2125|, main_#t~pre9=|v_main_#t~pre9_3843|, 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_2531, main_~d~0=v_main_~d~0_478, main_~b~0=v_main_~b~0_301, main_~f~0=v_main_~f~0_5692, main_#t~pre7=|v_main_#t~pre7_320|, main_~c~0=v_main_~c~0_394, main_#t~pre8=|v_main_#t~pre8_2120|, main_#t~pre9=|v_main_#t~pre9_3815|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {20715#(= main_~a~0 0)} is VALID [2022-04-28 04:16:54,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {20715#(= main_~a~0 0)} [167] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {20711#false} is VALID [2022-04-28 04:16:54,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {20711#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {20711#false} is VALID [2022-04-28 04:16:54,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {20711#false} assume !false; {20711#false} is VALID [2022-04-28 04:16:54,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:54,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:16:54,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852572571] [2022-04-28 04:16:54,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852572571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:16:54,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:16:54,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:16:55,840 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:16:55,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [99249540] [2022-04-28 04:16:55,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [99249540] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:16:55,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:16:55,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-28 04:16:55,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476882075] [2022-04-28 04:16:55,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:16:55,841 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 states have internal predecessors, (89), 1 states have call successors, (2), 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 92 [2022-04-28 04:16:55,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:16:55,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 states have internal predecessors, (89), 1 states have call successors, (2), 2 states have call 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,899 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:16:55,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-28 04:16:55,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:16:55,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-28 04:16:55,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1488, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 04:16:55,900 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 states have internal predecessors, (89), 1 states have call successors, (2), 2 states have call 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,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:59,903 INFO L93 Difference]: Finished difference Result 143 states and 168 transitions. [2022-04-28 04:16:59,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-28 04:16:59,903 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 states have internal predecessors, (89), 1 states have call successors, (2), 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 92 [2022-04-28 04:16:59,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:16:59,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 states have internal predecessors, (89), 1 states have call successors, (2), 2 states have call 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,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 168 transitions. [2022-04-28 04:16:59,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 states have internal predecessors, (89), 1 states have call successors, (2), 2 states have call 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,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 168 transitions. [2022-04-28 04:16:59,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 168 transitions. [2022-04-28 04:17:00,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:17:00,078 INFO L225 Difference]: With dead ends: 143 [2022-04-28 04:17:00,078 INFO L226 Difference]: Without dead ends: 128 [2022-04-28 04:17:00,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 34 SyntacticMatches, 19 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=696, Invalid=5784, Unknown=0, NotChecked=0, Total=6480 [2022-04-28 04:17:00,085 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 200 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 2463 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 2552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 2463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 04:17:00,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 45 Invalid, 2552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 2463 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 04:17:00,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-28 04:17:00,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2022-04-28 04:17:00,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:17:00,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 95 states, 91 states have (on average 1.065934065934066) internal successors, (97), 91 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:17:00,155 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 95 states, 91 states have (on average 1.065934065934066) internal successors, (97), 91 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:17:00,156 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 95 states, 91 states have (on average 1.065934065934066) internal successors, (97), 91 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:17:00,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:00,157 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions. [2022-04-28 04:17:00,157 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 147 transitions. [2022-04-28 04:17:00,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:17:00,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:17:00,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 91 states have (on average 1.065934065934066) internal successors, (97), 91 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 128 states. [2022-04-28 04:17:00,157 INFO L87 Difference]: Start difference. First operand has 95 states, 91 states have (on average 1.065934065934066) internal successors, (97), 91 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 128 states. [2022-04-28 04:17:00,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:00,158 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions. [2022-04-28 04:17:00,158 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 147 transitions. [2022-04-28 04:17:00,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:17:00,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:17:00,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:17:00,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:17:00,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 91 states have (on average 1.065934065934066) internal successors, (97), 91 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:17:00,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2022-04-28 04:17:00,159 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 92 [2022-04-28 04:17:00,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:17:00,160 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2022-04-28 04:17:00,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 states have internal predecessors, (89), 1 states have call successors, (2), 2 states have call 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:00,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 100 transitions. [2022-04-28 04:17:00,470 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:17:00,470 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2022-04-28 04:17:00,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-28 04:17:00,472 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:17:00,472 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, 1, 1, 1] [2022-04-28 04:17:00,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-04-28 04:17:00,472 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:17:00,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:17:00,472 INFO L85 PathProgramCache]: Analyzing trace with hash -71806512, now seen corresponding path program 33 times [2022-04-28 04:17:00,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:17:00,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1356744624] [2022-04-28 04:17:02,740 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:17:02,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:17:02,881 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:02,904 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:17:02,904 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:17:02,934 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:17:07,006 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:17:07,056 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,142 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,165 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:17:07,165 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:17:07,195 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:17:10,163 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:17:10,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:17:10,300 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:10,323 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:17:10,324 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:17:10,354 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:17:14,421 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:17:14,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:17:14,556 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:14,580 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:17:14,580 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:17:14,611 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:17:16,694 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:17:16,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:17:16,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:17:17,021 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:17,021 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:17:17,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1833876203, now seen corresponding path program 1 times [2022-04-28 04:17:17,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:17:17,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090609589] [2022-04-28 04:17:17,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:17:17,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:17:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:17:17,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:17:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:17:17,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {21573#(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); {21567#true} is VALID [2022-04-28 04:17:17,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {21567#true} assume true; {21567#true} is VALID [2022-04-28 04:17:17,061 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21567#true} {21567#true} #92#return; {21567#true} is VALID [2022-04-28 04:17:17,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {21567#true} call ULTIMATE.init(); {21573#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:17:17,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {21573#(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); {21567#true} is VALID [2022-04-28 04:17:17,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {21567#true} assume true; {21567#true} is VALID [2022-04-28 04:17:17,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21567#true} {21567#true} #92#return; {21567#true} is VALID [2022-04-28 04:17:17,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {21567#true} call #t~ret10 := main(); {21567#true} is VALID [2022-04-28 04:17:17,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {21567#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {21572#(= main_~a~0 0)} is VALID [2022-04-28 04:17:17,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {21572#(= main_~a~0 0)} [170] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~f~0_5993 v_main_~f~0_5959)) (.cse1 (= |v_main_#t~pre8_2202| |v_main_#t~pre8_2197|)) (.cse2 (= |v_main_#t~pre5_226| |v_main_#t~pre5_225|)) (.cse3 (= |v_main_#t~pre6_281| |v_main_#t~pre6_280|)) (.cse4 (= |v_main_#t~pre7_329| |v_main_#t~pre7_328|)) (.cse5 (= v_main_~d~0_492 v_main_~d~0_490)) (.cse6 (= v_main_~a~0_232 v_main_~a~0_231)) (.cse7 (= |v_main_#t~pre4_189| |v_main_#t~pre4_188|)) (.cse8 (= v_main_~c~0_406 v_main_~c~0_404))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre9_3997| |v_main_#t~pre9_4026|) .cse5 .cse6 .cse7 .cse8 (= v_main_~b~0_309 v_main_~b~0_311) (= v_main_~e~0_2624 v_main_~e~0_2630)) (and (= v_main_~b~0_311 v_main_~b~0_309) .cse0 (= |v_main_#t~pre9_4026| |v_main_#t~pre9_3997|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= v_main_~e~0_2630 v_main_~e~0_2624)))) InVars {main_~e~0=v_main_~e~0_2630, main_~d~0=v_main_~d~0_492, main_~b~0=v_main_~b~0_311, main_~f~0=v_main_~f~0_5993, main_#t~pre7=|v_main_#t~pre7_329|, main_~c~0=v_main_~c~0_406, main_#t~pre8=|v_main_#t~pre8_2202|, main_#t~pre9=|v_main_#t~pre9_4026|, 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_2624, main_~d~0=v_main_~d~0_490, main_~b~0=v_main_~b~0_309, main_~f~0=v_main_~f~0_5959, main_#t~pre7=|v_main_#t~pre7_328|, main_~c~0=v_main_~c~0_404, main_#t~pre8=|v_main_#t~pre8_2197|, main_#t~pre9=|v_main_#t~pre9_3997|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {21572#(= main_~a~0 0)} is VALID [2022-04-28 04:17:17,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {21572#(= main_~a~0 0)} [169] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {21568#false} is VALID [2022-04-28 04:17:17,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {21568#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {21568#false} is VALID [2022-04-28 04:17:17,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {21568#false} assume !false; {21568#false} is VALID [2022-04-28 04:17:17,063 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:17,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:17:17,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090609589] [2022-04-28 04:17:17,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090609589] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:17:17,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:17:17,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:17:18,479 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:17:18,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1356744624] [2022-04-28 04:17:18,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1356744624] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:17:18,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:17:18,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-28 04:17:18,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679222164] [2022-04-28 04:17:18,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:17:18,481 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 states have internal predecessors, (91), 1 states have call successors, (2), 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 94 [2022-04-28 04:17:18,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:17:18,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 states have internal predecessors, (91), 1 states have call successors, (2), 2 states have call 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:18,543 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:17:18,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-28 04:17:18,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:17:18,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-28 04:17:18,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1566, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 04:17:18,544 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 states have internal predecessors, (91), 1 states have call successors, (2), 2 states have call 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:23,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:23,006 INFO L93 Difference]: Finished difference Result 147 states and 173 transitions. [2022-04-28 04:17:23,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-28 04:17:23,006 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 states have internal predecessors, (91), 1 states have call successors, (2), 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 94 [2022-04-28 04:17:23,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:17:23,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 states have internal predecessors, (91), 1 states have call successors, (2), 2 states have call 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:23,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 173 transitions. [2022-04-28 04:17:23,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 states have internal predecessors, (91), 1 states have call successors, (2), 2 states have call 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:23,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 173 transitions. [2022-04-28 04:17:23,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 173 transitions. [2022-04-28 04:17:23,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:17:23,128 INFO L225 Difference]: With dead ends: 147 [2022-04-28 04:17:23,128 INFO L226 Difference]: Without dead ends: 132 [2022-04-28 04:17:23,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 34 SyntacticMatches, 20 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1259 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=714, Invalid=6092, Unknown=0, NotChecked=0, Total=6806 [2022-04-28 04:17:23,129 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 243 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 2720 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 2848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 2720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 04:17:23,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 50 Invalid, 2848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 2720 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 04:17:23,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-28 04:17:23,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 99. [2022-04-28 04:17:23,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:17:23,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 99 states, 95 states have (on average 1.063157894736842) internal successors, (101), 95 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call 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:23,193 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 99 states, 95 states have (on average 1.063157894736842) internal successors, (101), 95 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call 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:23,193 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 99 states, 95 states have (on average 1.063157894736842) internal successors, (101), 95 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call 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:23,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:23,194 INFO L93 Difference]: Finished difference Result 132 states and 151 transitions. [2022-04-28 04:17:23,194 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 151 transitions. [2022-04-28 04:17:23,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:17:23,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:17:23,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 95 states have (on average 1.063157894736842) internal successors, (101), 95 states have internal predecessors, (101), 2 states have call successors, (2), 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:23,195 INFO L87 Difference]: Start difference. First operand has 99 states, 95 states have (on average 1.063157894736842) internal successors, (101), 95 states have internal predecessors, (101), 2 states have call successors, (2), 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:23,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:23,196 INFO L93 Difference]: Finished difference Result 132 states and 151 transitions. [2022-04-28 04:17:23,196 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 151 transitions. [2022-04-28 04:17:23,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:17:23,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:17:23,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:17:23,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:17:23,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.063157894736842) internal successors, (101), 95 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call 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:23,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2022-04-28 04:17:23,197 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 94 [2022-04-28 04:17:23,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:17:23,197 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2022-04-28 04:17:23,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 states have internal predecessors, (91), 1 states have call successors, (2), 2 states have call 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:23,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 104 transitions. [2022-04-28 04:17:23,488 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:17:23,488 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2022-04-28 04:17:23,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-28 04:17:23,489 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:17:23,489 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, 1, 1, 1] [2022-04-28 04:17:23,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-04-28 04:17:23,489 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:17:23,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:17:23,489 INFO L85 PathProgramCache]: Analyzing trace with hash -370771538, now seen corresponding path program 34 times [2022-04-28 04:17:23,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:17:23,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [121568972] [2022-04-28 04:17:27,716 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:17:27,760 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:27,844 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:27,867 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:17:27,867 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:17:31,932 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:17:31,973 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,055 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:32,077 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:17:32,077 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:17:36,141 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:17:36,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:17:36,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:17:36,299 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:17:36,299 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:17:38,868 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:38,967 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:38,995 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:17:38,995 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:17:43,063 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:17:43,105 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:43,187 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:43,390 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:43,390 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:17:43,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1833937707, now seen corresponding path program 1 times [2022-04-28 04:17:43,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:17:43,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663326424] [2022-04-28 04:17:43,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:17:43,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:17:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:17:43,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:17:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:17:43,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {22457#(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); {22451#true} is VALID [2022-04-28 04:17:43,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {22451#true} assume true; {22451#true} is VALID [2022-04-28 04:17:43,410 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22451#true} {22451#true} #92#return; {22451#true} is VALID [2022-04-28 04:17:43,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {22451#true} call ULTIMATE.init(); {22457#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:17:43,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {22457#(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); {22451#true} is VALID [2022-04-28 04:17:43,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {22451#true} assume true; {22451#true} is VALID [2022-04-28 04:17:43,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22451#true} {22451#true} #92#return; {22451#true} is VALID [2022-04-28 04:17:43,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {22451#true} call #t~ret10 := main(); {22451#true} is VALID [2022-04-28 04:17:43,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {22451#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {22456#(= main_~a~0 0)} is VALID [2022-04-28 04:17:43,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {22456#(= main_~a~0 0)} [172] L23-3-->L23-4_primed: Formula: (and (= |v_main_#t~pre5_232| |v_main_#t~pre5_231|) (= v_main_~d~0_504 v_main_~d~0_502) (= v_main_~b~0_319 v_main_~b~0_317) (= v_main_~f~0_6240 v_main_~f~0_6205) (= |v_main_#t~pre8_2258| |v_main_#t~pre8_2253|) (= v_main_~a~0_238 v_main_~a~0_237) (= |v_main_#t~pre4_194| |v_main_#t~pre4_193|) (= v_main_~c~0_416 v_main_~c~0_414) (= |v_main_#t~pre7_337| |v_main_#t~pre7_336|) (= |v_main_#t~pre6_288| |v_main_#t~pre6_287|) (= v_main_~e~0_2701 v_main_~e~0_2695) (= |v_main_#t~pre9_4188| |v_main_#t~pre9_4158|)) InVars {main_~e~0=v_main_~e~0_2701, main_~d~0=v_main_~d~0_504, main_~b~0=v_main_~b~0_319, main_~f~0=v_main_~f~0_6240, main_#t~pre7=|v_main_#t~pre7_337|, main_~c~0=v_main_~c~0_416, main_#t~pre8=|v_main_#t~pre8_2258|, main_#t~pre9=|v_main_#t~pre9_4188|, 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_2695, main_~d~0=v_main_~d~0_502, main_~b~0=v_main_~b~0_317, main_~f~0=v_main_~f~0_6205, main_#t~pre7=|v_main_#t~pre7_336|, main_~c~0=v_main_~c~0_414, main_#t~pre8=|v_main_#t~pre8_2253|, main_#t~pre9=|v_main_#t~pre9_4158|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {22456#(= main_~a~0 0)} is VALID [2022-04-28 04:17:43,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {22456#(= main_~a~0 0)} [171] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {22452#false} is VALID [2022-04-28 04:17:43,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {22452#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {22452#false} is VALID [2022-04-28 04:17:43,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {22452#false} assume !false; {22452#false} is VALID [2022-04-28 04:17:43,412 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:43,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:17:43,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663326424] [2022-04-28 04:17:43,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663326424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:17:43,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:17:43,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:17:44,762 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:17:44,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [121568972] [2022-04-28 04:17:44,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [121568972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:17:44,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:17:44,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-28 04:17:44,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670432251] [2022-04-28 04:17:44,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:17:44,763 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:17:44,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:17:44,763 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:17:44,825 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:17:44,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-28 04:17:44,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:17:44,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-28 04:17:44,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1646, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 04:17:44,826 INFO L87 Difference]: Start difference. First operand 99 states and 104 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:17:49,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:49,162 INFO L93 Difference]: Finished difference Result 148 states and 173 transitions. [2022-04-28 04:17:49,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-28 04:17:49,162 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:17:49,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:17:49,163 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:17:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 173 transitions. [2022-04-28 04:17:49,164 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:17:49,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 173 transitions. [2022-04-28 04:17:49,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 173 transitions. [2022-04-28 04:17:49,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:17:49,282 INFO L225 Difference]: With dead ends: 148 [2022-04-28 04:17:49,282 INFO L226 Difference]: Without dead ends: 133 [2022-04-28 04:17:49,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 39 SyntacticMatches, 16 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1277 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=732, Invalid=6408, Unknown=0, NotChecked=0, Total=7140 [2022-04-28 04:17:49,283 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 220 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2702 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 2824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-28 04:17:49,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 90 Invalid, 2824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2702 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-28 04:17:49,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-28 04:17:49,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 101. [2022-04-28 04:17:49,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:17:49,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 101 states, 97 states have (on average 1.0618556701030928) internal successors, (103), 97 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call 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,353 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 101 states, 97 states have (on average 1.0618556701030928) internal successors, (103), 97 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call 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,353 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 101 states, 97 states have (on average 1.0618556701030928) internal successors, (103), 97 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call 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,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:49,354 INFO L93 Difference]: Finished difference Result 133 states and 152 transitions. [2022-04-28 04:17:49,354 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2022-04-28 04:17:49,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:17:49,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:17:49,354 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 97 states have (on average 1.0618556701030928) internal successors, (103), 97 states have internal predecessors, (103), 2 states have call successors, (2), 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:17:49,355 INFO L87 Difference]: Start difference. First operand has 101 states, 97 states have (on average 1.0618556701030928) internal successors, (103), 97 states have internal predecessors, (103), 2 states have call successors, (2), 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:17:49,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:49,356 INFO L93 Difference]: Finished difference Result 133 states and 152 transitions. [2022-04-28 04:17:49,356 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2022-04-28 04:17:49,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:17:49,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:17:49,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:17:49,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:17:49,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 97 states have (on average 1.0618556701030928) internal successors, (103), 97 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call 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,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2022-04-28 04:17:49,357 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 96 [2022-04-28 04:17:49,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:17:49,357 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2022-04-28 04:17:49,357 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:17:49,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 106 transitions. [2022-04-28 04:17:49,650 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:17:49,651 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2022-04-28 04:17:49,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 04:17:49,651 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:17:49,651 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, 1, 1, 1] [2022-04-28 04:17:49,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-04-28 04:17:49,651 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:17:49,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:17:49,651 INFO L85 PathProgramCache]: Analyzing trace with hash 120569351, now seen corresponding path program 35 times [2022-04-28 04:17:49,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:17:49,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1449050677] [2022-04-28 04:17:49,943 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:50,022 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:50,044 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:17:50,044 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:17:50,068 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:50,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:17:50,240 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:50,261 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:17:50,261 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:17:50,286 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:50,381 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:50,461 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:50,483 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:17:50,483 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:17:50,508 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:50,611 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:50,688 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:50,710 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:17:50,710 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:17:50,735 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:50,830 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:50,911 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,125 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:51,125 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:17:51,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1833999211, now seen corresponding path program 1 times [2022-04-28 04:17:51,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:17:51,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167474297] [2022-04-28 04:17:51,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:17:51,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:17:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:17:51,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:17:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:17:51,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {23352#(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); {23346#true} is VALID [2022-04-28 04:17:51,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {23346#true} assume true; {23346#true} is VALID [2022-04-28 04:17:51,153 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23346#true} {23346#true} #92#return; {23346#true} is VALID [2022-04-28 04:17:51,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {23346#true} call ULTIMATE.init(); {23352#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:17:51,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {23352#(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); {23346#true} is VALID [2022-04-28 04:17:51,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {23346#true} assume true; {23346#true} is VALID [2022-04-28 04:17:51,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23346#true} {23346#true} #92#return; {23346#true} is VALID [2022-04-28 04:17:51,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {23346#true} call #t~ret10 := main(); {23346#true} is VALID [2022-04-28 04:17:51,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {23346#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {23351#(= main_~a~0 0)} is VALID [2022-04-28 04:17:51,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {23351#(= main_~a~0 0)} [174] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_238| |v_main_#t~pre5_237|)) (.cse1 (= |v_main_#t~pre4_199| |v_main_#t~pre4_198|)) (.cse2 (= |v_main_#t~pre7_345| |v_main_#t~pre7_344|)) (.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_#t~pre9_4350| |v_main_#t~pre9_4320|)) (.cse6 (= v_main_~e~0_2799 v_main_~e~0_2792)) (.cse7 (= v_main_~b~0_327 v_main_~b~0_325)) (.cse8 (= v_main_~f~0_6513 v_main_~f~0_6477)) (.cse9 (= v_main_~c~0_426 v_main_~c~0_424))) (or (and .cse0 .cse1 (= |v_main_#t~pre8_2339| |v_main_#t~pre8_2333|) .cse2 .cse3 .cse4 (= v_main_~d~0_516 v_main_~d~0_514) .cse5 .cse6 .cse7 .cse8 .cse9) (and (= |v_main_#t~pre8_2333| |v_main_#t~pre8_2339|) (= v_main_~d~0_514 v_main_~d~0_516) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_2799, main_~d~0=v_main_~d~0_516, main_~b~0=v_main_~b~0_327, main_~f~0=v_main_~f~0_6513, main_#t~pre7=|v_main_#t~pre7_345|, main_~c~0=v_main_~c~0_426, main_#t~pre8=|v_main_#t~pre8_2339|, main_#t~pre9=|v_main_#t~pre9_4350|, 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_2792, main_~d~0=v_main_~d~0_514, main_~b~0=v_main_~b~0_325, main_~f~0=v_main_~f~0_6477, main_#t~pre7=|v_main_#t~pre7_344|, main_~c~0=v_main_~c~0_424, main_#t~pre8=|v_main_#t~pre8_2333|, main_#t~pre9=|v_main_#t~pre9_4320|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {23351#(= main_~a~0 0)} is VALID [2022-04-28 04:17:51,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {23351#(= main_~a~0 0)} [173] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {23347#false} is VALID [2022-04-28 04:17:51,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {23347#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {23347#false} is VALID [2022-04-28 04:17:51,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {23347#false} assume !false; {23347#false} is VALID [2022-04-28 04:17:51,156 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:51,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:17:51,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167474297] [2022-04-28 04:17:51,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167474297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:17:51,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:17:51,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:17:52,672 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:17:52,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1449050677] [2022-04-28 04:17:52,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1449050677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:17:52,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:17:52,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-28 04:17:52,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843710335] [2022-04-28 04:17:52,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:17:52,673 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 44 states have internal predecessors, (96), 1 states have call successors, (2), 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 99 [2022-04-28 04:17:52,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:17:52,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 44 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call 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:52,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:17:52,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-28 04:17:52,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:17:52,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-28 04:17:52,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1728, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 04:17:52,742 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 45 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 44 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call 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:57,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:57,517 INFO L93 Difference]: Finished difference Result 150 states and 175 transitions. [2022-04-28 04:17:57,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-28 04:17:57,517 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 44 states have internal predecessors, (96), 1 states have call successors, (2), 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 99 [2022-04-28 04:17:57,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:17:57,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 44 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call 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:57,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 175 transitions. [2022-04-28 04:17:57,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 44 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call 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:57,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 175 transitions. [2022-04-28 04:17:57,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 175 transitions. [2022-04-28 04:17:57,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:17:57,638 INFO L225 Difference]: With dead ends: 150 [2022-04-28 04:17:57,639 INFO L226 Difference]: Without dead ends: 135 [2022-04-28 04:17:57,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 35 SyntacticMatches, 22 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1373 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=750, Invalid=6732, Unknown=0, NotChecked=0, Total=7482 [2022-04-28 04:17:57,639 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 244 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2925 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 3057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 2925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:17:57,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 25 Invalid, 3057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 2925 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 04:17:57,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-28 04:17:57,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 102. [2022-04-28 04:17:57,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:17:57,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 102 states, 98 states have (on average 1.0612244897959184) internal successors, (104), 98 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:17:57,712 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 102 states, 98 states have (on average 1.0612244897959184) internal successors, (104), 98 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:17:57,712 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 102 states, 98 states have (on average 1.0612244897959184) internal successors, (104), 98 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:17:57,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:57,713 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2022-04-28 04:17:57,713 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 154 transitions. [2022-04-28 04:17:57,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:17:57,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:17:57,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 98 states have (on average 1.0612244897959184) internal successors, (104), 98 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 135 states. [2022-04-28 04:17:57,714 INFO L87 Difference]: Start difference. First operand has 102 states, 98 states have (on average 1.0612244897959184) internal successors, (104), 98 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 135 states. [2022-04-28 04:17:57,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:57,715 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2022-04-28 04:17:57,715 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 154 transitions. [2022-04-28 04:17:57,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:17:57,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:17:57,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:17:57,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:17:57,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 98 states have (on average 1.0612244897959184) internal successors, (104), 98 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:17:57,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2022-04-28 04:17:57,716 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 99 [2022-04-28 04:17:57,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:17:57,717 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2022-04-28 04:17:57,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 44 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call 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:57,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 107 transitions. [2022-04-28 04:17:58,026 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:17:58,026 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2022-04-28 04:17:58,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 04:17:58,026 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:17:58,026 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, 1, 1, 1] [2022-04-28 04:17:58,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-04-28 04:17:58,026 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:17:58,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:17:58,027 INFO L85 PathProgramCache]: Analyzing trace with hash -181160923, now seen corresponding path program 36 times [2022-04-28 04:17:58,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:17:58,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [701942707] [2022-04-28 04:18:02,255 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:18:02,302 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:02,383 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:02,519 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:18:02,560 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:18:06,632 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:18:06,680 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:06,762 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:06,908 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:18:06,948 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:18:11,015 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:18:11,065 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:11,150 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:11,308 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:18:11,347 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:18:15,411 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:18:15,459 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:15,539 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:15,676 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:18:15,714 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:18:19,779 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:18:19,826 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:19,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:18:20,126 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:20,126 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:18:20,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1834060715, now seen corresponding path program 1 times [2022-04-28 04:18:20,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:18:20,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693174259] [2022-04-28 04:18:20,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:18:20,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:18:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:18:20,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:18:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:18:20,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {24260#(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); {24254#true} is VALID [2022-04-28 04:18:20,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {24254#true} assume true; {24254#true} is VALID [2022-04-28 04:18:20,152 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24254#true} {24254#true} #92#return; {24254#true} is VALID [2022-04-28 04:18:20,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {24254#true} call ULTIMATE.init(); {24260#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:18:20,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {24260#(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); {24254#true} is VALID [2022-04-28 04:18:20,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {24254#true} assume true; {24254#true} is VALID [2022-04-28 04:18:20,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24254#true} {24254#true} #92#return; {24254#true} is VALID [2022-04-28 04:18:20,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {24254#true} call #t~ret10 := main(); {24254#true} is VALID [2022-04-28 04:18:20,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {24254#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {24259#(= main_~a~0 0)} is VALID [2022-04-28 04:18:20,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {24259#(= main_~a~0 0)} [176] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~e~0_2909 v_main_~e~0_2902)) (.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_~f~0_6808 v_main_~f~0_6771)) (.cse4 (= |v_main_#t~pre9_4553| |v_main_#t~pre9_4522|)) (.cse5 (= v_main_~c~0_436 v_main_~c~0_434)) (.cse6 (= |v_main_#t~pre7_353| |v_main_#t~pre7_352|)) (.cse7 (= |v_main_#t~pre5_244| |v_main_#t~pre5_243|)) (.cse8 (= |v_main_#t~pre8_2436| |v_main_#t~pre8_2430|)) (.cse9 (= |v_main_#t~pre4_204| |v_main_#t~pre4_203|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~d~0_526 v_main_~d~0_528) (= v_main_~a~0_249 v_main_~a~0_250) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= v_main_~d~0_528 v_main_~d~0_526) .cse8 .cse9 (= v_main_~a~0_250 v_main_~a~0_249)))) InVars {main_~e~0=v_main_~e~0_2909, main_~d~0=v_main_~d~0_528, main_~b~0=v_main_~b~0_335, main_~f~0=v_main_~f~0_6808, main_#t~pre7=|v_main_#t~pre7_353|, main_~c~0=v_main_~c~0_436, main_#t~pre8=|v_main_#t~pre8_2436|, main_#t~pre9=|v_main_#t~pre9_4553|, 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_2902, main_~d~0=v_main_~d~0_526, main_~b~0=v_main_~b~0_333, main_~f~0=v_main_~f~0_6771, main_#t~pre7=|v_main_#t~pre7_352|, main_~c~0=v_main_~c~0_434, main_#t~pre8=|v_main_#t~pre8_2430|, main_#t~pre9=|v_main_#t~pre9_4522|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {24259#(= main_~a~0 0)} is VALID [2022-04-28 04:18:20,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {24259#(= main_~a~0 0)} [175] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {24255#false} is VALID [2022-04-28 04:18:20,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {24255#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {24255#false} is VALID [2022-04-28 04:18:20,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {24255#false} assume !false; {24255#false} is VALID [2022-04-28 04:18:20,155 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:20,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:18:20,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693174259] [2022-04-28 04:18:20,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693174259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:18:20,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:18:20,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:18:21,655 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:18:21,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [701942707] [2022-04-28 04:18:21,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [701942707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:18:21,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:18:21,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-28 04:18:21,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597593598] [2022-04-28 04:18:21,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:18:21,656 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.130434782608696) internal successors, (98), 45 states have internal predecessors, (98), 1 states have call successors, (2), 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 101 [2022-04-28 04:18:21,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:18:21,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 2.130434782608696) internal successors, (98), 45 states have internal predecessors, (98), 1 states have call successors, (2), 2 states have call 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:21,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:18:21,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-28 04:18:21,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:18:21,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-28 04:18:21,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=1812, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 04:18:21,723 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 46 states, 46 states have (on average 2.130434782608696) internal successors, (98), 45 states have internal predecessors, (98), 1 states have call successors, (2), 2 states have call 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:26,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:26,893 INFO L93 Difference]: Finished difference Result 152 states and 177 transitions. [2022-04-28 04:18:26,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-28 04:18:26,893 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.130434782608696) internal successors, (98), 45 states have internal predecessors, (98), 1 states have call successors, (2), 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 101 [2022-04-28 04:18:26,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:18:26,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.130434782608696) internal successors, (98), 45 states have internal predecessors, (98), 1 states have call successors, (2), 2 states have call 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:26,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 177 transitions. [2022-04-28 04:18:26,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.130434782608696) internal successors, (98), 45 states have internal predecessors, (98), 1 states have call successors, (2), 2 states have call 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:26,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 177 transitions. [2022-04-28 04:18:26,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 177 transitions. [2022-04-28 04:18:27,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:18:27,014 INFO L225 Difference]: With dead ends: 152 [2022-04-28 04:18:27,014 INFO L226 Difference]: Without dead ends: 137 [2022-04-28 04:18:27,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 40 SyntacticMatches, 18 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=768, Invalid=7064, Unknown=0, NotChecked=0, Total=7832 [2022-04-28 04:18:27,014 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 208 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3239 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 3338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 3239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:18:27,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 30 Invalid, 3338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 3239 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 04:18:27,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-28 04:18:27,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 104. [2022-04-28 04:18:27,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:18:27,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 104 states, 100 states have (on average 1.06) internal successors, (106), 100 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:18:27,092 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 104 states, 100 states have (on average 1.06) internal successors, (106), 100 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:18:27,092 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 104 states, 100 states have (on average 1.06) internal successors, (106), 100 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:18:27,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:27,093 INFO L93 Difference]: Finished difference Result 137 states and 156 transitions. [2022-04-28 04:18:27,093 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2022-04-28 04:18:27,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:18:27,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:18:27,093 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 100 states have (on average 1.06) internal successors, (106), 100 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 137 states. [2022-04-28 04:18:27,093 INFO L87 Difference]: Start difference. First operand has 104 states, 100 states have (on average 1.06) internal successors, (106), 100 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 137 states. [2022-04-28 04:18:27,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:27,094 INFO L93 Difference]: Finished difference Result 137 states and 156 transitions. [2022-04-28 04:18:27,094 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2022-04-28 04:18:27,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:18:27,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:18:27,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:18:27,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:18:27,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 100 states have (on average 1.06) internal successors, (106), 100 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:18:27,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2022-04-28 04:18:27,096 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 101 [2022-04-28 04:18:27,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:18:27,096 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2022-04-28 04:18:27,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.130434782608696) internal successors, (98), 45 states have internal predecessors, (98), 1 states have call successors, (2), 2 states have call 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:27,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 109 transitions. [2022-04-28 04:18:27,413 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:18:27,413 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2022-04-28 04:18:27,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-28 04:18:27,413 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:18:27,413 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, 1, 1, 1] [2022-04-28 04:18:27,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-04-28 04:18:27,413 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:18:27,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:18:27,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1913821891, now seen corresponding path program 37 times [2022-04-28 04:18:27,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:18:27,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [543184290] [2022-04-28 04:18:31,642 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:18:31,689 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:31,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:18:31,912 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:18:31,950 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:18:36,016 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:18:36,064 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:36,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:18:36,286 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:18:36,325 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:18:38,402 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:18:38,452 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,533 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,679 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:18:38,719 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:18:42,785 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:18:42,831 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:42,920 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:43,058 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:18:43,097 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:18:47,168 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:18:47,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:18:47,292 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:47,498 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:47,499 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:18:47,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1834122219, now seen corresponding path program 1 times [2022-04-28 04:18:47,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:18:47,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41024284] [2022-04-28 04:18:47,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:18:47,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:18:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:18:47,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:18:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:18:47,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {25183#(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); {25177#true} is VALID [2022-04-28 04:18:47,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-04-28 04:18:47,529 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25177#true} {25177#true} #92#return; {25177#true} is VALID [2022-04-28 04:18:47,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {25177#true} call ULTIMATE.init(); {25183#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:18:47,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {25183#(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); {25177#true} is VALID [2022-04-28 04:18:47,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-04-28 04:18:47,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25177#true} {25177#true} #92#return; {25177#true} is VALID [2022-04-28 04:18:47,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {25177#true} call #t~ret10 := main(); {25177#true} is VALID [2022-04-28 04:18:47,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {25177#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {25182#(= main_~a~0 0)} is VALID [2022-04-28 04:18:47,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {25182#(= main_~a~0 0)} [178] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~e~0_3019 v_main_~e~0_3012)) (.cse1 (= v_main_~a~0_256 v_main_~a~0_255)) (.cse2 (= |v_main_#t~pre9_4761| |v_main_#t~pre9_4729|)) (.cse3 (= |v_main_#t~pre5_250| |v_main_#t~pre5_249|)) (.cse4 (= v_main_~c~0_446 v_main_~c~0_444)) (.cse5 (= v_main_~b~0_343 v_main_~b~0_341)) (.cse6 (= v_main_~d~0_540 v_main_~d~0_538)) (.cse7 (= |v_main_#t~pre4_209| |v_main_#t~pre4_208|)) (.cse8 (= |v_main_#t~pre6_309| |v_main_#t~pre6_308|)) (.cse9 (= |v_main_#t~pre7_361| |v_main_#t~pre7_360|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~f~0_7109 v_main_~f~0_7071) .cse5 .cse6 .cse7 .cse8 .cse9 (= |v_main_#t~pre8_2533| |v_main_#t~pre8_2527|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre8_2527| |v_main_#t~pre8_2533|) (= v_main_~f~0_7071 v_main_~f~0_7109) .cse5 .cse6 .cse7 .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_3019, main_~d~0=v_main_~d~0_540, main_~b~0=v_main_~b~0_343, main_~f~0=v_main_~f~0_7109, main_#t~pre7=|v_main_#t~pre7_361|, main_~c~0=v_main_~c~0_446, main_#t~pre8=|v_main_#t~pre8_2533|, main_#t~pre9=|v_main_#t~pre9_4761|, 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_3012, main_~d~0=v_main_~d~0_538, main_~b~0=v_main_~b~0_341, main_~f~0=v_main_~f~0_7071, main_#t~pre7=|v_main_#t~pre7_360|, main_~c~0=v_main_~c~0_444, main_#t~pre8=|v_main_#t~pre8_2527|, main_#t~pre9=|v_main_#t~pre9_4729|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {25182#(= main_~a~0 0)} is VALID [2022-04-28 04:18:47,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {25182#(= main_~a~0 0)} [177] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {25178#false} is VALID [2022-04-28 04:18:47,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {25178#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {25178#false} is VALID [2022-04-28 04:18:47,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {25178#false} assume !false; {25178#false} is VALID [2022-04-28 04:18:47,532 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:47,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:18:47,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41024284] [2022-04-28 04:18:47,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41024284] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:18:47,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:18:47,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:18:49,178 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:18:49,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [543184290] [2022-04-28 04:18:49,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [543184290] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:18:49,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:18:49,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-28 04:18:49,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215093887] [2022-04-28 04:18:49,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:18:49,179 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.127659574468085) internal successors, (100), 46 states have internal predecessors, (100), 1 states have call successors, (2), 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 103 [2022-04-28 04:18:49,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:18:49,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 2.127659574468085) internal successors, (100), 46 states have internal predecessors, (100), 1 states have call successors, (2), 2 states have call 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,244 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:18:49,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-28 04:18:49,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:18:49,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-28 04:18:49,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1898, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 04:18:49,247 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand has 47 states, 47 states have (on average 2.127659574468085) internal successors, (100), 46 states have internal predecessors, (100), 1 states have call successors, (2), 2 states have call 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,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:54,620 INFO L93 Difference]: Finished difference Result 154 states and 179 transitions. [2022-04-28 04:18:54,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-28 04:18:54,620 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.127659574468085) internal successors, (100), 46 states have internal predecessors, (100), 1 states have call successors, (2), 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 103 [2022-04-28 04:18:54,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:18:54,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.127659574468085) internal successors, (100), 46 states have internal predecessors, (100), 1 states have call successors, (2), 2 states have call 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,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 179 transitions. [2022-04-28 04:18:54,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.127659574468085) internal successors, (100), 46 states have internal predecessors, (100), 1 states have call successors, (2), 2 states have call 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,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 179 transitions. [2022-04-28 04:18:54,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 179 transitions. [2022-04-28 04:18:54,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:18:54,746 INFO L225 Difference]: With dead ends: 154 [2022-04-28 04:18:54,746 INFO L226 Difference]: Without dead ends: 139 [2022-04-28 04:18:54,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 37 SyntacticMatches, 22 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=786, Invalid=7404, Unknown=0, NotChecked=0, Total=8190 [2022-04-28 04:18:54,747 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 250 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 3380 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 3518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 3380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:18:54,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 45 Invalid, 3518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 3380 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 04:18:54,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-28 04:18:54,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 106. [2022-04-28 04:18:54,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:18:54,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 106 states, 102 states have (on average 1.0588235294117647) internal successors, (108), 102 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:18:54,821 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 106 states, 102 states have (on average 1.0588235294117647) internal successors, (108), 102 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:18:54,821 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 106 states, 102 states have (on average 1.0588235294117647) internal successors, (108), 102 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:18:54,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:54,822 INFO L93 Difference]: Finished difference Result 139 states and 158 transitions. [2022-04-28 04:18:54,822 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 158 transitions. [2022-04-28 04:18:54,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:18:54,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:18:54,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 102 states have (on average 1.0588235294117647) internal successors, (108), 102 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 139 states. [2022-04-28 04:18:54,822 INFO L87 Difference]: Start difference. First operand has 106 states, 102 states have (on average 1.0588235294117647) internal successors, (108), 102 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 139 states. [2022-04-28 04:18:54,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:54,824 INFO L93 Difference]: Finished difference Result 139 states and 158 transitions. [2022-04-28 04:18:54,824 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 158 transitions. [2022-04-28 04:18:54,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:18:54,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:18:54,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:18:54,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:18:54,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 102 states have (on average 1.0588235294117647) internal successors, (108), 102 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:18:54,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2022-04-28 04:18:54,825 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 103 [2022-04-28 04:18:54,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:18:54,825 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2022-04-28 04:18:54,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.127659574468085) internal successors, (100), 46 states have internal predecessors, (100), 1 states have call successors, (2), 2 states have call 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,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 111 transitions. [2022-04-28 04:18:55,157 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:18:55,158 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2022-04-28 04:18:55,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-28 04:18:55,158 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:18:55,158 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, 1, 1, 1] [2022-04-28 04:18:55,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-04-28 04:18:55,158 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:18:55,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:18:55,158 INFO L85 PathProgramCache]: Analyzing trace with hash 852644321, now seen corresponding path program 38 times [2022-04-28 04:18:55,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:18:55,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [542599332] [2022-04-28 04:18:59,391 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:18:59,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:18:59,534 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:03,629 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:19:03,683 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:19:03,722 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:19:07,792 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:19:07,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:19:07,925 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:12,011 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:19:12,063 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:19:12,103 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:19:16,170 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:19:16,216 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:16,295 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:20,383 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:19:20,436 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:19:20,476 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:19:24,541 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:19:24,589 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:24,670 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:27,408 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:19:27,451 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:19:31,523 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:19:31,570 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:31,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:19:31,863 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:31,863 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:19:31,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1834183723, now seen corresponding path program 1 times [2022-04-28 04:19:31,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:19:31,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361280080] [2022-04-28 04:19:31,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:19:31,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:19:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:19:31,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:19:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:19:31,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {26121#(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); {26115#true} is VALID [2022-04-28 04:19:31,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {26115#true} assume true; {26115#true} is VALID [2022-04-28 04:19:31,895 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26115#true} {26115#true} #92#return; {26115#true} is VALID [2022-04-28 04:19:31,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {26115#true} call ULTIMATE.init(); {26121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:19:31,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {26121#(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); {26115#true} is VALID [2022-04-28 04:19:31,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {26115#true} assume true; {26115#true} is VALID [2022-04-28 04:19:31,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26115#true} {26115#true} #92#return; {26115#true} is VALID [2022-04-28 04:19:31,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {26115#true} call #t~ret10 := main(); {26115#true} is VALID [2022-04-28 04:19:31,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {26115#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {26120#(= main_~a~0 0)} is VALID [2022-04-28 04:19:31,900 INFO L290 TraceCheckUtils]: 6: Hoare triple {26120#(= main_~a~0 0)} [180] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_256| |v_main_#t~pre5_255|)) (.cse1 (= |v_main_#t~pre7_369| |v_main_#t~pre7_368|)) (.cse2 (= |v_main_#t~pre9_4974| |v_main_#t~pre9_4941|)) (.cse3 (= v_main_~c~0_456 v_main_~c~0_454)) (.cse4 (= v_main_~a~0_262 v_main_~a~0_261)) (.cse5 (= |v_main_#t~pre4_214| |v_main_#t~pre4_213|)) (.cse6 (= v_main_~f~0_7416 v_main_~f~0_7377)) (.cse7 (= |v_main_#t~pre6_316| |v_main_#t~pre6_315|)) (.cse8 (= v_main_~d~0_552 v_main_~d~0_550)) (.cse9 (= v_main_~e~0_3129 v_main_~e~0_3122))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~b~0_349 v_main_~b~0_351) .cse4 (= |v_main_#t~pre8_2624| |v_main_#t~pre8_2630|) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 (= v_main_~b~0_351 v_main_~b~0_349) .cse3 .cse4 .cse5 .cse6 .cse7 (= |v_main_#t~pre8_2630| |v_main_#t~pre8_2624|) .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_3129, main_~d~0=v_main_~d~0_552, main_~b~0=v_main_~b~0_351, main_~f~0=v_main_~f~0_7416, main_#t~pre7=|v_main_#t~pre7_369|, main_~c~0=v_main_~c~0_456, main_#t~pre8=|v_main_#t~pre8_2630|, main_#t~pre9=|v_main_#t~pre9_4974|, 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_3122, main_~d~0=v_main_~d~0_550, main_~b~0=v_main_~b~0_349, main_~f~0=v_main_~f~0_7377, main_#t~pre7=|v_main_#t~pre7_368|, main_~c~0=v_main_~c~0_454, main_#t~pre8=|v_main_#t~pre8_2624|, main_#t~pre9=|v_main_#t~pre9_4941|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {26120#(= main_~a~0 0)} is VALID [2022-04-28 04:19:31,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {26120#(= main_~a~0 0)} [179] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {26116#false} is VALID [2022-04-28 04:19:31,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {26116#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {26116#false} is VALID [2022-04-28 04:19:31,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {26116#false} assume !false; {26116#false} is VALID [2022-04-28 04:19:31,901 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:31,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:19:31,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361280080] [2022-04-28 04:19:31,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361280080] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:19:31,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:19:31,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:19:33,579 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:19:33,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [542599332] [2022-04-28 04:19:33,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [542599332] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:19:33,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:19:33,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-28 04:19:33,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791175628] [2022-04-28 04:19:33,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:19:33,579 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.125) internal successors, (102), 47 states have internal predecessors, (102), 1 states have call successors, (2), 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 105 [2022-04-28 04:19:33,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:19:33,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 2.125) internal successors, (102), 47 states have internal predecessors, (102), 1 states have call successors, (2), 2 states have call 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:33,645 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:19:33,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-28 04:19:33,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:19:33,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-28 04:19:33,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1986, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 04:19:33,646 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand has 48 states, 48 states have (on average 2.125) internal successors, (102), 47 states have internal predecessors, (102), 1 states have call successors, (2), 2 states have call 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:39,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:39,608 INFO L93 Difference]: Finished difference Result 156 states and 181 transitions. [2022-04-28 04:19:39,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-28 04:19:39,608 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.125) internal successors, (102), 47 states have internal predecessors, (102), 1 states have call successors, (2), 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 105 [2022-04-28 04:19:39,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:19:39,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.125) internal successors, (102), 47 states have internal predecessors, (102), 1 states have call successors, (2), 2 states have call 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:39,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 181 transitions. [2022-04-28 04:19:39,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.125) internal successors, (102), 47 states have internal predecessors, (102), 1 states have call successors, (2), 2 states have call 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:39,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 181 transitions. [2022-04-28 04:19:39,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 181 transitions. [2022-04-28 04:19:39,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:19:39,734 INFO L225 Difference]: With dead ends: 156 [2022-04-28 04:19:39,734 INFO L226 Difference]: Without dead ends: 141 [2022-04-28 04:19:39,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 38 SyntacticMatches, 22 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=804, Invalid=7752, Unknown=0, NotChecked=0, Total=8556 [2022-04-28 04:19:39,735 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 253 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 3864 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 4005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 3864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:19:39,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 85 Invalid, 4005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 3864 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 04:19:39,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-28 04:19:39,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 108. [2022-04-28 04:19:39,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:19:39,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 108 states, 104 states have (on average 1.0576923076923077) internal successors, (110), 104 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call 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:39,812 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 108 states, 104 states have (on average 1.0576923076923077) internal successors, (110), 104 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call 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:39,812 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 108 states, 104 states have (on average 1.0576923076923077) internal successors, (110), 104 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call 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:39,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:39,813 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2022-04-28 04:19:39,813 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2022-04-28 04:19:39,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:19:39,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:19:39,814 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 104 states have (on average 1.0576923076923077) internal successors, (110), 104 states have internal predecessors, (110), 2 states have call successors, (2), 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 141 states. [2022-04-28 04:19:39,814 INFO L87 Difference]: Start difference. First operand has 108 states, 104 states have (on average 1.0576923076923077) internal successors, (110), 104 states have internal predecessors, (110), 2 states have call successors, (2), 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 141 states. [2022-04-28 04:19:39,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:39,815 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2022-04-28 04:19:39,815 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2022-04-28 04:19:39,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:19:39,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:19:39,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:19:39,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:19:39,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 104 states have (on average 1.0576923076923077) internal successors, (110), 104 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call 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:39,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2022-04-28 04:19:39,816 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 105 [2022-04-28 04:19:39,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:19:39,816 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2022-04-28 04:19:39,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.125) internal successors, (102), 47 states have internal predecessors, (102), 1 states have call successors, (2), 2 states have call 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:39,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 108 states and 113 transitions. [2022-04-28 04:19:40,154 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:19:40,154 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2022-04-28 04:19:40,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-28 04:19:40,155 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:19:40,155 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, 1, 1, 1] [2022-04-28 04:19:40,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-04-28 04:19:40,155 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:19:40,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:19:40,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1031751297, now seen corresponding path program 39 times [2022-04-28 04:19:40,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:19:40,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [259680248] [2022-04-28 04:19:42,482 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:19:42,529 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,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:19:42,632 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:19:42,633 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:19:42,663 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:19:46,733 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:19:46,786 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,865 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,888 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:19:46,888 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:19:46,917 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:19:50,980 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:19:51,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:51,114 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:51,138 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:19:51,138 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:19:51,169 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:19:55,241 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:19:55,288 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:55,367 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:55,390 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:19:55,390 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:19:55,418 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:19:59,482 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:19:59,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:19:59,616 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:59,841 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:59,842 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:19:59,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1834245227, now seen corresponding path program 1 times [2022-04-28 04:19:59,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:19:59,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36424998] [2022-04-28 04:19:59,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:19:59,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:19:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:19:59,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:19:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:19:59,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {27074#(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); {27068#true} is VALID [2022-04-28 04:19:59,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {27068#true} assume true; {27068#true} is VALID [2022-04-28 04:19:59,869 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27068#true} {27068#true} #92#return; {27068#true} is VALID [2022-04-28 04:19:59,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {27068#true} call ULTIMATE.init(); {27074#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:19:59,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {27074#(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); {27068#true} is VALID [2022-04-28 04:19:59,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {27068#true} assume true; {27068#true} is VALID [2022-04-28 04:19:59,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27068#true} {27068#true} #92#return; {27068#true} is VALID [2022-04-28 04:19:59,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {27068#true} call #t~ret10 := main(); {27068#true} is VALID [2022-04-28 04:19:59,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {27068#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {27073#(= main_~a~0 0)} is VALID [2022-04-28 04:19:59,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {27073#(= main_~a~0 0)} [182] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~f~0_7713 v_main_~f~0_7673)) (.cse1 (= |v_main_#t~pre4_219| |v_main_#t~pre4_218|)) (.cse2 (= v_main_~a~0_268 v_main_~a~0_267)) (.cse3 (= |v_main_#t~pre5_262| |v_main_#t~pre5_261|)) (.cse4 (= v_main_~d~0_564 v_main_~d~0_562)) (.cse5 (= |v_main_#t~pre7_377| |v_main_#t~pre7_376|)) (.cse6 (= |v_main_#t~pre9_5176| |v_main_#t~pre9_5142|)) (.cse7 (= v_main_~b~0_359 v_main_~b~0_357)) (.cse8 (= v_main_~c~0_466 v_main_~c~0_464)) (.cse9 (= v_main_~e~0_3227 v_main_~e~0_3220)) (.cse10 (= |v_main_#t~pre6_323| |v_main_#t~pre6_322|))) (or (and (= |v_main_#t~pre8_2705| |v_main_#t~pre8_2711|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |v_main_#t~pre8_2711| |v_main_#t~pre8_2705|)))) InVars {main_~e~0=v_main_~e~0_3227, main_~d~0=v_main_~d~0_564, main_~b~0=v_main_~b~0_359, main_~f~0=v_main_~f~0_7713, main_#t~pre7=|v_main_#t~pre7_377|, main_~c~0=v_main_~c~0_466, main_#t~pre8=|v_main_#t~pre8_2711|, main_#t~pre9=|v_main_#t~pre9_5176|, 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_3220, main_~d~0=v_main_~d~0_562, main_~b~0=v_main_~b~0_357, main_~f~0=v_main_~f~0_7673, main_#t~pre7=|v_main_#t~pre7_376|, main_~c~0=v_main_~c~0_464, main_#t~pre8=|v_main_#t~pre8_2705|, main_#t~pre9=|v_main_#t~pre9_5142|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {27073#(= main_~a~0 0)} is VALID [2022-04-28 04:19:59,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {27073#(= main_~a~0 0)} [181] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {27069#false} is VALID [2022-04-28 04:19:59,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {27069#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {27069#false} is VALID [2022-04-28 04:19:59,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {27069#false} assume !false; {27069#false} is VALID [2022-04-28 04:19:59,871 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:59,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:19:59,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36424998] [2022-04-28 04:19:59,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36424998] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:19:59,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:19:59,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:20:01,647 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:20:01,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [259680248] [2022-04-28 04:20:01,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [259680248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:20:01,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:20:01,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-28 04:20:01,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581344691] [2022-04-28 04:20:01,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:20:01,647 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.122448979591837) internal successors, (104), 48 states have internal predecessors, (104), 1 states have call successors, (2), 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 107 [2022-04-28 04:20:01,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:20:01,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 2.122448979591837) internal successors, (104), 48 states have internal predecessors, (104), 1 states have call successors, (2), 2 states have call 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:01,720 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:20:01,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-28 04:20:01,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:01,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-28 04:20:01,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=2076, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 04:20:01,721 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand has 49 states, 49 states have (on average 2.122448979591837) internal successors, (104), 48 states have internal predecessors, (104), 1 states have call successors, (2), 2 states have call 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:07,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:07,413 INFO L93 Difference]: Finished difference Result 158 states and 183 transitions. [2022-04-28 04:20:07,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-28 04:20:07,414 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.122448979591837) internal successors, (104), 48 states have internal predecessors, (104), 1 states have call successors, (2), 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 107 [2022-04-28 04:20:07,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:20:07,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.122448979591837) internal successors, (104), 48 states have internal predecessors, (104), 1 states have call successors, (2), 2 states have call 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:07,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 183 transitions. [2022-04-28 04:20:07,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.122448979591837) internal successors, (104), 48 states have internal predecessors, (104), 1 states have call successors, (2), 2 states have call 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:07,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 183 transitions. [2022-04-28 04:20:07,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 183 transitions. [2022-04-28 04:20:07,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:07,540 INFO L225 Difference]: With dead ends: 158 [2022-04-28 04:20:07,541 INFO L226 Difference]: Without dead ends: 143 [2022-04-28 04:20:07,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 42 SyntacticMatches, 19 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1578 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=822, Invalid=8108, Unknown=0, NotChecked=0, Total=8930 [2022-04-28 04:20:07,541 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 346 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 3507 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 3725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 3507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 04:20:07,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 25 Invalid, 3725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 3507 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 04:20:07,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-28 04:20:07,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 110. [2022-04-28 04:20:07,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:20:07,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 110 states, 106 states have (on average 1.0566037735849056) internal successors, (112), 106 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:20:07,626 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 110 states, 106 states have (on average 1.0566037735849056) internal successors, (112), 106 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:20:07,626 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 110 states, 106 states have (on average 1.0566037735849056) internal successors, (112), 106 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:20:07,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:07,627 INFO L93 Difference]: Finished difference Result 143 states and 162 transitions. [2022-04-28 04:20:07,627 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 162 transitions. [2022-04-28 04:20:07,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:20:07,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:20:07,628 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 106 states have (on average 1.0566037735849056) internal successors, (112), 106 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 143 states. [2022-04-28 04:20:07,628 INFO L87 Difference]: Start difference. First operand has 110 states, 106 states have (on average 1.0566037735849056) internal successors, (112), 106 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 143 states. [2022-04-28 04:20:07,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:07,629 INFO L93 Difference]: Finished difference Result 143 states and 162 transitions. [2022-04-28 04:20:07,629 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 162 transitions. [2022-04-28 04:20:07,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:20:07,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:20:07,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:20:07,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:20:07,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 106 states have (on average 1.0566037735849056) internal successors, (112), 106 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:20:07,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 115 transitions. [2022-04-28 04:20:07,630 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 115 transitions. Word has length 107 [2022-04-28 04:20:07,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:20:07,630 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 115 transitions. [2022-04-28 04:20:07,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.122448979591837) internal successors, (104), 48 states have internal predecessors, (104), 1 states have call successors, (2), 2 states have call 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:07,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 115 transitions. [2022-04-28 04:20:07,982 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:20:07,982 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2022-04-28 04:20:07,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-28 04:20:07,982 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:20:07,982 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, 1, 1, 1] [2022-04-28 04:20:07,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-04-28 04:20:07,983 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:20:07,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:20:07,983 INFO L85 PathProgramCache]: Analyzing trace with hash 540258717, now seen corresponding path program 40 times [2022-04-28 04:20:07,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:07,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1282907727] [2022-04-28 04:20:10,314 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:10,393 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:10,415 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:20:10,415 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:20:10,444 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:20:14,117 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:20:14,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:20:14,234 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:14,256 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:20:14,256 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:20:14,285 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:20:18,346 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:20:18,386 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:18,464 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:18,485 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:20:18,485 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:20:18,513 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:20:22,574 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:20:22,613 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:22,689 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:22,710 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:20:22,711 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:20:22,739 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:20:26,807 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:20:26,847 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,924 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,136 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:27,136 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:20:27,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1834306731, now seen corresponding path program 1 times [2022-04-28 04:20:27,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:20:27,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227657218] [2022-04-28 04:20:27,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:20:27,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:20:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:20:27,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:20:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:20:27,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {28042#(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); {28036#true} is VALID [2022-04-28 04:20:27,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {28036#true} assume true; {28036#true} is VALID [2022-04-28 04:20:27,161 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28036#true} {28036#true} #92#return; {28036#true} is VALID [2022-04-28 04:20:27,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {28036#true} call ULTIMATE.init(); {28042#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:20:27,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {28042#(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); {28036#true} is VALID [2022-04-28 04:20:27,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {28036#true} assume true; {28036#true} is VALID [2022-04-28 04:20:27,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28036#true} {28036#true} #92#return; {28036#true} is VALID [2022-04-28 04:20:27,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {28036#true} call #t~ret10 := main(); {28036#true} is VALID [2022-04-28 04:20:27,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {28036#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {28041#(= main_~a~0 0)} is VALID [2022-04-28 04:20:27,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {28041#(= main_~a~0 0)} [184] 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_~d~0_576 v_main_~d~0_574)) (.cse4 (= |v_main_#t~pre9_5383| |v_main_#t~pre9_5348|)) (.cse5 (= v_main_~a~0_274 v_main_~a~0_273)) (.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_#t~pre7_385| |v_main_#t~pre7_384|)) (.cse9 (= |v_main_#t~pre8_2792| |v_main_#t~pre8_2786|))) (or (and .cse0 .cse1 .cse2 (= v_main_~f~0_7975 v_main_~f~0_8016) .cse3 .cse4 (= v_main_~e~0_3318 v_main_~e~0_3325) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~f~0_8016 v_main_~f~0_7975) .cse5 .cse6 .cse7 .cse8 .cse9 (= v_main_~e~0_3325 v_main_~e~0_3318)))) InVars {main_~e~0=v_main_~e~0_3325, main_~d~0=v_main_~d~0_576, main_~b~0=v_main_~b~0_367, main_~f~0=v_main_~f~0_8016, main_#t~pre7=|v_main_#t~pre7_385|, main_~c~0=v_main_~c~0_476, main_#t~pre8=|v_main_#t~pre8_2792|, main_#t~pre9=|v_main_#t~pre9_5383|, 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_3318, main_~d~0=v_main_~d~0_574, main_~b~0=v_main_~b~0_365, main_~f~0=v_main_~f~0_7975, main_#t~pre7=|v_main_#t~pre7_384|, main_~c~0=v_main_~c~0_474, main_#t~pre8=|v_main_#t~pre8_2786|, main_#t~pre9=|v_main_#t~pre9_5348|, 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_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {28041#(= main_~a~0 0)} is VALID [2022-04-28 04:20:27,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {28041#(= main_~a~0 0)} [183] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {28037#false} is VALID [2022-04-28 04:20:27,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {28037#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {28037#false} is VALID [2022-04-28 04:20:27,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {28037#false} assume !false; {28037#false} is VALID [2022-04-28 04:20:27,164 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,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:20:27,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227657218] [2022-04-28 04:20:27,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227657218] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:20:27,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:20:27,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:20:29,000 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:20:29,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1282907727] [2022-04-28 04:20:29,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1282907727] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:20:29,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:20:29,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-28 04:20:29,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042036874] [2022-04-28 04:20:29,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:20:29,000 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.12) internal successors, (106), 49 states have internal predecessors, (106), 1 states have call successors, (2), 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 109 [2022-04-28 04:20:29,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:20:29,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 2.12) internal successors, (106), 49 states have internal predecessors, (106), 1 states have call successors, (2), 2 states have call 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,069 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:20:29,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-28 04:20:29,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:29,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-28 04:20:29,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=2168, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 04:20:29,070 INFO L87 Difference]: Start difference. First operand 110 states and 115 transitions. Second operand has 50 states, 50 states have (on average 2.12) internal successors, (106), 49 states have internal predecessors, (106), 1 states have call successors, (2), 2 states have call 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:35,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:35,294 INFO L93 Difference]: Finished difference Result 162 states and 188 transitions. [2022-04-28 04:20:35,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-28 04:20:35,294 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.12) internal successors, (106), 49 states have internal predecessors, (106), 1 states have call successors, (2), 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 109 [2022-04-28 04:20:35,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:20:35,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.12) internal successors, (106), 49 states have internal predecessors, (106), 1 states have call successors, (2), 2 states have call 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:35,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 188 transitions. [2022-04-28 04:20:35,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.12) internal successors, (106), 49 states have internal predecessors, (106), 1 states have call successors, (2), 2 states have call 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:35,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 188 transitions. [2022-04-28 04:20:35,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 188 transitions. [2022-04-28 04:20:35,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:35,425 INFO L225 Difference]: With dead ends: 162 [2022-04-28 04:20:35,425 INFO L226 Difference]: Without dead ends: 147 [2022-04-28 04:20:35,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 38 SyntacticMatches, 24 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1679 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=840, Invalid=8472, Unknown=0, NotChecked=0, Total=9312 [2022-04-28 04:20:35,426 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 392 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3965 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 4219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 3965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-28 04:20:35,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 30 Invalid, 4219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 3965 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-28 04:20:35,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-04-28 04:20:35,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 114. [2022-04-28 04:20:35,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:20:35,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 114 states, 110 states have (on average 1.0545454545454545) internal successors, (116), 110 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:20:35,517 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 114 states, 110 states have (on average 1.0545454545454545) internal successors, (116), 110 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:20:35,517 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 114 states, 110 states have (on average 1.0545454545454545) internal successors, (116), 110 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:20:35,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:35,518 INFO L93 Difference]: Finished difference Result 147 states and 166 transitions. [2022-04-28 04:20:35,518 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 166 transitions. [2022-04-28 04:20:35,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:20:35,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:20:35,518 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 110 states have (on average 1.0545454545454545) internal successors, (116), 110 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 147 states. [2022-04-28 04:20:35,519 INFO L87 Difference]: Start difference. First operand has 114 states, 110 states have (on average 1.0545454545454545) internal successors, (116), 110 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 147 states. [2022-04-28 04:20:35,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:35,520 INFO L93 Difference]: Finished difference Result 147 states and 166 transitions. [2022-04-28 04:20:35,520 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 166 transitions. [2022-04-28 04:20:35,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:20:35,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:20:35,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:20:35,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:20:35,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 110 states have (on average 1.0545454545454545) internal successors, (116), 110 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:20:35,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2022-04-28 04:20:35,521 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 109 [2022-04-28 04:20:35,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:20:35,521 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2022-04-28 04:20:35,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.12) internal successors, (106), 49 states have internal predecessors, (106), 1 states have call successors, (2), 2 states have call 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:35,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 114 states and 119 transitions. [2022-04-28 04:20:35,900 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:20:35,900 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2022-04-28 04:20:35,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-28 04:20:35,900 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:20:35,900 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, 1, 1, 1] [2022-04-28 04:20:35,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-04-28 04:20:35,900 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:20:35,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:20:35,901 INFO L85 PathProgramCache]: Analyzing trace with hash -586606021, now seen corresponding path program 41 times [2022-04-28 04:20:35,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:35,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [960036562] [2022-04-28 04:20:40,771 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:20:40,818 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:40,907 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:41,027 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:20:45,107 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:20:45,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:20:45,233 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:45,358 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:20:49,431 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:20:49,476 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:49,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:20:49,683 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:20:51,841 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:51,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:20:52,034 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:20:54,329 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:20:54,375 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:54,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:20:54,694 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:54,695 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:20:54,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1834368235, now seen corresponding path program 1 times [2022-04-28 04:20:54,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:20:54,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047522587] [2022-04-28 04:20:54,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:20:54,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:20:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:20:54,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:20:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:20:54,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {29037#(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); {29031#true} is VALID [2022-04-28 04:20:54,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {29031#true} assume true; {29031#true} is VALID [2022-04-28 04:20:54,719 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29031#true} {29031#true} #92#return; {29031#true} is VALID [2022-04-28 04:20:54,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {29031#true} call ULTIMATE.init(); {29037#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:20:54,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {29037#(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); {29031#true} is VALID [2022-04-28 04:20:54,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {29031#true} assume true; {29031#true} is VALID [2022-04-28 04:20:54,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29031#true} {29031#true} #92#return; {29031#true} is VALID [2022-04-28 04:20:54,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {29031#true} call #t~ret10 := main(); {29031#true} is VALID [2022-04-28 04:20:54,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {29031#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {29036#(= main_~a~0 0)} is VALID [2022-04-28 04:20:54,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {29036#(= main_~a~0 0)} [186] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre7_393| |v_main_#t~pre7_392|)) (.cse1 (= |v_main_#t~pre6_337| |v_main_#t~pre6_336|)) (.cse2 (= v_main_~b~0_375 v_main_~b~0_373)) (.cse3 (= |v_main_#t~pre5_274| |v_main_#t~pre5_273|)) (.cse4 (= |v_main_#t~pre8_2868| |v_main_#t~pre8_2862|)) (.cse5 (= v_main_~e~0_3413 v_main_~e~0_3406)) (.cse6 (= v_main_~c~0_486 v_main_~c~0_484)) (.cse7 (= v_main_~f~0_8314 v_main_~f~0_8272)) (.cse8 (= v_main_~d~0_588 v_main_~d~0_586)) (.cse9 (= |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 .cse5 (= |v_main_#t~pre9_5549| |v_main_#t~pre9_5585|) .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (= v_main_~a~0_280 v_main_~a~0_279) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |v_main_#t~pre9_5585| |v_main_#t~pre9_5549|)))) InVars {main_~e~0=v_main_~e~0_3413, main_~d~0=v_main_~d~0_588, main_~b~0=v_main_~b~0_375, main_~f~0=v_main_~f~0_8314, main_#t~pre7=|v_main_#t~pre7_393|, main_~c~0=v_main_~c~0_486, main_#t~pre8=|v_main_#t~pre8_2868|, main_#t~pre9=|v_main_#t~pre9_5585|, 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_337|} OutVars{main_~e~0=v_main_~e~0_3406, main_~d~0=v_main_~d~0_586, main_~b~0=v_main_~b~0_373, main_~f~0=v_main_~f~0_8272, main_#t~pre7=|v_main_#t~pre7_392|, main_~c~0=v_main_~c~0_484, main_#t~pre8=|v_main_#t~pre8_2862|, main_#t~pre9=|v_main_#t~pre9_5549|, 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_336|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {29036#(= main_~a~0 0)} is VALID [2022-04-28 04:20:54,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {29036#(= main_~a~0 0)} [185] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {29032#false} is VALID [2022-04-28 04:20:54,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {29032#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {29032#false} is VALID [2022-04-28 04:20:54,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {29032#false} assume !false; {29032#false} is VALID [2022-04-28 04:20:54,721 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:54,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:20:54,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047522587] [2022-04-28 04:20:54,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047522587] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:20:54,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:20:54,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:20:56,830 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:20:56,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [960036562] [2022-04-28 04:20:56,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [960036562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:20:56,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:20:56,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-28 04:20:56,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768704739] [2022-04-28 04:20:56,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:20:56,831 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:20:56,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:20:56,831 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:20:56,902 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:20:56,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-28 04:20:56,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:56,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-28 04:20:56,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=2359, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 04:20:56,903 INFO L87 Difference]: Start difference. First operand 114 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:21:03,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:03,756 INFO L93 Difference]: Finished difference Result 160 states and 184 transitions. [2022-04-28 04:21:03,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-28 04:21:03,756 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:21:03,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:21:03,756 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:21:03,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 184 transitions. [2022-04-28 04:21:03,757 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:21:03,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 184 transitions. [2022-04-28 04:21:03,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 184 transitions. [2022-04-28 04:21:03,912 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:21:03,913 INFO L225 Difference]: With dead ends: 160 [2022-04-28 04:21:03,913 INFO L226 Difference]: Without dead ends: 145 [2022-04-28 04:21:03,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 33 SyntacticMatches, 29 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1902 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=873, Invalid=9227, Unknown=0, NotChecked=0, Total=10100 [2022-04-28 04:21:03,914 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 289 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 4470 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 4671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 4470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:21:03,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 24 Invalid, 4671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 4470 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-28 04:21:03,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-04-28 04:21:04,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 118. [2022-04-28 04:21:04,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:21:04,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 118 states, 114 states have (on average 1.0526315789473684) internal successors, (120), 114 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:21:04,005 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 118 states, 114 states have (on average 1.0526315789473684) internal successors, (120), 114 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:21:04,005 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 118 states, 114 states have (on average 1.0526315789473684) internal successors, (120), 114 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:21:04,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:04,006 INFO L93 Difference]: Finished difference Result 145 states and 162 transitions. [2022-04-28 04:21:04,006 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 162 transitions. [2022-04-28 04:21:04,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:21:04,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:21:04,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 114 states have (on average 1.0526315789473684) internal successors, (120), 114 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 145 states. [2022-04-28 04:21:04,006 INFO L87 Difference]: Start difference. First operand has 118 states, 114 states have (on average 1.0526315789473684) internal successors, (120), 114 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 145 states. [2022-04-28 04:21:04,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:04,008 INFO L93 Difference]: Finished difference Result 145 states and 162 transitions. [2022-04-28 04:21:04,008 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 162 transitions. [2022-04-28 04:21:04,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:21:04,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:21:04,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:21:04,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:21:04,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 114 states have (on average 1.0526315789473684) internal successors, (120), 114 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:21:04,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 123 transitions. [2022-04-28 04:21:04,009 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 123 transitions. Word has length 111 [2022-04-28 04:21:04,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:21:04,009 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 123 transitions. [2022-04-28 04:21:04,009 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:21:04,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 123 transitions. [2022-04-28 04:21:04,397 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:21:04,397 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 123 transitions. [2022-04-28 04:21:04,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-28 04:21:04,398 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:21:04,398 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, 1, 1, 1] [2022-04-28 04:21:04,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-04-28 04:21:04,398 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:21:04,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:21:04,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1293042946, now seen corresponding path program 42 times [2022-04-28 04:21:04,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:21:04,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [906790069] [2022-04-28 04:21:09,214 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:21:09,254 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:09,333 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:09,354 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:21:09,354 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:21:09,429 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:13,503 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:21:13,543 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:13,621 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:13,642 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:21:13,642 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:21:13,718 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:17,802 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:21:17,841 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:17,920 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:17,942 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:21:17,942 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:21:18,015 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:22,089 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:21:22,131 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:22,213 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:22,234 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:21:22,234 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:21:22,312 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:26,387 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:21:26,428 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:26,513 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:26,741 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:21:26,741 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:21:26,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1834429739, now seen corresponding path program 1 times [2022-04-28 04:21:26,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:21:26,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896213774] [2022-04-28 04:21:26,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:21:26,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:21:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:21:26,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:21:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:21:26,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {30038#(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); {30032#true} is VALID [2022-04-28 04:21:26,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {30032#true} assume true; {30032#true} is VALID [2022-04-28 04:21:26,776 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30032#true} {30032#true} #92#return; {30032#true} is VALID [2022-04-28 04:21:26,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {30032#true} call ULTIMATE.init(); {30038#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:21:26,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {30038#(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); {30032#true} is VALID [2022-04-28 04:21:26,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {30032#true} assume true; {30032#true} is VALID [2022-04-28 04:21:26,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30032#true} {30032#true} #92#return; {30032#true} is VALID [2022-04-28 04:21:26,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {30032#true} call #t~ret10 := main(); {30032#true} is VALID [2022-04-28 04:21:26,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {30032#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {30037#(= main_~a~0 0)} is VALID [2022-04-28 04:21:26,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {30037#(= main_~a~0 0)} [188] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_234| |v_main_#t~pre4_233|)) (.cse1 (= v_main_~e~0_3516 v_main_~e~0_3508)) (.cse2 (= |v_main_#t~pre8_2928| |v_main_#t~pre8_2922|)) (.cse3 (= v_main_~a~0_286 v_main_~a~0_285)) (.cse4 (= v_main_~b~0_383 v_main_~b~0_381)) (.cse5 (= v_main_~c~0_496 v_main_~c~0_494)) (.cse6 (= v_main_~f~0_8597 v_main_~f~0_8555)) (.cse7 (= |v_main_#t~pre6_344| |v_main_#t~pre6_343|)) (.cse8 (= |v_main_#t~pre9_5771| |v_main_#t~pre9_5735|)) (.cse9 (= |v_main_#t~pre7_426| |v_main_#t~pre7_424|))) (or (and .cse0 .cse1 .cse2 (= v_main_~d~0_625 v_main_~d~0_628) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |v_main_#t~pre5_279| |v_main_#t~pre5_280|) .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~d~0_628 v_main_~d~0_625) (= |v_main_#t~pre5_280| |v_main_#t~pre5_279|) .cse5 .cse6 .cse7 .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_3516, main_~d~0=v_main_~d~0_628, main_~b~0=v_main_~b~0_383, main_~f~0=v_main_~f~0_8597, main_#t~pre7=|v_main_#t~pre7_426|, main_~c~0=v_main_~c~0_496, main_#t~pre8=|v_main_#t~pre8_2928|, main_#t~pre9=|v_main_#t~pre9_5771|, 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_344|} OutVars{main_~e~0=v_main_~e~0_3508, main_~d~0=v_main_~d~0_625, main_~b~0=v_main_~b~0_381, main_~f~0=v_main_~f~0_8555, main_#t~pre7=|v_main_#t~pre7_424|, main_~c~0=v_main_~c~0_494, main_#t~pre8=|v_main_#t~pre8_2922|, main_#t~pre9=|v_main_#t~pre9_5735|, 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_343|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {30037#(= main_~a~0 0)} is VALID [2022-04-28 04:21:26,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {30037#(= main_~a~0 0)} [187] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {30033#false} is VALID [2022-04-28 04:21:26,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {30033#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {30033#false} is VALID [2022-04-28 04:21:26,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {30033#false} assume !false; {30033#false} is VALID [2022-04-28 04:21:26,778 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:26,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:21:26,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896213774] [2022-04-28 04:21:26,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896213774] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:21:26,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:21:26,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:21:28,781 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:21:28,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [906790069] [2022-04-28 04:21:28,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [906790069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:21:28,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:21:28,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-28 04:21:28,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622454185] [2022-04-28 04:21:28,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:21:28,782 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:21:28,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:21:28,782 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:21:28,854 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:21:28,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-28 04:21:28,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:21:28,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-28 04:21:28,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=2458, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 04:21:28,855 INFO L87 Difference]: Start difference. First operand 118 states and 123 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:21:35,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:35,412 INFO L93 Difference]: Finished difference Result 161 states and 184 transitions. [2022-04-28 04:21:35,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-28 04:21:35,413 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:21:35,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:21:35,413 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:21:35,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 184 transitions. [2022-04-28 04:21:35,414 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:21:35,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 184 transitions. [2022-04-28 04:21:35,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 184 transitions. [2022-04-28 04:21:35,541 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:21:35,542 INFO L225 Difference]: With dead ends: 161 [2022-04-28 04:21:35,542 INFO L226 Difference]: Without dead ends: 146 [2022-04-28 04:21:35,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 38 SyntacticMatches, 26 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2017 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=888, Invalid=9618, Unknown=0, NotChecked=0, Total=10506 [2022-04-28 04:21:35,543 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 220 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 4238 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 4354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 4238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-28 04:21:35,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 64 Invalid, 4354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 4238 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-28 04:21:35,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-28 04:21:35,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 119. [2022-04-28 04:21:35,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:21:35,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 119 states, 115 states have (on average 1.0521739130434782) internal successors, (121), 115 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call 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:35,639 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 119 states, 115 states have (on average 1.0521739130434782) internal successors, (121), 115 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call 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:35,639 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 119 states, 115 states have (on average 1.0521739130434782) internal successors, (121), 115 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call 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:35,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:35,640 INFO L93 Difference]: Finished difference Result 146 states and 163 transitions. [2022-04-28 04:21:35,640 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 163 transitions. [2022-04-28 04:21:35,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:21:35,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:21:35,641 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 115 states have (on average 1.0521739130434782) internal successors, (121), 115 states have internal predecessors, (121), 2 states have call successors, (2), 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:21:35,641 INFO L87 Difference]: Start difference. First operand has 119 states, 115 states have (on average 1.0521739130434782) internal successors, (121), 115 states have internal predecessors, (121), 2 states have call successors, (2), 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:21:35,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:35,642 INFO L93 Difference]: Finished difference Result 146 states and 163 transitions. [2022-04-28 04:21:35,642 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 163 transitions. [2022-04-28 04:21:35,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:21:35,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:21:35,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:21:35,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:21:35,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 115 states have (on average 1.0521739130434782) internal successors, (121), 115 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call 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:35,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2022-04-28 04:21:35,643 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 114 [2022-04-28 04:21:35,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:21:35,644 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2022-04-28 04:21:35,644 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:21:35,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 124 transitions. [2022-04-28 04:21:36,046 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:21:36,046 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2022-04-28 04:21:36,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-28 04:21:36,047 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:21:36,047 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, 1, 1, 1] [2022-04-28 04:21:36,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-04-28 04:21:36,047 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:21:36,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:21:36,047 INFO L85 PathProgramCache]: Analyzing trace with hash -361153865, now seen corresponding path program 43 times [2022-04-28 04:21:36,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:21:36,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [579442645] [2022-04-28 04:21:36,848 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:21:36,849 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:21:36,849 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:21:36,849 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:21:36,849 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:21:36,849 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:21:36,849 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:21:36,849 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:21:37,030 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:21:37,031 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:21:37,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1834491243, now seen corresponding path program 1 times [2022-04-28 04:21:37,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:21:37,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946310776] [2022-04-28 04:21:37,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:21:37,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:21:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:21:37,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:21:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:21:37,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {31048#(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); {31042#true} is VALID [2022-04-28 04:21:37,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {31042#true} assume true; {31042#true} is VALID [2022-04-28 04:21:37,068 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31042#true} {31042#true} #92#return; {31042#true} is VALID [2022-04-28 04:21:37,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {31042#true} call ULTIMATE.init(); {31048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:21:37,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {31048#(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); {31042#true} is VALID [2022-04-28 04:21:37,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {31042#true} assume true; {31042#true} is VALID [2022-04-28 04:21:37,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31042#true} {31042#true} #92#return; {31042#true} is VALID [2022-04-28 04:21:37,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {31042#true} call #t~ret10 := main(); {31042#true} is VALID [2022-04-28 04:21:37,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {31042#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {31047#(= main_~a~0 0)} is VALID [2022-04-28 04:21:37,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {31047#(= main_~a~0 0)} [190] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~e~0_3576 v_main_~e~0_3567)) (.cse1 (= |v_main_#t~pre8_2965| |v_main_#t~pre8_2958|)) (.cse2 (= v_main_~a~0_292 v_main_~a~0_291)) (.cse3 (= |v_main_#t~pre6_351| |v_main_#t~pre6_350|)) (.cse4 (= v_main_~f~0_8833 v_main_~f~0_8790)) (.cse5 (= |v_main_#t~pre5_286| |v_main_#t~pre5_285|)) (.cse6 (= |v_main_#t~pre9_5928| |v_main_#t~pre9_5892|)) (.cse7 (= |v_main_#t~pre4_239| |v_main_#t~pre4_238|))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~pre7_440| |v_main_#t~pre7_438|) (= v_main_~c~0_506 v_main_~c~0_504) (= v_main_~d~0_650 v_main_~d~0_647) .cse3 (= v_main_~b~0_391 v_main_~b~0_389) .cse4 .cse5 .cse6 .cse7) (and .cse0 (= v_main_~b~0_389 v_main_~b~0_391) .cse1 .cse2 (= v_main_~c~0_504 v_main_~c~0_506) (= v_main_~d~0_647 v_main_~d~0_650) .cse3 .cse4 (= |v_main_#t~pre7_438| |v_main_#t~pre7_440|) .cse5 .cse6 .cse7))) InVars {main_~e~0=v_main_~e~0_3576, main_~d~0=v_main_~d~0_650, main_~b~0=v_main_~b~0_391, main_~f~0=v_main_~f~0_8833, main_#t~pre7=|v_main_#t~pre7_440|, main_~c~0=v_main_~c~0_506, main_#t~pre8=|v_main_#t~pre8_2965|, main_#t~pre9=|v_main_#t~pre9_5928|, 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_351|} OutVars{main_~e~0=v_main_~e~0_3567, main_~d~0=v_main_~d~0_647, main_~b~0=v_main_~b~0_389, main_~f~0=v_main_~f~0_8790, main_#t~pre7=|v_main_#t~pre7_438|, main_~c~0=v_main_~c~0_504, main_#t~pre8=|v_main_#t~pre8_2958|, main_#t~pre9=|v_main_#t~pre9_5892|, 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_350|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {31047#(= main_~a~0 0)} is VALID [2022-04-28 04:21:37,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {31047#(= main_~a~0 0)} [189] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {31043#false} is VALID [2022-04-28 04:21:37,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {31043#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {31043#false} is VALID [2022-04-28 04:21:37,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {31043#false} assume !false; {31043#false} is VALID [2022-04-28 04:21:37,070 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:37,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:21:37,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946310776] [2022-04-28 04:21:37,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946310776] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:21:37,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:21:37,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:21:38,994 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:21:38,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [579442645] [2022-04-28 04:21:38,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [579442645] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:21:38,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:21:38,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-04-28 04:21:38,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333256881] [2022-04-28 04:21:38,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:21:38,995 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.111111111111111) internal successors, (114), 53 states have internal predecessors, (114), 1 states have call successors, (2), 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 117 [2022-04-28 04:21:38,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:21:38,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 54 states, 54 states have (on average 2.111111111111111) internal successors, (114), 53 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call 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:39,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:21:39,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-28 04:21:39,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:21:39,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-28 04:21:39,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=2559, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 04:21:39,071 INFO L87 Difference]: Start difference. First operand 119 states and 124 transitions. Second operand has 54 states, 54 states have (on average 2.111111111111111) internal successors, (114), 53 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call 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:46,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:46,278 INFO L93 Difference]: Finished difference Result 163 states and 186 transitions. [2022-04-28 04:21:46,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-28 04:21:46,278 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.111111111111111) internal successors, (114), 53 states have internal predecessors, (114), 1 states have call successors, (2), 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 117 [2022-04-28 04:21:46,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:21:46,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.111111111111111) internal successors, (114), 53 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call 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:46,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 186 transitions. [2022-04-28 04:21:46,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.111111111111111) internal successors, (114), 53 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call 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:46,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 186 transitions. [2022-04-28 04:21:46,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 186 transitions. [2022-04-28 04:21:46,416 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:21:46,417 INFO L225 Difference]: With dead ends: 163 [2022-04-28 04:21:46,417 INFO L226 Difference]: Without dead ends: 148 [2022-04-28 04:21:46,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 46 SyntacticMatches, 20 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2126 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=903, Invalid=10017, Unknown=0, NotChecked=0, Total=10920 [2022-04-28 04:21:46,418 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 267 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4689 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 4855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 4689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:21:46,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 99 Invalid, 4855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 4689 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-28 04:21:46,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-04-28 04:21:46,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 120. [2022-04-28 04:21:46,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:21:46,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand has 120 states, 116 states have (on average 1.0517241379310345) internal successors, (122), 116 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:21:46,524 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand has 120 states, 116 states have (on average 1.0517241379310345) internal successors, (122), 116 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:21:46,524 INFO L87 Difference]: Start difference. First operand 148 states. Second operand has 120 states, 116 states have (on average 1.0517241379310345) internal successors, (122), 116 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:21:46,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:46,525 INFO L93 Difference]: Finished difference Result 148 states and 165 transitions. [2022-04-28 04:21:46,525 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 165 transitions. [2022-04-28 04:21:46,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:21:46,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:21:46,526 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 116 states have (on average 1.0517241379310345) internal successors, (122), 116 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 148 states. [2022-04-28 04:21:46,526 INFO L87 Difference]: Start difference. First operand has 120 states, 116 states have (on average 1.0517241379310345) internal successors, (122), 116 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 148 states. [2022-04-28 04:21:46,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:46,527 INFO L93 Difference]: Finished difference Result 148 states and 165 transitions. [2022-04-28 04:21:46,527 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 165 transitions. [2022-04-28 04:21:46,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:21:46,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:21:46,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:21:46,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:21:46,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 116 states have (on average 1.0517241379310345) internal successors, (122), 116 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:21:46,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2022-04-28 04:21:46,529 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 117 [2022-04-28 04:21:46,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:21:46,530 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2022-04-28 04:21:46,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.111111111111111) internal successors, (114), 53 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call 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:46,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 120 states and 125 transitions. [2022-04-28 04:21:46,945 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:21:46,945 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2022-04-28 04:21:46,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-28 04:21:46,946 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:21:46,946 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, 1, 1, 1] [2022-04-28 04:21:46,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-04-28 04:21:46,946 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:21:46,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:21:46,946 INFO L85 PathProgramCache]: Analyzing trace with hash 739296469, now seen corresponding path program 44 times [2022-04-28 04:21:46,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:21:46,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1997602893] [2022-04-28 04:21:50,649 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:21:50,709 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:21:50,796 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:50,835 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:21:54,914 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:21:54,973 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:21:55,071 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:55,111 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:21:59,197 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:21:59,262 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:21:59,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:21:59,384 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:22:03,466 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:22:03,526 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:22:03,610 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:22:03,649 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:22:03,831 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:22:03,832 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:22:03,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1834552747, now seen corresponding path program 1 times [2022-04-28 04:22:03,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:22:03,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896188252] [2022-04-28 04:22:03,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:22:03,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:22:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:22:03,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:22:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:22:03,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {32071#(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); {32065#true} is VALID [2022-04-28 04:22:03,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {32065#true} assume true; {32065#true} is VALID [2022-04-28 04:22:03,863 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32065#true} {32065#true} #92#return; {32065#true} is VALID [2022-04-28 04:22:03,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {32065#true} call ULTIMATE.init(); {32071#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:22:03,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {32071#(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); {32065#true} is VALID [2022-04-28 04:22:03,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {32065#true} assume true; {32065#true} is VALID [2022-04-28 04:22:03,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32065#true} {32065#true} #92#return; {32065#true} is VALID [2022-04-28 04:22:03,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {32065#true} call #t~ret10 := main(); {32065#true} is VALID [2022-04-28 04:22:03,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {32065#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {32070#(= main_~a~0 0)} is VALID [2022-04-28 04:22:03,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {32070#(= main_~a~0 0)} [192] L23-3-->L23-4_primed: Formula: (and (= v_main_~d~0_694 v_main_~d~0_691) (= |v_main_#t~pre4_244| |v_main_#t~pre4_243|) (= v_main_~b~0_399 v_main_~b~0_397) (= v_main_~c~0_516 v_main_~c~0_514) (= v_main_~a~0_298 v_main_~a~0_297) (= |v_main_#t~pre7_475| |v_main_#t~pre7_473|) (= |v_main_#t~pre9_6131| |v_main_#t~pre9_6094|) (= v_main_~f~0_9118 v_main_~f~0_9074) (= |v_main_#t~pre5_292| |v_main_#t~pre5_291|) (= |v_main_#t~pre8_3043| |v_main_#t~pre8_3036|) (= |v_main_#t~pre6_358| |v_main_#t~pre6_357|) (= v_main_~e~0_3699 v_main_~e~0_3690)) InVars {main_~e~0=v_main_~e~0_3699, main_~d~0=v_main_~d~0_694, main_~b~0=v_main_~b~0_399, main_~f~0=v_main_~f~0_9118, main_#t~pre7=|v_main_#t~pre7_475|, main_~c~0=v_main_~c~0_516, main_#t~pre8=|v_main_#t~pre8_3043|, main_#t~pre9=|v_main_#t~pre9_6131|, 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_358|} OutVars{main_~e~0=v_main_~e~0_3690, main_~d~0=v_main_~d~0_691, main_~b~0=v_main_~b~0_397, main_~f~0=v_main_~f~0_9074, main_#t~pre7=|v_main_#t~pre7_473|, main_~c~0=v_main_~c~0_514, main_#t~pre8=|v_main_#t~pre8_3036|, main_#t~pre9=|v_main_#t~pre9_6094|, 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_357|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {32070#(= main_~a~0 0)} is VALID [2022-04-28 04:22:03,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {32070#(= main_~a~0 0)} [191] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {32066#false} is VALID [2022-04-28 04:22:03,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {32066#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {32066#false} is VALID [2022-04-28 04:22:03,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {32066#false} assume !false; {32066#false} is VALID [2022-04-28 04:22:03,865 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:22:03,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:22:03,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896188252] [2022-04-28 04:22:03,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896188252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:22:03,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:22:03,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:22:06,074 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:22:06,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1997602893] [2022-04-28 04:22:06,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1997602893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:22:06,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:22:06,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-28 04:22:06,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499469140] [2022-04-28 04:22:06,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:22:06,075 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.109090909090909) internal successors, (116), 54 states have internal predecessors, (116), 1 states have call successors, (2), 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 119 [2022-04-28 04:22:06,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:22:06,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 55 states have (on average 2.109090909090909) internal successors, (116), 54 states have internal predecessors, (116), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:22:06,155 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:22:06,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-28 04:22:06,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:22:06,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-28 04:22:06,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=2662, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 04:22:06,156 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand has 55 states, 55 states have (on average 2.109090909090909) internal successors, (116), 54 states have internal predecessors, (116), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:22:13,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:22:13,105 INFO L93 Difference]: Finished difference Result 165 states and 188 transitions. [2022-04-28 04:22:13,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-28 04:22:13,105 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.109090909090909) internal successors, (116), 54 states have internal predecessors, (116), 1 states have call successors, (2), 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 119 [2022-04-28 04:22:13,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:22:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 2.109090909090909) internal successors, (116), 54 states have internal predecessors, (116), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:22:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 188 transitions. [2022-04-28 04:22:13,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 2.109090909090909) internal successors, (116), 54 states have internal predecessors, (116), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:22:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 188 transitions. [2022-04-28 04:22:13,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 188 transitions. [2022-04-28 04:22:13,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:22:13,236 INFO L225 Difference]: With dead ends: 165 [2022-04-28 04:22:13,236 INFO L226 Difference]: Without dead ends: 150 [2022-04-28 04:22:13,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 38 SyntacticMatches, 29 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2313 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=918, Invalid=10424, Unknown=0, NotChecked=0, Total=11342 [2022-04-28 04:22:13,237 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 243 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 4495 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 4651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 4495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:22:13,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 89 Invalid, 4651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 4495 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-28 04:22:13,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-28 04:22:13,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 122. [2022-04-28 04:22:13,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:22:13,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 122 states, 118 states have (on average 1.0508474576271187) internal successors, (124), 118 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:22:13,338 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 122 states, 118 states have (on average 1.0508474576271187) internal successors, (124), 118 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:22:13,338 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 122 states, 118 states have (on average 1.0508474576271187) internal successors, (124), 118 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:22:13,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:22:13,339 INFO L93 Difference]: Finished difference Result 150 states and 167 transitions. [2022-04-28 04:22:13,339 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 167 transitions. [2022-04-28 04:22:13,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:22:13,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:22:13,339 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 118 states have (on average 1.0508474576271187) internal successors, (124), 118 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 150 states. [2022-04-28 04:22:13,339 INFO L87 Difference]: Start difference. First operand has 122 states, 118 states have (on average 1.0508474576271187) internal successors, (124), 118 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 150 states. [2022-04-28 04:22:13,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:22:13,341 INFO L93 Difference]: Finished difference Result 150 states and 167 transitions. [2022-04-28 04:22:13,341 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 167 transitions. [2022-04-28 04:22:13,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:22:13,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:22:13,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:22:13,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:22:13,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 118 states have (on average 1.0508474576271187) internal successors, (124), 118 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:22:13,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2022-04-28 04:22:13,342 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 119 [2022-04-28 04:22:13,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:22:13,342 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2022-04-28 04:22:13,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.109090909090909) internal successors, (116), 54 states have internal predecessors, (116), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:22:13,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 122 states and 127 transitions. [2022-04-28 04:22:13,767 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:22:13,768 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2022-04-28 04:22:13,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-28 04:22:13,768 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:22:13,768 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, 1, 1, 1] [2022-04-28 04:22:13,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-04-28 04:22:13,768 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:22:13,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:22:13,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1710112627, now seen corresponding path program 45 times [2022-04-28 04:22:13,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:22:13,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1012941762] [2022-04-28 04:22:14,562 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:22:14,562 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:22:14,562 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:22:14,562 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:22:14,562 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:22:14,562 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:22:14,562 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:22:14,562 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:22:14,767 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:22:14,768 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:22:14,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1834614251, now seen corresponding path program 1 times [2022-04-28 04:22:14,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:22:14,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883128960] [2022-04-28 04:22:14,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:22:14,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:22:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:22:14,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:22:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:22:14,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {33109#(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); {33103#true} is VALID [2022-04-28 04:22:14,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {33103#true} assume true; {33103#true} is VALID [2022-04-28 04:22:14,788 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33103#true} {33103#true} #92#return; {33103#true} is VALID [2022-04-28 04:22:14,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {33103#true} call ULTIMATE.init(); {33109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:22:14,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {33109#(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); {33103#true} is VALID [2022-04-28 04:22:14,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {33103#true} assume true; {33103#true} is VALID [2022-04-28 04:22:14,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33103#true} {33103#true} #92#return; {33103#true} is VALID [2022-04-28 04:22:14,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {33103#true} call #t~ret10 := main(); {33103#true} is VALID [2022-04-28 04:22:14,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {33103#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {33108#(= main_~a~0 0)} is VALID [2022-04-28 04:22:14,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {33108#(= main_~a~0 0)} [194] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_304 v_main_~a~0_303)) (.cse1 (= |v_main_#t~pre9_6299| |v_main_#t~pre9_6261|)) (.cse2 (= |v_main_#t~pre7_490| |v_main_#t~pre7_488|)) (.cse3 (= v_main_~f~0_9369 v_main_~f~0_9324)) (.cse4 (= |v_main_#t~pre4_249| |v_main_#t~pre4_248|)) (.cse5 (= v_main_~c~0_526 v_main_~c~0_524)) (.cse6 (= |v_main_#t~pre6_365| |v_main_#t~pre6_364|)) (.cse7 (= v_main_~d~0_718 v_main_~d~0_715)) (.cse8 (= v_main_~b~0_407 v_main_~b~0_405)) (.cse9 (= |v_main_#t~pre8_3081| |v_main_#t~pre8_3074|)) (.cse10 (= |v_main_#t~pre5_298| |v_main_#t~pre5_297|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= v_main_~e~0_3753 v_main_~e~0_3762) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~e~0_3762 v_main_~e~0_3753) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) InVars {main_~e~0=v_main_~e~0_3762, main_~d~0=v_main_~d~0_718, main_~b~0=v_main_~b~0_407, main_~f~0=v_main_~f~0_9369, main_#t~pre7=|v_main_#t~pre7_490|, main_~c~0=v_main_~c~0_526, main_#t~pre8=|v_main_#t~pre8_3081|, main_#t~pre9=|v_main_#t~pre9_6299|, 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_365|} OutVars{main_~e~0=v_main_~e~0_3753, main_~d~0=v_main_~d~0_715, main_~b~0=v_main_~b~0_405, main_~f~0=v_main_~f~0_9324, main_#t~pre7=|v_main_#t~pre7_488|, main_~c~0=v_main_~c~0_524, main_#t~pre8=|v_main_#t~pre8_3074|, main_#t~pre9=|v_main_#t~pre9_6261|, 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_364|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {33108#(= main_~a~0 0)} is VALID [2022-04-28 04:22:14,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {33108#(= main_~a~0 0)} [193] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {33104#false} is VALID [2022-04-28 04:22:14,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {33104#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {33104#false} is VALID [2022-04-28 04:22:14,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {33104#false} assume !false; {33104#false} is VALID [2022-04-28 04:22:14,790 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:22:14,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:22:14,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883128960] [2022-04-28 04:22:14,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883128960] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:22:14,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:22:14,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:22:16,647 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:22:16,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1012941762] [2022-04-28 04:22:16,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1012941762] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:22:16,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:22:16,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-04-28 04:22:16,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205952332] [2022-04-28 04:22:16,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:22:16,647 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.107142857142857) internal successors, (118), 55 states have internal predecessors, (118), 1 states have call successors, (2), 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 121 [2022-04-28 04:22:16,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:22:16,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 56 states, 56 states have (on average 2.107142857142857) internal successors, (118), 55 states have internal predecessors, (118), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:22:16,727 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:22:16,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-28 04:22:16,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:22:16,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-28 04:22:16,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=2767, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 04:22:16,728 INFO L87 Difference]: Start difference. First operand 122 states and 127 transitions. Second operand has 56 states, 56 states have (on average 2.107142857142857) internal successors, (118), 55 states have internal predecessors, (118), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)