/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/locks/test_locks_15-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 11:18:15,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:18:15,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:18:15,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:18:15,643 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:18:15,644 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:18:15,647 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:18:15,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:18:15,652 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:18:15,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:18:15,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:18:15,658 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:18:15,658 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:18:15,660 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:18:15,660 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:18:15,663 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:18:15,664 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:18:15,664 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:18:15,666 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:18:15,671 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:18:15,672 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:18:15,673 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:18:15,673 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:18:15,674 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:18:15,675 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:18:15,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:18:15,679 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:18:15,680 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:18:15,680 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:18:15,680 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:18:15,681 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:18:15,681 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:18:15,682 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:18:15,683 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:18:15,683 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:18:15,684 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:18:15,684 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:18:15,684 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:18:15,684 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:18:15,684 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:18:15,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:18:15,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:18:15,686 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 11:18:15,696 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:18:15,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:18:15,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:18:15,697 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:18:15,697 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:18:15,697 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:18:15,698 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:18:15,698 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:18:15,698 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:18:15,698 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:18:15,698 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:18:15,699 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:18:15,699 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:18:15,699 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:18:15,699 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:18:15,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:18:15,699 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:18:15,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:18:15,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:18:15,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:18:15,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:18:15,699 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:18:15,699 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:18:15,700 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:18:15,700 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:18:15,700 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 11:18:15,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:18:15,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:18:15,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:18:15,912 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:18:15,916 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:18:15,917 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_15-2.c [2022-04-15 11:18:15,965 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed9488db3/e04578e447f94adab91a5b404829b8ee/FLAGf92cf6f3d [2022-04-15 11:18:16,332 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:18:16,333 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-2.c [2022-04-15 11:18:16,341 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed9488db3/e04578e447f94adab91a5b404829b8ee/FLAGf92cf6f3d [2022-04-15 11:18:16,352 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed9488db3/e04578e447f94adab91a5b404829b8ee [2022-04-15 11:18:16,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:18:16,356 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:18:16,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:18:16,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:18:16,360 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:18:16,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:18:16" (1/1) ... [2022-04-15 11:18:16,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@599df675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:16, skipping insertion in model container [2022-04-15 11:18:16,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:18:16" (1/1) ... [2022-04-15 11:18:16,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:18:16,382 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:18:16,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-2.c[5628,5641] [2022-04-15 11:18:16,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:18:16,577 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:18:16,607 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-2.c[5628,5641] [2022-04-15 11:18:16,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:18:16,617 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:18:16,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:16 WrapperNode [2022-04-15 11:18:16,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:18:16,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:18:16,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:18:16,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:18:16,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:16" (1/1) ... [2022-04-15 11:18:16,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:16" (1/1) ... [2022-04-15 11:18:16,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:16" (1/1) ... [2022-04-15 11:18:16,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:16" (1/1) ... [2022-04-15 11:18:16,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:16" (1/1) ... [2022-04-15 11:18:16,654 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:16" (1/1) ... [2022-04-15 11:18:16,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:16" (1/1) ... [2022-04-15 11:18:16,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:18:16,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:18:16,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:18:16,659 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:18:16,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:16" (1/1) ... [2022-04-15 11:18:16,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:18:16,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:18:16,688 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 11:18:16,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 11:18:16,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:18:16,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:18:16,718 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:18:16,718 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:18:16,718 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:18:16,718 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:18:16,718 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:18:16,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:18:16,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:18:16,718 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:18:16,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:18:16,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:18:16,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:18:16,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:18:16,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:18:16,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:18:16,778 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:18:16,779 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:18:17,051 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:18:17,058 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:18:17,058 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:18:17,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:18:17 BoogieIcfgContainer [2022-04-15 11:18:17,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:18:17,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:18:17,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:18:17,063 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:18:17,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:18:16" (1/3) ... [2022-04-15 11:18:17,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f184719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:18:17, skipping insertion in model container [2022-04-15 11:18:17,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:16" (2/3) ... [2022-04-15 11:18:17,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f184719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:18:17, skipping insertion in model container [2022-04-15 11:18:17,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:18:17" (3/3) ... [2022-04-15 11:18:17,065 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.c [2022-04-15 11:18:17,069 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:18:17,069 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:18:17,102 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:18:17,106 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 11:18:17,106 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:18:17,118 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 11:18:17,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 11:18:17,123 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:17,124 INFO L499 BasicCegarLoop]: 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-15 11:18:17,124 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:17,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:17,128 INFO L85 PathProgramCache]: Analyzing trace with hash 208658311, now seen corresponding path program 1 times [2022-04-15 11:18:17,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:17,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2039654209] [2022-04-15 11:18:17,139 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:17,140 INFO L85 PathProgramCache]: Analyzing trace with hash 208658311, now seen corresponding path program 2 times [2022-04-15 11:18:17,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:17,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294796181] [2022-04-15 11:18:17,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:17,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:17,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:17,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {69#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {63#true} is VALID [2022-04-15 11:18:17,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#true} assume true; {63#true} is VALID [2022-04-15 11:18:17,373 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63#true} {63#true} #285#return; {63#true} is VALID [2022-04-15 11:18:17,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {63#true} call ULTIMATE.init(); {69#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:17,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {69#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {63#true} is VALID [2022-04-15 11:18:17,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {63#true} assume true; {63#true} is VALID [2022-04-15 11:18:17,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63#true} {63#true} #285#return; {63#true} is VALID [2022-04-15 11:18:17,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {63#true} call #t~ret20 := main(); {63#true} is VALID [2022-04-15 11:18:17,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {63#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {63#true} is VALID [2022-04-15 11:18:17,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {63#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {63#true} is VALID [2022-04-15 11:18:17,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {63#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {63#true} is VALID [2022-04-15 11:18:17,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {63#true} assume 0 != ~p1~0;~lk1~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-15 11:18:17,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {68#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {68#(= main_~lk1~0 1)} is VALID [2022-04-15 11:18:17,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-15 11:18:17,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-15 11:18:17,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-15 11:18:17,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-15 11:18:17,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-15 11:18:17,383 INFO L290 TraceCheckUtils]: 15: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-15 11:18:17,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-15 11:18:17,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {68#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {68#(= main_~lk1~0 1)} is VALID [2022-04-15 11:18:17,386 INFO L290 TraceCheckUtils]: 18: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-15 11:18:17,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-15 11:18:17,387 INFO L290 TraceCheckUtils]: 20: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-15 11:18:17,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-15 11:18:17,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-15 11:18:17,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p1~0; {68#(= main_~lk1~0 1)} is VALID [2022-04-15 11:18:17,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {68#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {64#false} is VALID [2022-04-15 11:18:17,393 INFO L290 TraceCheckUtils]: 25: Hoare triple {64#false} assume !false; {64#false} is VALID [2022-04-15 11:18:17,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-15 11:18:17,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:17,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294796181] [2022-04-15 11:18:17,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294796181] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:17,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:17,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:17,396 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:17,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2039654209] [2022-04-15 11:18:17,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2039654209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:17,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:17,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:17,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326730031] [2022-04-15 11:18:17,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:17,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-15 11:18:17,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:17,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-15 11:18:17,439 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-15 11:18:17,440 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:17,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:17,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:17,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:17,462 INFO L87 Difference]: Start difference. First operand has 60 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 55 states have internal predecessors, (103), 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 5.75) internal successors, (23), 3 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-15 11:18:17,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:17,849 INFO L93 Difference]: Finished difference Result 118 states and 211 transitions. [2022-04-15 11:18:17,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:17,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-15 11:18:17,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:17,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-15 11:18:17,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-15 11:18:17,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-15 11:18:17,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-15 11:18:17,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 211 transitions. [2022-04-15 11:18:18,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:18,029 INFO L225 Difference]: With dead ends: 118 [2022-04-15 11:18:18,029 INFO L226 Difference]: Without dead ends: 103 [2022-04-15 11:18:18,031 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:18:18,033 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 259 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:18,034 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 119 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:18:18,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-15 11:18:18,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2022-04-15 11:18:18,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:18,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:18,062 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:18,063 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:18,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:18,068 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2022-04-15 11:18:18,068 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 189 transitions. [2022-04-15 11:18:18,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:18,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:18,070 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states 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-15 11:18:18,070 INFO L87 Difference]: Start difference. First operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states 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-15 11:18:18,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:18,074 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2022-04-15 11:18:18,074 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 189 transitions. [2022-04-15 11:18:18,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:18,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:18,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:18,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:18,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:18,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 130 transitions. [2022-04-15 11:18:18,079 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 130 transitions. Word has length 26 [2022-04-15 11:18:18,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:18,079 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 130 transitions. [2022-04-15 11:18:18,080 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-15 11:18:18,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 130 transitions. [2022-04-15 11:18:18,190 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-15 11:18:18,190 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 130 transitions. [2022-04-15 11:18:18,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 11:18:18,195 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:18,195 INFO L499 BasicCegarLoop]: 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-15 11:18:18,195 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:18:18,196 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:18,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:18,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1785486395, now seen corresponding path program 1 times [2022-04-15 11:18:18,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:18,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [836477728] [2022-04-15 11:18:18,197 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:18,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1785486395, now seen corresponding path program 2 times [2022-04-15 11:18:18,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:18,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798742604] [2022-04-15 11:18:18,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:18,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:18,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:18,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {659#true} is VALID [2022-04-15 11:18:18,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-15 11:18:18,279 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {659#true} {659#true} #285#return; {659#true} is VALID [2022-04-15 11:18:18,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:18,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {659#true} is VALID [2022-04-15 11:18:18,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-15 11:18:18,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #285#return; {659#true} is VALID [2022-04-15 11:18:18,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret20 := main(); {659#true} is VALID [2022-04-15 11:18:18,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {659#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {659#true} is VALID [2022-04-15 11:18:18,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {659#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {659#true} is VALID [2022-04-15 11:18:18,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {659#true} is VALID [2022-04-15 11:18:18,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#true} assume !(0 != ~p1~0); {664#(= main_~p1~0 0)} is VALID [2022-04-15 11:18:18,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {664#(= main_~p1~0 0)} assume !(0 != ~p2~0); {664#(= main_~p1~0 0)} is VALID [2022-04-15 11:18:18,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-15 11:18:18,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-15 11:18:18,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-15 11:18:18,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-15 11:18:18,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-15 11:18:18,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-15 11:18:18,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-15 11:18:18,290 INFO L290 TraceCheckUtils]: 17: Hoare triple {664#(= main_~p1~0 0)} assume !(0 != ~p10~0); {664#(= main_~p1~0 0)} is VALID [2022-04-15 11:18:18,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-15 11:18:18,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-15 11:18:18,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-15 11:18:18,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-15 11:18:18,293 INFO L290 TraceCheckUtils]: 22: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-15 11:18:18,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p1~0; {660#false} is VALID [2022-04-15 11:18:18,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {660#false} assume 1 != ~lk1~0; {660#false} is VALID [2022-04-15 11:18:18,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-04-15 11:18:18,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:18:18,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:18,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798742604] [2022-04-15 11:18:18,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798742604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:18,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:18,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:18,295 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:18,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [836477728] [2022-04-15 11:18:18,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [836477728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:18,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:18,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:18,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010895718] [2022-04-15 11:18:18,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:18,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-15 11:18:18,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:18,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-15 11:18:18,312 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-15 11:18:18,313 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:18,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:18,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:18,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:18,314 INFO L87 Difference]: Start difference. First operand 71 states and 130 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-15 11:18:18,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:18,555 INFO L93 Difference]: Finished difference Result 168 states and 313 transitions. [2022-04-15 11:18:18,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:18,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-15 11:18:18,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:18,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-15 11:18:18,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2022-04-15 11:18:18,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-15 11:18:18,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2022-04-15 11:18:18,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 282 transitions. [2022-04-15 11:18:18,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:18,729 INFO L225 Difference]: With dead ends: 168 [2022-04-15 11:18:18,729 INFO L226 Difference]: Without dead ends: 103 [2022-04-15 11:18:18,730 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:18:18,732 INFO L913 BasicCegarLoop]: 128 mSDtfsCounter, 223 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:18,733 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 135 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:18:18,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-15 11:18:18,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2022-04-15 11:18:18,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:18,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:18,755 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:18,756 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:18,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:18,761 INFO L93 Difference]: Finished difference Result 103 states and 187 transitions. [2022-04-15 11:18:18,761 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2022-04-15 11:18:18,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:18,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:18,764 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states 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-15 11:18:18,764 INFO L87 Difference]: Start difference. First operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states 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-15 11:18:18,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:18,769 INFO L93 Difference]: Finished difference Result 103 states and 187 transitions. [2022-04-15 11:18:18,769 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2022-04-15 11:18:18,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:18,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:18,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:18,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:18,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:18,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 186 transitions. [2022-04-15 11:18:18,773 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 186 transitions. Word has length 26 [2022-04-15 11:18:18,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:18,774 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 186 transitions. [2022-04-15 11:18:18,774 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-15 11:18:18,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 186 transitions. [2022-04-15 11:18:18,901 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-15 11:18:18,902 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 186 transitions. [2022-04-15 11:18:18,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 11:18:18,906 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:18,906 INFO L499 BasicCegarLoop]: 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, 1] [2022-04-15 11:18:18,911 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:18:18,911 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:18,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:18,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2121315188, now seen corresponding path program 1 times [2022-04-15 11:18:18,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:18,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1708116142] [2022-04-15 11:18:18,915 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:18,915 INFO L85 PathProgramCache]: Analyzing trace with hash -2121315188, now seen corresponding path program 2 times [2022-04-15 11:18:18,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:18,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167141383] [2022-04-15 11:18:18,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:18,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:18,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:18,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {1421#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1415#true} is VALID [2022-04-15 11:18:19,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {1415#true} assume true; {1415#true} is VALID [2022-04-15 11:18:19,000 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1415#true} {1415#true} #285#return; {1415#true} is VALID [2022-04-15 11:18:19,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {1415#true} call ULTIMATE.init(); {1421#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:19,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {1421#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1415#true} is VALID [2022-04-15 11:18:19,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {1415#true} assume true; {1415#true} is VALID [2022-04-15 11:18:19,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1415#true} {1415#true} #285#return; {1415#true} is VALID [2022-04-15 11:18:19,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {1415#true} call #t~ret20 := main(); {1415#true} is VALID [2022-04-15 11:18:19,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {1415#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {1415#true} is VALID [2022-04-15 11:18:19,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {1415#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {1415#true} is VALID [2022-04-15 11:18:19,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {1415#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {1415#true} is VALID [2022-04-15 11:18:19,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {1415#true} assume 0 != ~p1~0;~lk1~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:18:19,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {1420#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:18:19,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:18:19,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:18:19,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:18:19,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:18:19,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:18:19,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:18:19,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:18:19,005 INFO L290 TraceCheckUtils]: 17: Hoare triple {1420#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:18:19,005 INFO L290 TraceCheckUtils]: 18: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:18:19,006 INFO L290 TraceCheckUtils]: 19: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:18:19,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:18:19,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:18:19,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:18:19,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {1420#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1416#false} is VALID [2022-04-15 11:18:19,007 INFO L290 TraceCheckUtils]: 24: Hoare triple {1416#false} assume 0 != ~p2~0; {1416#false} is VALID [2022-04-15 11:18:19,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {1416#false} assume 1 != ~lk2~0; {1416#false} is VALID [2022-04-15 11:18:19,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {1416#false} assume !false; {1416#false} is VALID [2022-04-15 11:18:19,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:18:19,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:19,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167141383] [2022-04-15 11:18:19,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167141383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:19,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:19,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:19,012 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:19,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1708116142] [2022-04-15 11:18:19,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1708116142] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:19,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:19,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:19,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101915316] [2022-04-15 11:18:19,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:19,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 11:18:19,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:19,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:19,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:19,029 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:19,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:19,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:19,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:19,030 INFO L87 Difference]: Start difference. First operand 101 states and 186 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:19,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:19,239 INFO L93 Difference]: Finished difference Result 154 states and 280 transitions. [2022-04-15 11:18:19,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:19,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 11:18:19,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:19,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:19,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 277 transitions. [2022-04-15 11:18:19,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:19,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 277 transitions. [2022-04-15 11:18:19,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 277 transitions. [2022-04-15 11:18:19,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:19,413 INFO L225 Difference]: With dead ends: 154 [2022-04-15 11:18:19,413 INFO L226 Difference]: Without dead ends: 106 [2022-04-15 11:18:19,414 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:18:19,414 INFO L913 BasicCegarLoop]: 156 mSDtfsCounter, 196 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:19,414 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 163 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:18:19,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-15 11:18:19,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2022-04-15 11:18:19,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:19,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:19,424 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:19,424 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:19,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:19,427 INFO L93 Difference]: Finished difference Result 106 states and 189 transitions. [2022-04-15 11:18:19,427 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 189 transitions. [2022-04-15 11:18:19,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:19,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:19,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-15 11:18:19,428 INFO L87 Difference]: Start difference. First operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-15 11:18:19,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:19,430 INFO L93 Difference]: Finished difference Result 106 states and 189 transitions. [2022-04-15 11:18:19,430 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 189 transitions. [2022-04-15 11:18:19,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:19,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:19,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:19,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:19,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:19,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 188 transitions. [2022-04-15 11:18:19,433 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 188 transitions. Word has length 27 [2022-04-15 11:18:19,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:19,434 INFO L478 AbstractCegarLoop]: Abstraction has 104 states and 188 transitions. [2022-04-15 11:18:19,434 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:19,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 188 transitions. [2022-04-15 11:18:19,581 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-15 11:18:19,581 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 188 transitions. [2022-04-15 11:18:19,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 11:18:19,582 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:19,582 INFO L499 BasicCegarLoop]: 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, 1] [2022-04-15 11:18:19,582 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:18:19,582 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:19,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:19,582 INFO L85 PathProgramCache]: Analyzing trace with hash 484708366, now seen corresponding path program 1 times [2022-04-15 11:18:19,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:19,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [267730858] [2022-04-15 11:18:19,583 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:19,583 INFO L85 PathProgramCache]: Analyzing trace with hash 484708366, now seen corresponding path program 2 times [2022-04-15 11:18:19,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:19,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763557593] [2022-04-15 11:18:19,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:19,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:19,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:19,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {2161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-15 11:18:19,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-15 11:18:19,628 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2155#true} {2155#true} #285#return; {2155#true} is VALID [2022-04-15 11:18:19,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:19,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {2161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-15 11:18:19,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-15 11:18:19,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #285#return; {2155#true} is VALID [2022-04-15 11:18:19,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret20 := main(); {2155#true} is VALID [2022-04-15 11:18:19,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {2155#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {2155#true} is VALID [2022-04-15 11:18:19,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {2155#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {2155#true} is VALID [2022-04-15 11:18:19,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {2155#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {2155#true} is VALID [2022-04-15 11:18:19,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {2155#true} assume !(0 != ~p1~0); {2155#true} is VALID [2022-04-15 11:18:19,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {2155#true} assume !(0 != ~p2~0); {2160#(= main_~p2~0 0)} is VALID [2022-04-15 11:18:19,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-15 11:18:19,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-15 11:18:19,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-15 11:18:19,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-15 11:18:19,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-15 11:18:19,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-15 11:18:19,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-15 11:18:19,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {2160#(= main_~p2~0 0)} assume !(0 != ~p10~0); {2160#(= main_~p2~0 0)} is VALID [2022-04-15 11:18:19,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-15 11:18:19,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-15 11:18:19,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-15 11:18:19,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-15 11:18:19,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-15 11:18:19,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {2160#(= main_~p2~0 0)} assume !(0 != ~p1~0); {2160#(= main_~p2~0 0)} is VALID [2022-04-15 11:18:19,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p2~0; {2156#false} is VALID [2022-04-15 11:18:19,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {2156#false} assume 1 != ~lk2~0; {2156#false} is VALID [2022-04-15 11:18:19,635 INFO L290 TraceCheckUtils]: 26: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-15 11:18:19,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:18:19,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:19,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763557593] [2022-04-15 11:18:19,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763557593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:19,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:19,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:19,636 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:19,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [267730858] [2022-04-15 11:18:19,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [267730858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:19,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:19,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:19,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048990150] [2022-04-15 11:18:19,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:19,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 11:18:19,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:19,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:19,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:19,652 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:19,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:19,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:19,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:19,653 INFO L87 Difference]: Start difference. First operand 104 states and 188 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:19,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:19,868 INFO L93 Difference]: Finished difference Result 292 states and 540 transitions. [2022-04-15 11:18:19,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:19,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 11:18:19,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:19,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:19,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2022-04-15 11:18:19,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:19,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2022-04-15 11:18:19,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 280 transitions. [2022-04-15 11:18:20,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:20,090 INFO L225 Difference]: With dead ends: 292 [2022-04-15 11:18:20,090 INFO L226 Difference]: Without dead ends: 197 [2022-04-15 11:18:20,091 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:18:20,092 INFO L913 BasicCegarLoop]: 102 mSDtfsCounter, 248 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:20,093 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 109 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:18:20,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-15 11:18:20,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2022-04-15 11:18:20,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:20,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:20,119 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:20,119 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:20,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:20,124 INFO L93 Difference]: Finished difference Result 197 states and 358 transitions. [2022-04-15 11:18:20,124 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 358 transitions. [2022-04-15 11:18:20,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:20,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:20,125 INFO L74 IsIncluded]: Start isIncluded. First operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 197 states. [2022-04-15 11:18:20,125 INFO L87 Difference]: Start difference. First operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 197 states. [2022-04-15 11:18:20,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:20,130 INFO L93 Difference]: Finished difference Result 197 states and 358 transitions. [2022-04-15 11:18:20,131 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 358 transitions. [2022-04-15 11:18:20,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:20,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:20,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:20,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:20,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:20,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 357 transitions. [2022-04-15 11:18:20,137 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 357 transitions. Word has length 27 [2022-04-15 11:18:20,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:20,138 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 357 transitions. [2022-04-15 11:18:20,138 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:20,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 195 states and 357 transitions. [2022-04-15 11:18:20,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 357 edges. 357 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:20,455 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 357 transitions. [2022-04-15 11:18:20,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 11:18:20,455 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:20,455 INFO L499 BasicCegarLoop]: 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, 1] [2022-04-15 11:18:20,455 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:18:20,456 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:20,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:20,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1816114224, now seen corresponding path program 1 times [2022-04-15 11:18:20,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:20,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [154409464] [2022-04-15 11:18:20,456 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:20,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1816114224, now seen corresponding path program 2 times [2022-04-15 11:18:20,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:20,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956831580] [2022-04-15 11:18:20,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:20,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:20,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:20,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {3541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3535#true} is VALID [2022-04-15 11:18:20,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {3535#true} assume true; {3535#true} is VALID [2022-04-15 11:18:20,496 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3535#true} {3535#true} #285#return; {3535#true} is VALID [2022-04-15 11:18:20,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {3535#true} call ULTIMATE.init(); {3541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:20,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {3541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3535#true} is VALID [2022-04-15 11:18:20,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {3535#true} assume true; {3535#true} is VALID [2022-04-15 11:18:20,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3535#true} {3535#true} #285#return; {3535#true} is VALID [2022-04-15 11:18:20,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {3535#true} call #t~ret20 := main(); {3535#true} is VALID [2022-04-15 11:18:20,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {3535#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {3535#true} is VALID [2022-04-15 11:18:20,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {3535#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {3535#true} is VALID [2022-04-15 11:18:20,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {3535#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {3535#true} is VALID [2022-04-15 11:18:20,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {3535#true} assume !(0 != ~p1~0); {3535#true} is VALID [2022-04-15 11:18:20,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {3535#true} assume 0 != ~p2~0;~lk2~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 11:18:20,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 11:18:20,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 11:18:20,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 11:18:20,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 11:18:20,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 11:18:20,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 11:18:20,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 11:18:20,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {3540#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 11:18:20,500 INFO L290 TraceCheckUtils]: 18: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 11:18:20,500 INFO L290 TraceCheckUtils]: 19: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 11:18:20,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 11:18:20,501 INFO L290 TraceCheckUtils]: 21: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 11:18:20,501 INFO L290 TraceCheckUtils]: 22: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 11:18:20,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {3540#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 11:18:20,502 INFO L290 TraceCheckUtils]: 24: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p2~0; {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 11:18:20,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {3540#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {3536#false} is VALID [2022-04-15 11:18:20,502 INFO L290 TraceCheckUtils]: 26: Hoare triple {3536#false} assume !false; {3536#false} is VALID [2022-04-15 11:18:20,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:18:20,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:20,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956831580] [2022-04-15 11:18:20,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956831580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:20,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:20,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:20,503 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:20,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [154409464] [2022-04-15 11:18:20,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [154409464] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:20,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:20,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:20,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099630768] [2022-04-15 11:18:20,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:20,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 11:18:20,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:20,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:20,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:20,519 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:20,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:20,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:20,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:20,520 INFO L87 Difference]: Start difference. First operand 195 states and 357 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:20,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:20,721 INFO L93 Difference]: Finished difference Result 255 states and 467 transitions. [2022-04-15 11:18:20,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:20,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 11:18:20,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:20,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:20,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-15 11:18:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:20,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-15 11:18:20,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 184 transitions. [2022-04-15 11:18:20,850 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-15 11:18:20,854 INFO L225 Difference]: With dead ends: 255 [2022-04-15 11:18:20,854 INFO L226 Difference]: Without dead ends: 253 [2022-04-15 11:18:20,855 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:18:20,856 INFO L913 BasicCegarLoop]: 181 mSDtfsCounter, 161 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:20,856 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 188 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:18:20,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-15 11:18:20,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 195. [2022-04-15 11:18:20,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:20,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:20,871 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:20,872 INFO L87 Difference]: Start difference. First operand 253 states. Second operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:20,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:20,877 INFO L93 Difference]: Finished difference Result 253 states and 464 transitions. [2022-04-15 11:18:20,877 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 464 transitions. [2022-04-15 11:18:20,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:20,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:20,878 INFO L74 IsIncluded]: Start isIncluded. First operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 253 states. [2022-04-15 11:18:20,878 INFO L87 Difference]: Start difference. First operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 253 states. [2022-04-15 11:18:20,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:20,885 INFO L93 Difference]: Finished difference Result 253 states and 464 transitions. [2022-04-15 11:18:20,885 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 464 transitions. [2022-04-15 11:18:20,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:20,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:20,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:20,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:20,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:20,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 355 transitions. [2022-04-15 11:18:20,892 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 355 transitions. Word has length 27 [2022-04-15 11:18:20,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:20,892 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 355 transitions. [2022-04-15 11:18:20,892 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:20,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 195 states and 355 transitions. [2022-04-15 11:18:21,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 355 edges. 355 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:21,227 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 355 transitions. [2022-04-15 11:18:21,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 11:18:21,228 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:21,228 INFO L499 BasicCegarLoop]: 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, 1, 1] [2022-04-15 11:18:21,228 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:18:21,228 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:21,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:21,229 INFO L85 PathProgramCache]: Analyzing trace with hash 2141269562, now seen corresponding path program 1 times [2022-04-15 11:18:21,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:21,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [712381811] [2022-04-15 11:18:21,229 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:21,229 INFO L85 PathProgramCache]: Analyzing trace with hash 2141269562, now seen corresponding path program 2 times [2022-04-15 11:18:21,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:21,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525542926] [2022-04-15 11:18:21,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:21,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:21,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:21,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {4959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4953#true} is VALID [2022-04-15 11:18:21,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {4953#true} assume true; {4953#true} is VALID [2022-04-15 11:18:21,283 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4953#true} {4953#true} #285#return; {4953#true} is VALID [2022-04-15 11:18:21,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {4953#true} call ULTIMATE.init(); {4959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:21,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {4959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4953#true} is VALID [2022-04-15 11:18:21,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {4953#true} assume true; {4953#true} is VALID [2022-04-15 11:18:21,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4953#true} {4953#true} #285#return; {4953#true} is VALID [2022-04-15 11:18:21,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {4953#true} call #t~ret20 := main(); {4953#true} is VALID [2022-04-15 11:18:21,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {4953#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {4953#true} is VALID [2022-04-15 11:18:21,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {4953#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {4953#true} is VALID [2022-04-15 11:18:21,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {4953#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {4953#true} is VALID [2022-04-15 11:18:21,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {4953#true} assume !(0 != ~p1~0); {4953#true} is VALID [2022-04-15 11:18:21,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {4953#true} assume !(0 != ~p2~0); {4953#true} is VALID [2022-04-15 11:18:21,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {4953#true} assume 0 != ~p3~0;~lk3~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 11:18:21,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 11:18:21,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 11:18:21,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 11:18:21,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 11:18:21,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 11:18:21,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 11:18:21,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {4958#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 11:18:21,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 11:18:21,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 11:18:21,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 11:18:21,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 11:18:21,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 11:18:21,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {4958#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 11:18:21,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {4958#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 11:18:21,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p3~0; {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 11:18:21,311 INFO L290 TraceCheckUtils]: 26: Hoare triple {4958#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {4954#false} is VALID [2022-04-15 11:18:21,311 INFO L290 TraceCheckUtils]: 27: Hoare triple {4954#false} assume !false; {4954#false} is VALID [2022-04-15 11:18:21,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:18:21,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:21,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525542926] [2022-04-15 11:18:21,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525542926] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:21,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:21,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:21,312 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:21,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [712381811] [2022-04-15 11:18:21,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [712381811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:21,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:21,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:21,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172000443] [2022-04-15 11:18:21,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:21,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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-15 11:18:21,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:21,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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-15 11:18:21,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:21,328 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:21,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:21,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:21,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:21,329 INFO L87 Difference]: Start difference. First operand 195 states and 355 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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-15 11:18:21,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:21,564 INFO L93 Difference]: Finished difference Result 371 states and 683 transitions. [2022-04-15 11:18:21,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:21,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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-15 11:18:21,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:21,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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-15 11:18:21,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-15 11:18:21,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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-15 11:18:21,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-15 11:18:21,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 183 transitions. [2022-04-15 11:18:21,686 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-15 11:18:21,692 INFO L225 Difference]: With dead ends: 371 [2022-04-15 11:18:21,692 INFO L226 Difference]: Without dead ends: 369 [2022-04-15 11:18:21,693 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:18:21,693 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 239 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:21,693 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 106 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:18:21,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-04-15 11:18:21,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 263. [2022-04-15 11:18:21,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:21,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 369 states. Second operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:21,706 INFO L74 IsIncluded]: Start isIncluded. First operand 369 states. Second operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:21,707 INFO L87 Difference]: Start difference. First operand 369 states. Second operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:21,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:21,714 INFO L93 Difference]: Finished difference Result 369 states and 678 transitions. [2022-04-15 11:18:21,714 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 678 transitions. [2022-04-15 11:18:21,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:21,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:21,715 INFO L74 IsIncluded]: Start isIncluded. First operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 369 states. [2022-04-15 11:18:21,715 INFO L87 Difference]: Start difference. First operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 369 states. [2022-04-15 11:18:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:21,723 INFO L93 Difference]: Finished difference Result 369 states and 678 transitions. [2022-04-15 11:18:21,723 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 678 transitions. [2022-04-15 11:18:21,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:21,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:21,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:21,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:21,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:21,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 477 transitions. [2022-04-15 11:18:21,730 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 477 transitions. Word has length 28 [2022-04-15 11:18:21,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:21,730 INFO L478 AbstractCegarLoop]: Abstraction has 263 states and 477 transitions. [2022-04-15 11:18:21,730 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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-15 11:18:21,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 263 states and 477 transitions. [2022-04-15 11:18:22,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 477 edges. 477 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:22,111 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 477 transitions. [2022-04-15 11:18:22,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 11:18:22,111 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:22,111 INFO L499 BasicCegarLoop]: 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, 1, 1] [2022-04-15 11:18:22,112 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:18:22,112 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:22,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:22,112 INFO L85 PathProgramCache]: Analyzing trace with hash 147124856, now seen corresponding path program 1 times [2022-04-15 11:18:22,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:22,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [37584021] [2022-04-15 11:18:22,112 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:22,112 INFO L85 PathProgramCache]: Analyzing trace with hash 147124856, now seen corresponding path program 2 times [2022-04-15 11:18:22,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:22,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988730200] [2022-04-15 11:18:22,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:22,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:22,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:22,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {6977#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {6971#true} is VALID [2022-04-15 11:18:22,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {6971#true} assume true; {6971#true} is VALID [2022-04-15 11:18:22,173 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6971#true} {6971#true} #285#return; {6971#true} is VALID [2022-04-15 11:18:22,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {6971#true} call ULTIMATE.init(); {6977#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:22,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {6977#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {6971#true} is VALID [2022-04-15 11:18:22,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {6971#true} assume true; {6971#true} is VALID [2022-04-15 11:18:22,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6971#true} {6971#true} #285#return; {6971#true} is VALID [2022-04-15 11:18:22,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {6971#true} call #t~ret20 := main(); {6971#true} is VALID [2022-04-15 11:18:22,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {6971#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {6971#true} is VALID [2022-04-15 11:18:22,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {6971#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {6971#true} is VALID [2022-04-15 11:18:22,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {6971#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {6971#true} is VALID [2022-04-15 11:18:22,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {6971#true} assume !(0 != ~p1~0); {6971#true} is VALID [2022-04-15 11:18:22,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {6971#true} assume !(0 != ~p2~0); {6971#true} is VALID [2022-04-15 11:18:22,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {6971#true} assume !(0 != ~p3~0); {6976#(= main_~p3~0 0)} is VALID [2022-04-15 11:18:22,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-15 11:18:22,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-15 11:18:22,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-15 11:18:22,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-15 11:18:22,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-15 11:18:22,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-15 11:18:22,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {6976#(= main_~p3~0 0)} assume !(0 != ~p10~0); {6976#(= main_~p3~0 0)} is VALID [2022-04-15 11:18:22,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-15 11:18:22,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-15 11:18:22,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-15 11:18:22,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-15 11:18:22,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-15 11:18:22,183 INFO L290 TraceCheckUtils]: 23: Hoare triple {6976#(= main_~p3~0 0)} assume !(0 != ~p1~0); {6976#(= main_~p3~0 0)} is VALID [2022-04-15 11:18:22,183 INFO L290 TraceCheckUtils]: 24: Hoare triple {6976#(= main_~p3~0 0)} assume !(0 != ~p2~0); {6976#(= main_~p3~0 0)} is VALID [2022-04-15 11:18:22,183 INFO L290 TraceCheckUtils]: 25: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p3~0; {6972#false} is VALID [2022-04-15 11:18:22,184 INFO L290 TraceCheckUtils]: 26: Hoare triple {6972#false} assume 1 != ~lk3~0; {6972#false} is VALID [2022-04-15 11:18:22,184 INFO L290 TraceCheckUtils]: 27: Hoare triple {6972#false} assume !false; {6972#false} is VALID [2022-04-15 11:18:22,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:18:22,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:22,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988730200] [2022-04-15 11:18:22,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988730200] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:22,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:22,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:22,184 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:22,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [37584021] [2022-04-15 11:18:22,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [37584021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:22,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:22,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:22,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94662990] [2022-04-15 11:18:22,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:22,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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-15 11:18:22,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:22,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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-15 11:18:22,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:22,200 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:22,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:22,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:22,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:22,200 INFO L87 Difference]: Start difference. First operand 263 states and 477 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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-15 11:18:22,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:22,436 INFO L93 Difference]: Finished difference Result 631 states and 1155 transitions. [2022-04-15 11:18:22,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:22,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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-15 11:18:22,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:22,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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-15 11:18:22,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 276 transitions. [2022-04-15 11:18:22,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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-15 11:18:22,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 276 transitions. [2022-04-15 11:18:22,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 276 transitions. [2022-04-15 11:18:22,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:22,625 INFO L225 Difference]: With dead ends: 631 [2022-04-15 11:18:22,625 INFO L226 Difference]: Without dead ends: 377 [2022-04-15 11:18:22,626 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:18:22,626 INFO L913 BasicCegarLoop]: 132 mSDtfsCounter, 211 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:22,627 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 139 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:18:22,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-04-15 11:18:22,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2022-04-15 11:18:22,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:22,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 377 states. Second operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:22,650 INFO L74 IsIncluded]: Start isIncluded. First operand 377 states. Second operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:22,650 INFO L87 Difference]: Start difference. First operand 377 states. Second operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:22,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:22,658 INFO L93 Difference]: Finished difference Result 377 states and 680 transitions. [2022-04-15 11:18:22,658 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 680 transitions. [2022-04-15 11:18:22,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:22,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:22,659 INFO L74 IsIncluded]: Start isIncluded. First operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 377 states. [2022-04-15 11:18:22,660 INFO L87 Difference]: Start difference. First operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 377 states. [2022-04-15 11:18:22,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:22,674 INFO L93 Difference]: Finished difference Result 377 states and 680 transitions. [2022-04-15 11:18:22,674 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 680 transitions. [2022-04-15 11:18:22,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:22,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:22,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:22,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:22,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:22,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 679 transitions. [2022-04-15 11:18:22,685 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 679 transitions. Word has length 28 [2022-04-15 11:18:22,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:22,685 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 679 transitions. [2022-04-15 11:18:22,685 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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-15 11:18:22,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 375 states and 679 transitions. [2022-04-15 11:18:23,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 679 edges. 679 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:23,266 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 679 transitions. [2022-04-15 11:18:23,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 11:18:23,266 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:23,266 INFO L499 BasicCegarLoop]: 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, 1, 1, 1] [2022-04-15 11:18:23,267 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:18:23,267 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:23,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:23,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1955059427, now seen corresponding path program 1 times [2022-04-15 11:18:23,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:23,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2021919027] [2022-04-15 11:18:23,267 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:23,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1955059427, now seen corresponding path program 2 times [2022-04-15 11:18:23,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:23,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386582864] [2022-04-15 11:18:23,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:23,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:23,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:23,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {9755#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {9749#true} is VALID [2022-04-15 11:18:23,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {9749#true} assume true; {9749#true} is VALID [2022-04-15 11:18:23,305 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9749#true} {9749#true} #285#return; {9749#true} is VALID [2022-04-15 11:18:23,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {9749#true} call ULTIMATE.init(); {9755#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:23,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {9755#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {9749#true} is VALID [2022-04-15 11:18:23,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {9749#true} assume true; {9749#true} is VALID [2022-04-15 11:18:23,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9749#true} {9749#true} #285#return; {9749#true} is VALID [2022-04-15 11:18:23,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {9749#true} call #t~ret20 := main(); {9749#true} is VALID [2022-04-15 11:18:23,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {9749#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {9749#true} is VALID [2022-04-15 11:18:23,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {9749#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {9749#true} is VALID [2022-04-15 11:18:23,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {9749#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {9749#true} is VALID [2022-04-15 11:18:23,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {9749#true} assume !(0 != ~p1~0); {9749#true} is VALID [2022-04-15 11:18:23,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {9749#true} assume !(0 != ~p2~0); {9749#true} is VALID [2022-04-15 11:18:23,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {9749#true} assume 0 != ~p3~0;~lk3~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:18:23,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:18:23,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:18:23,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:18:23,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:18:23,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:18:23,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:18:23,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {9754#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:18:23,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:18:23,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:18:23,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:18:23,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:18:23,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:18:23,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {9754#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:18:23,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {9754#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:18:23,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {9754#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {9750#false} is VALID [2022-04-15 11:18:23,310 INFO L290 TraceCheckUtils]: 26: Hoare triple {9750#false} assume 0 != ~p4~0; {9750#false} is VALID [2022-04-15 11:18:23,310 INFO L290 TraceCheckUtils]: 27: Hoare triple {9750#false} assume 1 != ~lk4~0; {9750#false} is VALID [2022-04-15 11:18:23,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {9750#false} assume !false; {9750#false} is VALID [2022-04-15 11:18:23,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:18:23,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:23,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386582864] [2022-04-15 11:18:23,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386582864] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:23,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:23,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:23,311 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:23,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2021919027] [2022-04-15 11:18:23,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2021919027] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:23,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:23,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:23,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854558423] [2022-04-15 11:18:23,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:23,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 11:18:23,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:23,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:23,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:23,334 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:23,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:23,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:23,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:23,335 INFO L87 Difference]: Start difference. First operand 375 states and 679 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:23,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:23,576 INFO L93 Difference]: Finished difference Result 565 states and 1021 transitions. [2022-04-15 11:18:23,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:23,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 11:18:23,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:23,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:23,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 271 transitions. [2022-04-15 11:18:23,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:23,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 271 transitions. [2022-04-15 11:18:23,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 271 transitions. [2022-04-15 11:18:23,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:23,742 INFO L225 Difference]: With dead ends: 565 [2022-04-15 11:18:23,742 INFO L226 Difference]: Without dead ends: 383 [2022-04-15 11:18:23,743 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:18:23,743 INFO L913 BasicCegarLoop]: 150 mSDtfsCounter, 194 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:23,743 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 157 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:18:23,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-04-15 11:18:23,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 381. [2022-04-15 11:18:23,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:23,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 383 states. Second operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:23,762 INFO L74 IsIncluded]: Start isIncluded. First operand 383 states. Second operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:23,762 INFO L87 Difference]: Start difference. First operand 383 states. Second operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:23,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:23,769 INFO L93 Difference]: Finished difference Result 383 states and 684 transitions. [2022-04-15 11:18:23,769 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 684 transitions. [2022-04-15 11:18:23,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:23,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:23,771 INFO L74 IsIncluded]: Start isIncluded. First operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 383 states. [2022-04-15 11:18:23,772 INFO L87 Difference]: Start difference. First operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 383 states. [2022-04-15 11:18:23,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:23,779 INFO L93 Difference]: Finished difference Result 383 states and 684 transitions. [2022-04-15 11:18:23,779 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 684 transitions. [2022-04-15 11:18:23,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:23,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:23,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:23,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:23,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:23,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 683 transitions. [2022-04-15 11:18:23,788 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 683 transitions. Word has length 29 [2022-04-15 11:18:23,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:23,788 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 683 transitions. [2022-04-15 11:18:23,788 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:23,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 381 states and 683 transitions. [2022-04-15 11:18:24,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 683 edges. 683 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:24,365 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 683 transitions. [2022-04-15 11:18:24,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 11:18:24,366 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:24,366 INFO L499 BasicCegarLoop]: 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, 1, 1, 1] [2022-04-15 11:18:24,366 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:18:24,366 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:24,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:24,367 INFO L85 PathProgramCache]: Analyzing trace with hash 266115685, now seen corresponding path program 1 times [2022-04-15 11:18:24,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:24,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1751193159] [2022-04-15 11:18:24,367 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:24,367 INFO L85 PathProgramCache]: Analyzing trace with hash 266115685, now seen corresponding path program 2 times [2022-04-15 11:18:24,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:24,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125183153] [2022-04-15 11:18:24,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:24,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:24,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:24,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {12425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {12419#true} is VALID [2022-04-15 11:18:24,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {12419#true} assume true; {12419#true} is VALID [2022-04-15 11:18:24,433 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12419#true} {12419#true} #285#return; {12419#true} is VALID [2022-04-15 11:18:24,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {12419#true} call ULTIMATE.init(); {12425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:24,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {12425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {12419#true} is VALID [2022-04-15 11:18:24,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {12419#true} assume true; {12419#true} is VALID [2022-04-15 11:18:24,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12419#true} {12419#true} #285#return; {12419#true} is VALID [2022-04-15 11:18:24,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {12419#true} call #t~ret20 := main(); {12419#true} is VALID [2022-04-15 11:18:24,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {12419#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {12419#true} is VALID [2022-04-15 11:18:24,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {12419#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {12419#true} is VALID [2022-04-15 11:18:24,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {12419#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {12419#true} is VALID [2022-04-15 11:18:24,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {12419#true} assume !(0 != ~p1~0); {12419#true} is VALID [2022-04-15 11:18:24,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {12419#true} assume !(0 != ~p2~0); {12419#true} is VALID [2022-04-15 11:18:24,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {12419#true} assume !(0 != ~p3~0); {12419#true} is VALID [2022-04-15 11:18:24,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {12419#true} assume 0 != ~p4~0;~lk4~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 11:18:24,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 11:18:24,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 11:18:24,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 11:18:24,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 11:18:24,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 11:18:24,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {12424#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 11:18:24,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 11:18:24,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 11:18:24,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 11:18:24,443 INFO L290 TraceCheckUtils]: 21: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 11:18:24,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 11:18:24,444 INFO L290 TraceCheckUtils]: 23: Hoare triple {12424#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 11:18:24,444 INFO L290 TraceCheckUtils]: 24: Hoare triple {12424#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 11:18:24,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {12424#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 11:18:24,444 INFO L290 TraceCheckUtils]: 26: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p4~0; {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 11:18:24,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {12424#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {12420#false} is VALID [2022-04-15 11:18:24,445 INFO L290 TraceCheckUtils]: 28: Hoare triple {12420#false} assume !false; {12420#false} is VALID [2022-04-15 11:18:24,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:18:24,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:24,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125183153] [2022-04-15 11:18:24,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125183153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:24,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:24,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:24,447 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:24,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1751193159] [2022-04-15 11:18:24,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1751193159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:24,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:24,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:24,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715915342] [2022-04-15 11:18:24,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:24,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 11:18:24,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:24,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:24,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:24,462 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:24,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:24,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:24,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:24,462 INFO L87 Difference]: Start difference. First operand 381 states and 683 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:24,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:24,744 INFO L93 Difference]: Finished difference Result 717 states and 1301 transitions. [2022-04-15 11:18:24,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:24,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 11:18:24,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:24,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:24,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2022-04-15 11:18:24,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:24,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2022-04-15 11:18:24,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 179 transitions. [2022-04-15 11:18:24,890 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-15 11:18:24,926 INFO L225 Difference]: With dead ends: 717 [2022-04-15 11:18:24,926 INFO L226 Difference]: Without dead ends: 715 [2022-04-15 11:18:24,926 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:18:24,927 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 232 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:24,927 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 105 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:18:24,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-04-15 11:18:24,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 521. [2022-04-15 11:18:24,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:24,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 715 states. Second operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:24,990 INFO L74 IsIncluded]: Start isIncluded. First operand 715 states. Second operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:24,992 INFO L87 Difference]: Start difference. First operand 715 states. Second operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:25,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:25,022 INFO L93 Difference]: Finished difference Result 715 states and 1292 transitions. [2022-04-15 11:18:25,022 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1292 transitions. [2022-04-15 11:18:25,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:25,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:25,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 715 states. [2022-04-15 11:18:25,026 INFO L87 Difference]: Start difference. First operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 715 states. [2022-04-15 11:18:25,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:25,057 INFO L93 Difference]: Finished difference Result 715 states and 1292 transitions. [2022-04-15 11:18:25,057 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1292 transitions. [2022-04-15 11:18:25,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:25,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:25,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:25,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:25,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:25,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 923 transitions. [2022-04-15 11:18:25,087 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 923 transitions. Word has length 29 [2022-04-15 11:18:25,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:25,087 INFO L478 AbstractCegarLoop]: Abstraction has 521 states and 923 transitions. [2022-04-15 11:18:25,087 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:25,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 521 states and 923 transitions. [2022-04-15 11:18:25,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 923 edges. 923 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:25,967 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 923 transitions. [2022-04-15 11:18:25,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 11:18:25,971 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:25,971 INFO L499 BasicCegarLoop]: 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, 1, 1, 1] [2022-04-15 11:18:25,971 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:18:25,971 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:25,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:25,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1728029021, now seen corresponding path program 1 times [2022-04-15 11:18:25,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:25,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1002572859] [2022-04-15 11:18:25,972 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:25,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1728029021, now seen corresponding path program 2 times [2022-04-15 11:18:25,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:25,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982887595] [2022-04-15 11:18:25,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:25,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:26,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:26,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {16343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {16337#true} is VALID [2022-04-15 11:18:26,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {16337#true} assume true; {16337#true} is VALID [2022-04-15 11:18:26,035 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16337#true} {16337#true} #285#return; {16337#true} is VALID [2022-04-15 11:18:26,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {16337#true} call ULTIMATE.init(); {16343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:26,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {16343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {16337#true} is VALID [2022-04-15 11:18:26,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {16337#true} assume true; {16337#true} is VALID [2022-04-15 11:18:26,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16337#true} {16337#true} #285#return; {16337#true} is VALID [2022-04-15 11:18:26,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {16337#true} call #t~ret20 := main(); {16337#true} is VALID [2022-04-15 11:18:26,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {16337#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {16337#true} is VALID [2022-04-15 11:18:26,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {16337#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {16337#true} is VALID [2022-04-15 11:18:26,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {16337#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {16337#true} is VALID [2022-04-15 11:18:26,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {16337#true} assume !(0 != ~p1~0); {16337#true} is VALID [2022-04-15 11:18:26,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {16337#true} assume !(0 != ~p2~0); {16337#true} is VALID [2022-04-15 11:18:26,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {16337#true} assume !(0 != ~p3~0); {16337#true} is VALID [2022-04-15 11:18:26,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {16337#true} assume !(0 != ~p4~0); {16342#(= main_~p4~0 0)} is VALID [2022-04-15 11:18:26,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-15 11:18:26,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-15 11:18:26,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-15 11:18:26,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-15 11:18:26,038 INFO L290 TraceCheckUtils]: 16: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-15 11:18:26,038 INFO L290 TraceCheckUtils]: 17: Hoare triple {16342#(= main_~p4~0 0)} assume !(0 != ~p10~0); {16342#(= main_~p4~0 0)} is VALID [2022-04-15 11:18:26,038 INFO L290 TraceCheckUtils]: 18: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-15 11:18:26,039 INFO L290 TraceCheckUtils]: 19: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-15 11:18:26,039 INFO L290 TraceCheckUtils]: 20: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-15 11:18:26,039 INFO L290 TraceCheckUtils]: 21: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-15 11:18:26,039 INFO L290 TraceCheckUtils]: 22: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-15 11:18:26,040 INFO L290 TraceCheckUtils]: 23: Hoare triple {16342#(= main_~p4~0 0)} assume !(0 != ~p1~0); {16342#(= main_~p4~0 0)} is VALID [2022-04-15 11:18:26,040 INFO L290 TraceCheckUtils]: 24: Hoare triple {16342#(= main_~p4~0 0)} assume !(0 != ~p2~0); {16342#(= main_~p4~0 0)} is VALID [2022-04-15 11:18:26,040 INFO L290 TraceCheckUtils]: 25: Hoare triple {16342#(= main_~p4~0 0)} assume !(0 != ~p3~0); {16342#(= main_~p4~0 0)} is VALID [2022-04-15 11:18:26,040 INFO L290 TraceCheckUtils]: 26: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p4~0; {16338#false} is VALID [2022-04-15 11:18:26,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {16338#false} assume 1 != ~lk4~0; {16338#false} is VALID [2022-04-15 11:18:26,041 INFO L290 TraceCheckUtils]: 28: Hoare triple {16338#false} assume !false; {16338#false} is VALID [2022-04-15 11:18:26,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:18:26,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:26,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982887595] [2022-04-15 11:18:26,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982887595] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:26,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:26,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:26,041 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:26,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1002572859] [2022-04-15 11:18:26,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1002572859] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:26,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:26,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:26,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755511078] [2022-04-15 11:18:26,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:26,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 11:18:26,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:26,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:26,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:26,056 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:26,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:26,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:26,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:26,057 INFO L87 Difference]: Start difference. First operand 521 states and 923 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:26,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:26,348 INFO L93 Difference]: Finished difference Result 1245 states and 2221 transitions. [2022-04-15 11:18:26,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:26,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 11:18:26,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:26,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:26,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 273 transitions. [2022-04-15 11:18:26,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:26,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 273 transitions. [2022-04-15 11:18:26,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 273 transitions. [2022-04-15 11:18:26,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:26,531 INFO L225 Difference]: With dead ends: 1245 [2022-04-15 11:18:26,531 INFO L226 Difference]: Without dead ends: 739 [2022-04-15 11:18:26,532 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:18:26,532 INFO L913 BasicCegarLoop]: 134 mSDtfsCounter, 205 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:26,533 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 141 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:18:26,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2022-04-15 11:18:26,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 737. [2022-04-15 11:18:26,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:26,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 739 states. Second operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:26,571 INFO L74 IsIncluded]: Start isIncluded. First operand 739 states. Second operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:26,572 INFO L87 Difference]: Start difference. First operand 739 states. Second operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:26,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:26,591 INFO L93 Difference]: Finished difference Result 739 states and 1304 transitions. [2022-04-15 11:18:26,591 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1304 transitions. [2022-04-15 11:18:26,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:26,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:26,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 739 states. [2022-04-15 11:18:26,595 INFO L87 Difference]: Start difference. First operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 739 states. [2022-04-15 11:18:26,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:26,615 INFO L93 Difference]: Finished difference Result 739 states and 1304 transitions. [2022-04-15 11:18:26,615 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1304 transitions. [2022-04-15 11:18:26,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:26,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:26,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:26,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:26,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:26,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1303 transitions. [2022-04-15 11:18:26,655 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1303 transitions. Word has length 29 [2022-04-15 11:18:26,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:26,655 INFO L478 AbstractCegarLoop]: Abstraction has 737 states and 1303 transitions. [2022-04-15 11:18:26,655 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:26,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 737 states and 1303 transitions. [2022-04-15 11:18:27,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1303 edges. 1303 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:27,773 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1303 transitions. [2022-04-15 11:18:27,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 11:18:27,774 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:27,774 INFO L499 BasicCegarLoop]: 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, 1, 1, 1, 1] [2022-04-15 11:18:27,774 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:18:27,774 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:27,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:27,774 INFO L85 PathProgramCache]: Analyzing trace with hash -340135571, now seen corresponding path program 1 times [2022-04-15 11:18:27,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:27,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1127674974] [2022-04-15 11:18:27,775 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:27,775 INFO L85 PathProgramCache]: Analyzing trace with hash -340135571, now seen corresponding path program 2 times [2022-04-15 11:18:27,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:27,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006764848] [2022-04-15 11:18:27,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:27,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:27,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:27,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {21797#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {21791#true} is VALID [2022-04-15 11:18:27,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {21791#true} assume true; {21791#true} is VALID [2022-04-15 11:18:27,806 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21791#true} {21791#true} #285#return; {21791#true} is VALID [2022-04-15 11:18:27,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {21791#true} call ULTIMATE.init(); {21797#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:27,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {21797#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {21791#true} is VALID [2022-04-15 11:18:27,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {21791#true} assume true; {21791#true} is VALID [2022-04-15 11:18:27,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21791#true} {21791#true} #285#return; {21791#true} is VALID [2022-04-15 11:18:27,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {21791#true} call #t~ret20 := main(); {21791#true} is VALID [2022-04-15 11:18:27,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {21791#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {21791#true} is VALID [2022-04-15 11:18:27,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {21791#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {21791#true} is VALID [2022-04-15 11:18:27,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {21791#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {21791#true} is VALID [2022-04-15 11:18:27,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {21791#true} assume !(0 != ~p1~0); {21791#true} is VALID [2022-04-15 11:18:27,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {21791#true} assume !(0 != ~p2~0); {21791#true} is VALID [2022-04-15 11:18:27,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {21791#true} assume !(0 != ~p3~0); {21791#true} is VALID [2022-04-15 11:18:27,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {21791#true} assume 0 != ~p4~0;~lk4~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:18:27,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:18:27,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:18:27,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:18:27,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:18:27,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:18:27,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {21796#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:18:27,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:18:27,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:18:27,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:18:27,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:18:27,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:18:27,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {21796#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:18:27,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {21796#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:18:27,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {21796#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:18:27,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {21796#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {21792#false} is VALID [2022-04-15 11:18:27,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {21792#false} assume 0 != ~p5~0; {21792#false} is VALID [2022-04-15 11:18:27,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {21792#false} assume 1 != ~lk5~0; {21792#false} is VALID [2022-04-15 11:18:27,812 INFO L290 TraceCheckUtils]: 29: Hoare triple {21792#false} assume !false; {21792#false} is VALID [2022-04-15 11:18:27,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:18:27,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:27,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006764848] [2022-04-15 11:18:27,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006764848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:27,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:27,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:27,813 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:27,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1127674974] [2022-04-15 11:18:27,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1127674974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:27,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:27,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:27,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605384683] [2022-04-15 11:18:27,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:27,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 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-15 11:18:27,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:27,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 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-15 11:18:27,830 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-15 11:18:27,830 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:27,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:27,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:27,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:27,830 INFO L87 Difference]: Start difference. First operand 737 states and 1303 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 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-15 11:18:28,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:28,135 INFO L93 Difference]: Finished difference Result 1105 states and 1949 transitions. [2022-04-15 11:18:28,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:28,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 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-15 11:18:28,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:28,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 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-15 11:18:28,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 268 transitions. [2022-04-15 11:18:28,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 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-15 11:18:28,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 268 transitions. [2022-04-15 11:18:28,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 268 transitions. [2022-04-15 11:18:28,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 268 edges. 268 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:28,339 INFO L225 Difference]: With dead ends: 1105 [2022-04-15 11:18:28,340 INFO L226 Difference]: Without dead ends: 747 [2022-04-15 11:18:28,340 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:18:28,341 INFO L913 BasicCegarLoop]: 147 mSDtfsCounter, 193 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:28,341 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 154 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:18:28,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-04-15 11:18:28,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 745. [2022-04-15 11:18:28,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:28,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 747 states. Second operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:28,401 INFO L74 IsIncluded]: Start isIncluded. First operand 747 states. Second operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:28,402 INFO L87 Difference]: Start difference. First operand 747 states. Second operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:28,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:28,426 INFO L93 Difference]: Finished difference Result 747 states and 1304 transitions. [2022-04-15 11:18:28,427 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1304 transitions. [2022-04-15 11:18:28,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:28,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:28,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 747 states. [2022-04-15 11:18:28,429 INFO L87 Difference]: Start difference. First operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 747 states. [2022-04-15 11:18:28,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:28,449 INFO L93 Difference]: Finished difference Result 747 states and 1304 transitions. [2022-04-15 11:18:28,449 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1304 transitions. [2022-04-15 11:18:28,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:28,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:28,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:28,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:28,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:28,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1303 transitions. [2022-04-15 11:18:28,476 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1303 transitions. Word has length 30 [2022-04-15 11:18:28,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:28,476 INFO L478 AbstractCegarLoop]: Abstraction has 745 states and 1303 transitions. [2022-04-15 11:18:28,476 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 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-15 11:18:28,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 745 states and 1303 transitions. [2022-04-15 11:18:29,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1303 edges. 1303 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:29,611 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1303 transitions. [2022-04-15 11:18:29,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 11:18:29,611 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:29,611 INFO L499 BasicCegarLoop]: 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, 1, 1, 1, 1] [2022-04-15 11:18:29,611 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:18:29,612 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:29,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:29,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2029079313, now seen corresponding path program 1 times [2022-04-15 11:18:29,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:29,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1564956921] [2022-04-15 11:18:29,612 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:29,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2029079313, now seen corresponding path program 2 times [2022-04-15 11:18:29,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:29,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424792176] [2022-04-15 11:18:29,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:29,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:29,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:29,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:29,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {27003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {26997#true} is VALID [2022-04-15 11:18:29,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {26997#true} assume true; {26997#true} is VALID [2022-04-15 11:18:29,659 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26997#true} {26997#true} #285#return; {26997#true} is VALID [2022-04-15 11:18:29,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {26997#true} call ULTIMATE.init(); {27003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:29,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {27003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {26997#true} is VALID [2022-04-15 11:18:29,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {26997#true} assume true; {26997#true} is VALID [2022-04-15 11:18:29,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26997#true} {26997#true} #285#return; {26997#true} is VALID [2022-04-15 11:18:29,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {26997#true} call #t~ret20 := main(); {26997#true} is VALID [2022-04-15 11:18:29,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {26997#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {26997#true} is VALID [2022-04-15 11:18:29,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {26997#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {26997#true} is VALID [2022-04-15 11:18:29,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {26997#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {26997#true} is VALID [2022-04-15 11:18:29,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {26997#true} assume !(0 != ~p1~0); {26997#true} is VALID [2022-04-15 11:18:29,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {26997#true} assume !(0 != ~p2~0); {26997#true} is VALID [2022-04-15 11:18:29,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {26997#true} assume !(0 != ~p3~0); {26997#true} is VALID [2022-04-15 11:18:29,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {26997#true} assume !(0 != ~p4~0); {26997#true} is VALID [2022-04-15 11:18:29,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {26997#true} assume 0 != ~p5~0;~lk5~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 11:18:29,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 11:18:29,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 11:18:29,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 11:18:29,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 11:18:29,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {27002#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 11:18:29,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 11:18:29,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 11:18:29,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 11:18:29,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 11:18:29,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 11:18:29,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {27002#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 11:18:29,664 INFO L290 TraceCheckUtils]: 24: Hoare triple {27002#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 11:18:29,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {27002#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 11:18:29,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {27002#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 11:18:29,665 INFO L290 TraceCheckUtils]: 27: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p5~0; {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 11:18:29,665 INFO L290 TraceCheckUtils]: 28: Hoare triple {27002#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {26998#false} is VALID [2022-04-15 11:18:29,665 INFO L290 TraceCheckUtils]: 29: Hoare triple {26998#false} assume !false; {26998#false} is VALID [2022-04-15 11:18:29,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:18:29,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:29,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424792176] [2022-04-15 11:18:29,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424792176] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:29,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:29,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:29,666 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:29,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1564956921] [2022-04-15 11:18:29,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1564956921] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:29,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:29,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:29,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94328364] [2022-04-15 11:18:29,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:29,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 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-15 11:18:29,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:29,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 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-15 11:18:29,684 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-15 11:18:29,684 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:29,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:29,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:29,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:29,684 INFO L87 Difference]: Start difference. First operand 745 states and 1303 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 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-15 11:18:30,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:30,032 INFO L93 Difference]: Finished difference Result 1389 states and 2465 transitions. [2022-04-15 11:18:30,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:30,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 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-15 11:18:30,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:30,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 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-15 11:18:30,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-15 11:18:30,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 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-15 11:18:30,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-15 11:18:30,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 175 transitions. [2022-04-15 11:18:30,140 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-15 11:18:30,210 INFO L225 Difference]: With dead ends: 1389 [2022-04-15 11:18:30,210 INFO L226 Difference]: Without dead ends: 1387 [2022-04-15 11:18:30,211 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:18:30,211 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 225 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:30,211 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 104 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:18:30,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2022-04-15 11:18:30,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1033. [2022-04-15 11:18:30,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:30,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1387 states. Second operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:30,283 INFO L74 IsIncluded]: Start isIncluded. First operand 1387 states. Second operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:30,284 INFO L87 Difference]: Start difference. First operand 1387 states. Second operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:30,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:30,341 INFO L93 Difference]: Finished difference Result 1387 states and 2448 transitions. [2022-04-15 11:18:30,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 2448 transitions. [2022-04-15 11:18:30,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:30,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:30,344 INFO L74 IsIncluded]: Start isIncluded. First operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1387 states. [2022-04-15 11:18:30,345 INFO L87 Difference]: Start difference. First operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1387 states. [2022-04-15 11:18:30,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:30,402 INFO L93 Difference]: Finished difference Result 1387 states and 2448 transitions. [2022-04-15 11:18:30,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 2448 transitions. [2022-04-15 11:18:30,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:30,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:30,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:30,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:30,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:30,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1775 transitions. [2022-04-15 11:18:30,467 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1775 transitions. Word has length 30 [2022-04-15 11:18:30,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:30,468 INFO L478 AbstractCegarLoop]: Abstraction has 1033 states and 1775 transitions. [2022-04-15 11:18:30,468 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 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-15 11:18:30,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1033 states and 1775 transitions. [2022-04-15 11:18:31,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1775 edges. 1775 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:31,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1775 transitions. [2022-04-15 11:18:31,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 11:18:31,987 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:31,987 INFO L499 BasicCegarLoop]: 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, 1, 1, 1, 1] [2022-04-15 11:18:31,987 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 11:18:31,988 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:31,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:31,988 INFO L85 PathProgramCache]: Analyzing trace with hash 271743277, now seen corresponding path program 1 times [2022-04-15 11:18:31,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:31,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1583032546] [2022-04-15 11:18:31,988 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:31,988 INFO L85 PathProgramCache]: Analyzing trace with hash 271743277, now seen corresponding path program 2 times [2022-04-15 11:18:31,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:31,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818154944] [2022-04-15 11:18:31,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:31,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:32,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:32,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {34633#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {34627#true} is VALID [2022-04-15 11:18:32,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {34627#true} assume true; {34627#true} is VALID [2022-04-15 11:18:32,027 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34627#true} {34627#true} #285#return; {34627#true} is VALID [2022-04-15 11:18:32,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {34627#true} call ULTIMATE.init(); {34633#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:32,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {34633#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {34627#true} is VALID [2022-04-15 11:18:32,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {34627#true} assume true; {34627#true} is VALID [2022-04-15 11:18:32,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34627#true} {34627#true} #285#return; {34627#true} is VALID [2022-04-15 11:18:32,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {34627#true} call #t~ret20 := main(); {34627#true} is VALID [2022-04-15 11:18:32,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {34627#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {34627#true} is VALID [2022-04-15 11:18:32,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {34627#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {34627#true} is VALID [2022-04-15 11:18:32,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {34627#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {34627#true} is VALID [2022-04-15 11:18:32,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {34627#true} assume !(0 != ~p1~0); {34627#true} is VALID [2022-04-15 11:18:32,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {34627#true} assume !(0 != ~p2~0); {34627#true} is VALID [2022-04-15 11:18:32,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {34627#true} assume !(0 != ~p3~0); {34627#true} is VALID [2022-04-15 11:18:32,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {34627#true} assume !(0 != ~p4~0); {34627#true} is VALID [2022-04-15 11:18:32,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {34627#true} assume !(0 != ~p5~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-15 11:18:32,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-15 11:18:32,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-15 11:18:32,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-15 11:18:32,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-15 11:18:32,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {34632#(= main_~p5~0 0)} assume !(0 != ~p10~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-15 11:18:32,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-15 11:18:32,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-15 11:18:32,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-15 11:18:32,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-15 11:18:32,031 INFO L290 TraceCheckUtils]: 22: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-15 11:18:32,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {34632#(= main_~p5~0 0)} assume !(0 != ~p1~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-15 11:18:32,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {34632#(= main_~p5~0 0)} assume !(0 != ~p2~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-15 11:18:32,031 INFO L290 TraceCheckUtils]: 25: Hoare triple {34632#(= main_~p5~0 0)} assume !(0 != ~p3~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-15 11:18:32,032 INFO L290 TraceCheckUtils]: 26: Hoare triple {34632#(= main_~p5~0 0)} assume !(0 != ~p4~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-15 11:18:32,032 INFO L290 TraceCheckUtils]: 27: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p5~0; {34628#false} is VALID [2022-04-15 11:18:32,032 INFO L290 TraceCheckUtils]: 28: Hoare triple {34628#false} assume 1 != ~lk5~0; {34628#false} is VALID [2022-04-15 11:18:32,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {34628#false} assume !false; {34628#false} is VALID [2022-04-15 11:18:32,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:18:32,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:32,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818154944] [2022-04-15 11:18:32,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818154944] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:32,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:32,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:32,033 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:32,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1583032546] [2022-04-15 11:18:32,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1583032546] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:32,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:32,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:32,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647880708] [2022-04-15 11:18:32,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:32,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 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-15 11:18:32,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:32,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 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-15 11:18:32,048 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-15 11:18:32,048 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:32,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:32,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:32,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:32,049 INFO L87 Difference]: Start difference. First operand 1033 states and 1775 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 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-15 11:18:32,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:32,603 INFO L93 Difference]: Finished difference Result 2461 states and 4257 transitions. [2022-04-15 11:18:32,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:32,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 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-15 11:18:32,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:32,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 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-15 11:18:32,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 270 transitions. [2022-04-15 11:18:32,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 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-15 11:18:32,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 270 transitions. [2022-04-15 11:18:32,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 270 transitions. [2022-04-15 11:18:32,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:32,840 INFO L225 Difference]: With dead ends: 2461 [2022-04-15 11:18:32,840 INFO L226 Difference]: Without dead ends: 1451 [2022-04-15 11:18:32,841 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:18:32,842 INFO L913 BasicCegarLoop]: 136 mSDtfsCounter, 199 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:32,842 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 143 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:18:32,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2022-04-15 11:18:32,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1449. [2022-04-15 11:18:32,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:32,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1451 states. Second operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:32,930 INFO L74 IsIncluded]: Start isIncluded. First operand 1451 states. Second operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:32,931 INFO L87 Difference]: Start difference. First operand 1451 states. Second operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:32,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:32,990 INFO L93 Difference]: Finished difference Result 1451 states and 2488 transitions. [2022-04-15 11:18:32,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2488 transitions. [2022-04-15 11:18:32,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:32,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:32,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1451 states. [2022-04-15 11:18:32,995 INFO L87 Difference]: Start difference. First operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1451 states. [2022-04-15 11:18:33,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:33,057 INFO L93 Difference]: Finished difference Result 1451 states and 2488 transitions. [2022-04-15 11:18:33,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2488 transitions. [2022-04-15 11:18:33,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:33,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:33,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:33,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:33,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:33,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2487 transitions. [2022-04-15 11:18:33,152 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2487 transitions. Word has length 30 [2022-04-15 11:18:33,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:33,152 INFO L478 AbstractCegarLoop]: Abstraction has 1449 states and 2487 transitions. [2022-04-15 11:18:33,156 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 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-15 11:18:33,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1449 states and 2487 transitions. [2022-04-15 11:18:35,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2487 edges. 2487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:35,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2487 transitions. [2022-04-15 11:18:35,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 11:18:35,368 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:35,368 INFO L499 BasicCegarLoop]: 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, 1, 1, 1, 1, 1] [2022-04-15 11:18:35,368 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 11:18:35,368 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:35,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:35,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1523263864, now seen corresponding path program 1 times [2022-04-15 11:18:35,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:35,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [344991638] [2022-04-15 11:18:35,369 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:35,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1523263864, now seen corresponding path program 2 times [2022-04-15 11:18:35,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:35,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110985686] [2022-04-15 11:18:35,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:35,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:35,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:35,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {45367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {45361#true} is VALID [2022-04-15 11:18:35,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {45361#true} assume true; {45361#true} is VALID [2022-04-15 11:18:35,425 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45361#true} {45361#true} #285#return; {45361#true} is VALID [2022-04-15 11:18:35,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {45361#true} call ULTIMATE.init(); {45367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:35,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {45367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {45361#true} is VALID [2022-04-15 11:18:35,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {45361#true} assume true; {45361#true} is VALID [2022-04-15 11:18:35,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45361#true} {45361#true} #285#return; {45361#true} is VALID [2022-04-15 11:18:35,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {45361#true} call #t~ret20 := main(); {45361#true} is VALID [2022-04-15 11:18:35,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {45361#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {45361#true} is VALID [2022-04-15 11:18:35,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {45361#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {45361#true} is VALID [2022-04-15 11:18:35,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {45361#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {45361#true} is VALID [2022-04-15 11:18:35,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {45361#true} assume !(0 != ~p1~0); {45361#true} is VALID [2022-04-15 11:18:35,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {45361#true} assume !(0 != ~p2~0); {45361#true} is VALID [2022-04-15 11:18:35,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {45361#true} assume !(0 != ~p3~0); {45361#true} is VALID [2022-04-15 11:18:35,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {45361#true} assume !(0 != ~p4~0); {45361#true} is VALID [2022-04-15 11:18:35,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {45361#true} assume 0 != ~p5~0;~lk5~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:18:35,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:18:35,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:18:35,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:18:35,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:18:35,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:18:35,427 INFO L290 TraceCheckUtils]: 18: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:18:35,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:18:35,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:18:35,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:18:35,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:18:35,430 INFO L290 TraceCheckUtils]: 23: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:18:35,430 INFO L290 TraceCheckUtils]: 24: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:18:35,430 INFO L290 TraceCheckUtils]: 25: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:18:35,430 INFO L290 TraceCheckUtils]: 26: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:18:35,431 INFO L290 TraceCheckUtils]: 27: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {45362#false} is VALID [2022-04-15 11:18:35,431 INFO L290 TraceCheckUtils]: 28: Hoare triple {45362#false} assume 0 != ~p6~0; {45362#false} is VALID [2022-04-15 11:18:35,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {45362#false} assume 1 != ~lk6~0; {45362#false} is VALID [2022-04-15 11:18:35,431 INFO L290 TraceCheckUtils]: 30: Hoare triple {45362#false} assume !false; {45362#false} is VALID [2022-04-15 11:18:35,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:18:35,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:35,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110985686] [2022-04-15 11:18:35,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110985686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:35,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:35,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:35,432 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:35,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [344991638] [2022-04-15 11:18:35,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [344991638] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:35,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:35,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:35,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696899553] [2022-04-15 11:18:35,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:35,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 11:18:35,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:35,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:35,448 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-15 11:18:35,448 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:35,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:35,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:35,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:35,449 INFO L87 Difference]: Start difference. First operand 1449 states and 2487 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:35,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:35,922 INFO L93 Difference]: Finished difference Result 2173 states and 3721 transitions. [2022-04-15 11:18:35,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:35,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 11:18:35,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:35,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:35,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 265 transitions. [2022-04-15 11:18:35,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:35,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 265 transitions. [2022-04-15 11:18:35,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 265 transitions. [2022-04-15 11:18:36,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:36,174 INFO L225 Difference]: With dead ends: 2173 [2022-04-15 11:18:36,174 INFO L226 Difference]: Without dead ends: 1467 [2022-04-15 11:18:36,175 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:18:36,175 INFO L913 BasicCegarLoop]: 144 mSDtfsCounter, 192 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:36,176 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 151 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:18:36,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2022-04-15 11:18:36,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1465. [2022-04-15 11:18:36,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:36,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1467 states. Second operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:36,275 INFO L74 IsIncluded]: Start isIncluded. First operand 1467 states. Second operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:36,276 INFO L87 Difference]: Start difference. First operand 1467 states. Second operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:36,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:36,336 INFO L93 Difference]: Finished difference Result 1467 states and 2488 transitions. [2022-04-15 11:18:36,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2488 transitions. [2022-04-15 11:18:36,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:36,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:36,339 INFO L74 IsIncluded]: Start isIncluded. First operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1467 states. [2022-04-15 11:18:36,340 INFO L87 Difference]: Start difference. First operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1467 states. [2022-04-15 11:18:36,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:36,401 INFO L93 Difference]: Finished difference Result 1467 states and 2488 transitions. [2022-04-15 11:18:36,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2488 transitions. [2022-04-15 11:18:36,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:36,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:36,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:36,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:36,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:36,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 2487 transitions. [2022-04-15 11:18:36,498 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 2487 transitions. Word has length 31 [2022-04-15 11:18:36,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:36,498 INFO L478 AbstractCegarLoop]: Abstraction has 1465 states and 2487 transitions. [2022-04-15 11:18:36,498 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:36,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1465 states and 2487 transitions. [2022-04-15 11:18:38,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2487 edges. 2487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:38,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 2487 transitions. [2022-04-15 11:18:38,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 11:18:38,696 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:38,696 INFO L499 BasicCegarLoop]: 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, 1, 1, 1, 1, 1] [2022-04-15 11:18:38,696 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 11:18:38,696 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:38,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:38,697 INFO L85 PathProgramCache]: Analyzing trace with hash -165679878, now seen corresponding path program 1 times [2022-04-15 11:18:38,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:38,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1923219108] [2022-04-15 11:18:38,697 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:38,697 INFO L85 PathProgramCache]: Analyzing trace with hash -165679878, now seen corresponding path program 2 times [2022-04-15 11:18:38,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:38,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926702231] [2022-04-15 11:18:38,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:38,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:38,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:38,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {55589#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {55583#true} is VALID [2022-04-15 11:18:38,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {55583#true} assume true; {55583#true} is VALID [2022-04-15 11:18:38,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55583#true} {55583#true} #285#return; {55583#true} is VALID [2022-04-15 11:18:38,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {55583#true} call ULTIMATE.init(); {55589#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:38,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {55589#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {55583#true} is VALID [2022-04-15 11:18:38,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {55583#true} assume true; {55583#true} is VALID [2022-04-15 11:18:38,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55583#true} {55583#true} #285#return; {55583#true} is VALID [2022-04-15 11:18:38,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {55583#true} call #t~ret20 := main(); {55583#true} is VALID [2022-04-15 11:18:38,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {55583#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {55583#true} is VALID [2022-04-15 11:18:38,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {55583#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {55583#true} is VALID [2022-04-15 11:18:38,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {55583#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {55583#true} is VALID [2022-04-15 11:18:38,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {55583#true} assume !(0 != ~p1~0); {55583#true} is VALID [2022-04-15 11:18:38,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {55583#true} assume !(0 != ~p2~0); {55583#true} is VALID [2022-04-15 11:18:38,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {55583#true} assume !(0 != ~p3~0); {55583#true} is VALID [2022-04-15 11:18:38,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {55583#true} assume !(0 != ~p4~0); {55583#true} is VALID [2022-04-15 11:18:38,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {55583#true} assume !(0 != ~p5~0); {55583#true} is VALID [2022-04-15 11:18:38,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {55583#true} assume 0 != ~p6~0;~lk6~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 11:18:38,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 11:18:38,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 11:18:38,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 11:18:38,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 11:18:38,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 11:18:38,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 11:18:38,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 11:18:38,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 11:18:38,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 11:18:38,741 INFO L290 TraceCheckUtils]: 23: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 11:18:38,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 11:18:38,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 11:18:38,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 11:18:38,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 11:18:38,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p6~0; {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 11:18:38,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {55588#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {55584#false} is VALID [2022-04-15 11:18:38,742 INFO L290 TraceCheckUtils]: 30: Hoare triple {55584#false} assume !false; {55584#false} is VALID [2022-04-15 11:18:38,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:18:38,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:38,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926702231] [2022-04-15 11:18:38,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926702231] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:38,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:38,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:38,743 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:38,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1923219108] [2022-04-15 11:18:38,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1923219108] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:38,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:38,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:38,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911297299] [2022-04-15 11:18:38,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:38,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 11:18:38,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:38,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:38,761 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-15 11:18:38,762 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:38,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:38,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:38,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:38,763 INFO L87 Difference]: Start difference. First operand 1465 states and 2487 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:39,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:39,406 INFO L93 Difference]: Finished difference Result 2701 states and 4665 transitions. [2022-04-15 11:18:39,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:39,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 11:18:39,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:39,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:39,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-15 11:18:39,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:39,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-15 11:18:39,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 171 transitions. [2022-04-15 11:18:39,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:39,793 INFO L225 Difference]: With dead ends: 2701 [2022-04-15 11:18:39,793 INFO L226 Difference]: Without dead ends: 2699 [2022-04-15 11:18:39,793 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:18:39,794 INFO L913 BasicCegarLoop]: 96 mSDtfsCounter, 218 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:39,794 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 103 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:18:39,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2022-04-15 11:18:39,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2057. [2022-04-15 11:18:39,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:39,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2699 states. Second operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:39,927 INFO L74 IsIncluded]: Start isIncluded. First operand 2699 states. Second operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:39,928 INFO L87 Difference]: Start difference. First operand 2699 states. Second operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:40,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:40,148 INFO L93 Difference]: Finished difference Result 2699 states and 4632 transitions. [2022-04-15 11:18:40,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4632 transitions. [2022-04-15 11:18:40,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:40,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:40,153 INFO L74 IsIncluded]: Start isIncluded. First operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2699 states. [2022-04-15 11:18:40,154 INFO L87 Difference]: Start difference. First operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2699 states. [2022-04-15 11:18:40,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:40,371 INFO L93 Difference]: Finished difference Result 2699 states and 4632 transitions. [2022-04-15 11:18:40,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4632 transitions. [2022-04-15 11:18:40,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:40,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:40,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:40,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:40,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:40,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 3415 transitions. [2022-04-15 11:18:40,570 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 3415 transitions. Word has length 31 [2022-04-15 11:18:40,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:40,570 INFO L478 AbstractCegarLoop]: Abstraction has 2057 states and 3415 transitions. [2022-04-15 11:18:40,570 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:40,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2057 states and 3415 transitions. [2022-04-15 11:18:43,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3415 edges. 3415 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:43,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 3415 transitions. [2022-04-15 11:18:43,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 11:18:43,651 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:43,651 INFO L499 BasicCegarLoop]: 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, 1, 1, 1, 1, 1] [2022-04-15 11:18:43,651 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 11:18:43,651 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:43,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:43,651 INFO L85 PathProgramCache]: Analyzing trace with hash 2135142712, now seen corresponding path program 1 times [2022-04-15 11:18:43,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:43,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1062534892] [2022-04-15 11:18:43,652 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:43,652 INFO L85 PathProgramCache]: Analyzing trace with hash 2135142712, now seen corresponding path program 2 times [2022-04-15 11:18:43,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:43,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079597220] [2022-04-15 11:18:43,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:43,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:43,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:43,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {70515#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {70509#true} is VALID [2022-04-15 11:18:43,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {70509#true} assume true; {70509#true} is VALID [2022-04-15 11:18:43,693 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70509#true} {70509#true} #285#return; {70509#true} is VALID [2022-04-15 11:18:43,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {70509#true} call ULTIMATE.init(); {70515#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:43,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {70515#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {70509#true} is VALID [2022-04-15 11:18:43,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {70509#true} assume true; {70509#true} is VALID [2022-04-15 11:18:43,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70509#true} {70509#true} #285#return; {70509#true} is VALID [2022-04-15 11:18:43,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {70509#true} call #t~ret20 := main(); {70509#true} is VALID [2022-04-15 11:18:43,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {70509#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {70509#true} is VALID [2022-04-15 11:18:43,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {70509#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {70509#true} is VALID [2022-04-15 11:18:43,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {70509#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {70509#true} is VALID [2022-04-15 11:18:43,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {70509#true} assume !(0 != ~p1~0); {70509#true} is VALID [2022-04-15 11:18:43,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {70509#true} assume !(0 != ~p2~0); {70509#true} is VALID [2022-04-15 11:18:43,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {70509#true} assume !(0 != ~p3~0); {70509#true} is VALID [2022-04-15 11:18:43,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {70509#true} assume !(0 != ~p4~0); {70509#true} is VALID [2022-04-15 11:18:43,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {70509#true} assume !(0 != ~p5~0); {70509#true} is VALID [2022-04-15 11:18:43,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {70509#true} assume !(0 != ~p6~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-15 11:18:43,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-15 11:18:43,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-15 11:18:43,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-15 11:18:43,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p10~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-15 11:18:43,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-15 11:18:43,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-15 11:18:43,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-15 11:18:43,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-15 11:18:43,696 INFO L290 TraceCheckUtils]: 22: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-15 11:18:43,696 INFO L290 TraceCheckUtils]: 23: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p1~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-15 11:18:43,697 INFO L290 TraceCheckUtils]: 24: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p2~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-15 11:18:43,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p3~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-15 11:18:43,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p4~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-15 11:18:43,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p5~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-15 11:18:43,697 INFO L290 TraceCheckUtils]: 28: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p6~0; {70510#false} is VALID [2022-04-15 11:18:43,698 INFO L290 TraceCheckUtils]: 29: Hoare triple {70510#false} assume 1 != ~lk6~0; {70510#false} is VALID [2022-04-15 11:18:43,698 INFO L290 TraceCheckUtils]: 30: Hoare triple {70510#false} assume !false; {70510#false} is VALID [2022-04-15 11:18:43,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:18:43,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:43,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079597220] [2022-04-15 11:18:43,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079597220] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:43,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:43,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:43,698 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:43,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1062534892] [2022-04-15 11:18:43,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1062534892] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:43,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:43,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:43,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582949048] [2022-04-15 11:18:43,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:43,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 11:18:43,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:43,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:43,712 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-15 11:18:43,712 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:43,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:43,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:43,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:43,713 INFO L87 Difference]: Start difference. First operand 2057 states and 3415 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:45,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:45,202 INFO L93 Difference]: Finished difference Result 4877 states and 8153 transitions. [2022-04-15 11:18:45,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:45,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 11:18:45,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:45,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:45,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 267 transitions. [2022-04-15 11:18:45,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:45,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 267 transitions. [2022-04-15 11:18:45,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 267 transitions. [2022-04-15 11:18:45,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:45,671 INFO L225 Difference]: With dead ends: 4877 [2022-04-15 11:18:45,671 INFO L226 Difference]: Without dead ends: 2859 [2022-04-15 11:18:45,674 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:18:45,674 INFO L913 BasicCegarLoop]: 138 mSDtfsCounter, 193 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:45,674 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 145 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:18:45,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2022-04-15 11:18:45,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2857. [2022-04-15 11:18:45,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:45,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2859 states. Second operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:45,875 INFO L74 IsIncluded]: Start isIncluded. First operand 2859 states. Second operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:45,876 INFO L87 Difference]: Start difference. First operand 2859 states. Second operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:46,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:46,103 INFO L93 Difference]: Finished difference Result 2859 states and 4744 transitions. [2022-04-15 11:18:46,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 4744 transitions. [2022-04-15 11:18:46,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:46,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:46,109 INFO L74 IsIncluded]: Start isIncluded. First operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2859 states. [2022-04-15 11:18:46,110 INFO L87 Difference]: Start difference. First operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2859 states. [2022-04-15 11:18:46,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:46,338 INFO L93 Difference]: Finished difference Result 2859 states and 4744 transitions. [2022-04-15 11:18:46,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 4744 transitions. [2022-04-15 11:18:46,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:46,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:46,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:46,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:46,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:46,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2857 states and 4743 transitions. [2022-04-15 11:18:46,731 INFO L78 Accepts]: Start accepts. Automaton has 2857 states and 4743 transitions. Word has length 31 [2022-04-15 11:18:46,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:46,731 INFO L478 AbstractCegarLoop]: Abstraction has 2857 states and 4743 transitions. [2022-04-15 11:18:46,732 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:46,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2857 states and 4743 transitions. [2022-04-15 11:18:51,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4743 edges. 4743 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:51,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 4743 transitions. [2022-04-15 11:18:51,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 11:18:51,242 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:51,242 INFO L499 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2022-04-15 11:18:51,242 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 11:18:51,242 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:51,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:51,242 INFO L85 PathProgramCache]: Analyzing trace with hash -840895454, now seen corresponding path program 1 times [2022-04-15 11:18:51,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:51,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1550093765] [2022-04-15 11:18:51,243 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:51,243 INFO L85 PathProgramCache]: Analyzing trace with hash -840895454, now seen corresponding path program 2 times [2022-04-15 11:18:51,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:51,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271597355] [2022-04-15 11:18:51,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:51,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:51,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:51,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {91713#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {91707#true} is VALID [2022-04-15 11:18:51,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {91707#true} assume true; {91707#true} is VALID [2022-04-15 11:18:51,284 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {91707#true} {91707#true} #285#return; {91707#true} is VALID [2022-04-15 11:18:51,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {91707#true} call ULTIMATE.init(); {91713#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:51,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {91713#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {91707#true} is VALID [2022-04-15 11:18:51,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {91707#true} assume true; {91707#true} is VALID [2022-04-15 11:18:51,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91707#true} {91707#true} #285#return; {91707#true} is VALID [2022-04-15 11:18:51,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {91707#true} call #t~ret20 := main(); {91707#true} is VALID [2022-04-15 11:18:51,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {91707#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {91707#true} is VALID [2022-04-15 11:18:51,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {91707#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {91707#true} is VALID [2022-04-15 11:18:51,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {91707#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {91707#true} is VALID [2022-04-15 11:18:51,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {91707#true} assume !(0 != ~p1~0); {91707#true} is VALID [2022-04-15 11:18:51,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {91707#true} assume !(0 != ~p2~0); {91707#true} is VALID [2022-04-15 11:18:51,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {91707#true} assume !(0 != ~p3~0); {91707#true} is VALID [2022-04-15 11:18:51,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {91707#true} assume !(0 != ~p4~0); {91707#true} is VALID [2022-04-15 11:18:51,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {91707#true} assume !(0 != ~p5~0); {91707#true} is VALID [2022-04-15 11:18:51,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {91707#true} assume 0 != ~p6~0;~lk6~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:18:51,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:18:51,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:18:51,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:18:51,293 INFO L290 TraceCheckUtils]: 17: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:18:51,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:18:51,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:18:51,294 INFO L290 TraceCheckUtils]: 20: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:18:51,294 INFO L290 TraceCheckUtils]: 21: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:18:51,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:18:51,295 INFO L290 TraceCheckUtils]: 23: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:18:51,295 INFO L290 TraceCheckUtils]: 24: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:18:51,295 INFO L290 TraceCheckUtils]: 25: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:18:51,295 INFO L290 TraceCheckUtils]: 26: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:18:51,296 INFO L290 TraceCheckUtils]: 27: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:18:51,296 INFO L290 TraceCheckUtils]: 28: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {91708#false} is VALID [2022-04-15 11:18:51,296 INFO L290 TraceCheckUtils]: 29: Hoare triple {91708#false} assume 0 != ~p7~0; {91708#false} is VALID [2022-04-15 11:18:51,296 INFO L290 TraceCheckUtils]: 30: Hoare triple {91708#false} assume 1 != ~lk7~0; {91708#false} is VALID [2022-04-15 11:18:51,296 INFO L290 TraceCheckUtils]: 31: Hoare triple {91708#false} assume !false; {91708#false} is VALID [2022-04-15 11:18:51,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:18:51,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:51,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271597355] [2022-04-15 11:18:51,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271597355] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:51,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:51,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:51,297 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:51,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1550093765] [2022-04-15 11:18:51,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1550093765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:51,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:51,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:51,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766882671] [2022-04-15 11:18:51,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:51,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-15 11:18:51,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:51,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-15 11:18:51,314 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-15 11:18:51,314 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:51,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:51,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:51,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:51,315 INFO L87 Difference]: Start difference. First operand 2857 states and 4743 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-15 11:18:52,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:52,550 INFO L93 Difference]: Finished difference Result 4285 states and 7097 transitions. [2022-04-15 11:18:52,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:52,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-15 11:18:52,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:52,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-15 11:18:52,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2022-04-15 11:18:52,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-15 11:18:52,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2022-04-15 11:18:52,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 262 transitions. [2022-04-15 11:18:52,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:53,034 INFO L225 Difference]: With dead ends: 4285 [2022-04-15 11:18:53,034 INFO L226 Difference]: Without dead ends: 2891 [2022-04-15 11:18:53,036 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:18:53,036 INFO L913 BasicCegarLoop]: 141 mSDtfsCounter, 191 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:53,036 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 148 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:18:53,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2022-04-15 11:18:53,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 2889. [2022-04-15 11:18:53,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:53,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2891 states. Second operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:53,236 INFO L74 IsIncluded]: Start isIncluded. First operand 2891 states. Second operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:53,239 INFO L87 Difference]: Start difference. First operand 2891 states. Second operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:53,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:53,471 INFO L93 Difference]: Finished difference Result 2891 states and 4744 transitions. [2022-04-15 11:18:53,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 4744 transitions. [2022-04-15 11:18:53,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:53,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:53,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2891 states. [2022-04-15 11:18:53,479 INFO L87 Difference]: Start difference. First operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2891 states. [2022-04-15 11:18:53,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:53,715 INFO L93 Difference]: Finished difference Result 2891 states and 4744 transitions. [2022-04-15 11:18:53,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 4744 transitions. [2022-04-15 11:18:53,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:53,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:53,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:53,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:53,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:54,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 4743 transitions. [2022-04-15 11:18:54,134 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 4743 transitions. Word has length 32 [2022-04-15 11:18:54,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:54,134 INFO L478 AbstractCegarLoop]: Abstraction has 2889 states and 4743 transitions. [2022-04-15 11:18:54,134 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-15 11:18:54,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2889 states and 4743 transitions. [2022-04-15 11:18:58,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4743 edges. 4743 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:58,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 4743 transitions. [2022-04-15 11:18:58,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 11:18:58,687 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:58,687 INFO L499 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2022-04-15 11:18:58,687 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 11:18:58,687 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:58,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:58,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1765128100, now seen corresponding path program 1 times [2022-04-15 11:18:58,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:58,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1752451579] [2022-04-15 11:18:58,688 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:58,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1765128100, now seen corresponding path program 2 times [2022-04-15 11:18:58,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:58,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256533382] [2022-04-15 11:18:58,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:58,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:58,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:58,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {111855#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {111849#true} is VALID [2022-04-15 11:18:58,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {111849#true} assume true; {111849#true} is VALID [2022-04-15 11:18:58,719 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {111849#true} {111849#true} #285#return; {111849#true} is VALID [2022-04-15 11:18:58,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {111849#true} call ULTIMATE.init(); {111855#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:58,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {111855#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {111849#true} is VALID [2022-04-15 11:18:58,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {111849#true} assume true; {111849#true} is VALID [2022-04-15 11:18:58,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111849#true} {111849#true} #285#return; {111849#true} is VALID [2022-04-15 11:18:58,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {111849#true} call #t~ret20 := main(); {111849#true} is VALID [2022-04-15 11:18:58,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {111849#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {111849#true} is VALID [2022-04-15 11:18:58,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {111849#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {111849#true} is VALID [2022-04-15 11:18:58,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {111849#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {111849#true} is VALID [2022-04-15 11:18:58,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {111849#true} assume !(0 != ~p1~0); {111849#true} is VALID [2022-04-15 11:18:58,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {111849#true} assume !(0 != ~p2~0); {111849#true} is VALID [2022-04-15 11:18:58,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {111849#true} assume !(0 != ~p3~0); {111849#true} is VALID [2022-04-15 11:18:58,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {111849#true} assume !(0 != ~p4~0); {111849#true} is VALID [2022-04-15 11:18:58,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {111849#true} assume !(0 != ~p5~0); {111849#true} is VALID [2022-04-15 11:18:58,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {111849#true} assume !(0 != ~p6~0); {111849#true} is VALID [2022-04-15 11:18:58,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {111849#true} assume 0 != ~p7~0;~lk7~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 11:18:58,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 11:18:58,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 11:18:58,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 11:18:58,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 11:18:58,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 11:18:58,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 11:18:58,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 11:18:58,738 INFO L290 TraceCheckUtils]: 22: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 11:18:58,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 11:18:58,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 11:18:58,739 INFO L290 TraceCheckUtils]: 25: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 11:18:58,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 11:18:58,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 11:18:58,740 INFO L290 TraceCheckUtils]: 28: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 11:18:58,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p7~0; {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 11:18:58,740 INFO L290 TraceCheckUtils]: 30: Hoare triple {111854#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {111850#false} is VALID [2022-04-15 11:18:58,740 INFO L290 TraceCheckUtils]: 31: Hoare triple {111850#false} assume !false; {111850#false} is VALID [2022-04-15 11:18:58,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:18:58,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:58,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256533382] [2022-04-15 11:18:58,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256533382] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:58,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:58,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:58,741 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:58,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1752451579] [2022-04-15 11:18:58,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1752451579] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:58,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:58,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:58,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916290434] [2022-04-15 11:18:58,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:58,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-15 11:18:58,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:58,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-15 11:18:58,759 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-15 11:18:58,759 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:58,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:58,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:58,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:58,759 INFO L87 Difference]: Start difference. First operand 2889 states and 4743 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-15 11:19:00,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:00,569 INFO L93 Difference]: Finished difference Result 5261 states and 8809 transitions. [2022-04-15 11:19:00,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:00,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-15 11:19:00,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:00,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-15 11:19:00,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2022-04-15 11:19:00,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-15 11:19:00,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2022-04-15 11:19:00,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 167 transitions. [2022-04-15 11:19:00,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:01,763 INFO L225 Difference]: With dead ends: 5261 [2022-04-15 11:19:01,764 INFO L226 Difference]: Without dead ends: 5259 [2022-04-15 11:19:01,765 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:19:01,765 INFO L913 BasicCegarLoop]: 95 mSDtfsCounter, 211 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:19:01,765 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 102 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:19:01,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2022-04-15 11:19:02,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 4105. [2022-04-15 11:19:02,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:02,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5259 states. Second operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:02,053 INFO L74 IsIncluded]: Start isIncluded. First operand 5259 states. Second operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:02,056 INFO L87 Difference]: Start difference. First operand 5259 states. Second operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:02,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:02,860 INFO L93 Difference]: Finished difference Result 5259 states and 8744 transitions. [2022-04-15 11:19:02,861 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 8744 transitions. [2022-04-15 11:19:02,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:02,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:02,870 INFO L74 IsIncluded]: Start isIncluded. First operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5259 states. [2022-04-15 11:19:02,873 INFO L87 Difference]: Start difference. First operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5259 states. [2022-04-15 11:19:03,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:03,682 INFO L93 Difference]: Finished difference Result 5259 states and 8744 transitions. [2022-04-15 11:19:03,682 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 8744 transitions. [2022-04-15 11:19:03,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:03,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:03,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:03,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:03,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:04,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4105 states to 4105 states and 6567 transitions. [2022-04-15 11:19:04,507 INFO L78 Accepts]: Start accepts. Automaton has 4105 states and 6567 transitions. Word has length 32 [2022-04-15 11:19:04,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:04,508 INFO L478 AbstractCegarLoop]: Abstraction has 4105 states and 6567 transitions. [2022-04-15 11:19:04,508 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-15 11:19:04,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4105 states and 6567 transitions. [2022-04-15 11:19:10,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6567 edges. 6567 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:10,677 INFO L276 IsEmpty]: Start isEmpty. Operand 4105 states and 6567 transitions. [2022-04-15 11:19:10,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 11:19:10,680 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:10,680 INFO L499 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2022-04-15 11:19:10,680 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 11:19:10,680 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:10,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:10,680 INFO L85 PathProgramCache]: Analyzing trace with hash -229016606, now seen corresponding path program 1 times [2022-04-15 11:19:10,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:10,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1049956724] [2022-04-15 11:19:10,681 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:10,681 INFO L85 PathProgramCache]: Analyzing trace with hash -229016606, now seen corresponding path program 2 times [2022-04-15 11:19:10,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:10,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378066743] [2022-04-15 11:19:10,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:10,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:10,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:10,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {141117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {141111#true} is VALID [2022-04-15 11:19:10,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {141111#true} assume true; {141111#true} is VALID [2022-04-15 11:19:10,718 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141111#true} {141111#true} #285#return; {141111#true} is VALID [2022-04-15 11:19:10,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {141111#true} call ULTIMATE.init(); {141117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:19:10,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {141117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {141111#true} is VALID [2022-04-15 11:19:10,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {141111#true} assume true; {141111#true} is VALID [2022-04-15 11:19:10,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141111#true} {141111#true} #285#return; {141111#true} is VALID [2022-04-15 11:19:10,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {141111#true} call #t~ret20 := main(); {141111#true} is VALID [2022-04-15 11:19:10,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {141111#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {141111#true} is VALID [2022-04-15 11:19:10,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {141111#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {141111#true} is VALID [2022-04-15 11:19:10,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {141111#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {141111#true} is VALID [2022-04-15 11:19:10,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {141111#true} assume !(0 != ~p1~0); {141111#true} is VALID [2022-04-15 11:19:10,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {141111#true} assume !(0 != ~p2~0); {141111#true} is VALID [2022-04-15 11:19:10,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {141111#true} assume !(0 != ~p3~0); {141111#true} is VALID [2022-04-15 11:19:10,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {141111#true} assume !(0 != ~p4~0); {141111#true} is VALID [2022-04-15 11:19:10,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {141111#true} assume !(0 != ~p5~0); {141111#true} is VALID [2022-04-15 11:19:10,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {141111#true} assume !(0 != ~p6~0); {141111#true} is VALID [2022-04-15 11:19:10,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {141111#true} assume !(0 != ~p7~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-15 11:19:10,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-15 11:19:10,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-15 11:19:10,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p10~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-15 11:19:10,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-15 11:19:10,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-15 11:19:10,721 INFO L290 TraceCheckUtils]: 20: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-15 11:19:10,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-15 11:19:10,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-15 11:19:10,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p1~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-15 11:19:10,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p2~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-15 11:19:10,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p3~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-15 11:19:10,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p4~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-15 11:19:10,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p5~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-15 11:19:10,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p6~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-15 11:19:10,724 INFO L290 TraceCheckUtils]: 29: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p7~0; {141112#false} is VALID [2022-04-15 11:19:10,724 INFO L290 TraceCheckUtils]: 30: Hoare triple {141112#false} assume 1 != ~lk7~0; {141112#false} is VALID [2022-04-15 11:19:10,724 INFO L290 TraceCheckUtils]: 31: Hoare triple {141112#false} assume !false; {141112#false} is VALID [2022-04-15 11:19:10,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:19:10,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:10,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378066743] [2022-04-15 11:19:10,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378066743] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:10,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:10,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:10,724 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:10,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1049956724] [2022-04-15 11:19:10,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1049956724] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:10,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:10,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:10,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332455378] [2022-04-15 11:19:10,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:10,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-15 11:19:10,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:10,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-15 11:19:10,742 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-15 11:19:10,743 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:10,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:10,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:10,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:10,743 INFO L87 Difference]: Start difference. First operand 4105 states and 6567 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-15 11:19:15,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:15,569 INFO L93 Difference]: Finished difference Result 9677 states and 15593 transitions. [2022-04-15 11:19:15,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:15,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-15 11:19:15,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:15,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-15 11:19:15,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2022-04-15 11:19:15,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-15 11:19:15,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2022-04-15 11:19:15,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 264 transitions. [2022-04-15 11:19:15,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:16,972 INFO L225 Difference]: With dead ends: 9677 [2022-04-15 11:19:16,972 INFO L226 Difference]: Without dead ends: 5643 [2022-04-15 11:19:16,976 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:19:16,977 INFO L913 BasicCegarLoop]: 140 mSDtfsCounter, 187 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:19:16,978 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 147 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:19:16,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2022-04-15 11:19:17,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5641. [2022-04-15 11:19:17,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:17,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5643 states. Second operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:17,396 INFO L74 IsIncluded]: Start isIncluded. First operand 5643 states. Second operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:17,400 INFO L87 Difference]: Start difference. First operand 5643 states. Second operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:18,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:18,347 INFO L93 Difference]: Finished difference Result 5643 states and 9032 transitions. [2022-04-15 11:19:18,347 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 9032 transitions. [2022-04-15 11:19:18,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:18,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:18,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5643 states. [2022-04-15 11:19:18,362 INFO L87 Difference]: Start difference. First operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5643 states. [2022-04-15 11:19:19,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:19,302 INFO L93 Difference]: Finished difference Result 5643 states and 9032 transitions. [2022-04-15 11:19:19,302 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 9032 transitions. [2022-04-15 11:19:19,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:19,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:19,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:19,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:19,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:20,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5641 states to 5641 states and 9031 transitions. [2022-04-15 11:19:20,757 INFO L78 Accepts]: Start accepts. Automaton has 5641 states and 9031 transitions. Word has length 32 [2022-04-15 11:19:20,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:20,757 INFO L478 AbstractCegarLoop]: Abstraction has 5641 states and 9031 transitions. [2022-04-15 11:19:20,757 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-15 11:19:20,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5641 states and 9031 transitions. [2022-04-15 11:19:29,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9031 edges. 9031 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:29,884 INFO L276 IsEmpty]: Start isEmpty. Operand 5641 states and 9031 transitions. [2022-04-15 11:19:29,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 11:19:29,886 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:29,886 INFO L499 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:19:29,886 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 11:19:29,886 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:29,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:29,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1115389939, now seen corresponding path program 1 times [2022-04-15 11:19:29,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:29,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1334636284] [2022-04-15 11:19:29,888 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:29,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1115389939, now seen corresponding path program 2 times [2022-04-15 11:19:29,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:29,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980890511] [2022-04-15 11:19:29,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:29,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:29,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:29,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {183051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {183045#true} is VALID [2022-04-15 11:19:29,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {183045#true} assume true; {183045#true} is VALID [2022-04-15 11:19:29,939 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {183045#true} {183045#true} #285#return; {183045#true} is VALID [2022-04-15 11:19:29,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {183045#true} call ULTIMATE.init(); {183051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:19:29,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {183051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {183045#true} is VALID [2022-04-15 11:19:29,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {183045#true} assume true; {183045#true} is VALID [2022-04-15 11:19:29,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183045#true} {183045#true} #285#return; {183045#true} is VALID [2022-04-15 11:19:29,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {183045#true} call #t~ret20 := main(); {183045#true} is VALID [2022-04-15 11:19:29,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {183045#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {183045#true} is VALID [2022-04-15 11:19:29,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {183045#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {183045#true} is VALID [2022-04-15 11:19:29,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {183045#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {183045#true} is VALID [2022-04-15 11:19:29,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {183045#true} assume !(0 != ~p1~0); {183045#true} is VALID [2022-04-15 11:19:29,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {183045#true} assume !(0 != ~p2~0); {183045#true} is VALID [2022-04-15 11:19:29,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {183045#true} assume !(0 != ~p3~0); {183045#true} is VALID [2022-04-15 11:19:29,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {183045#true} assume !(0 != ~p4~0); {183045#true} is VALID [2022-04-15 11:19:29,940 INFO L290 TraceCheckUtils]: 12: Hoare triple {183045#true} assume !(0 != ~p5~0); {183045#true} is VALID [2022-04-15 11:19:29,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {183045#true} assume !(0 != ~p6~0); {183045#true} is VALID [2022-04-15 11:19:29,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {183045#true} assume 0 != ~p7~0;~lk7~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:19:29,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:19:29,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:19:29,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:19:29,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:19:29,942 INFO L290 TraceCheckUtils]: 19: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:19:29,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:19:29,942 INFO L290 TraceCheckUtils]: 21: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:19:29,943 INFO L290 TraceCheckUtils]: 22: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:19:29,943 INFO L290 TraceCheckUtils]: 23: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:19:29,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:19:29,943 INFO L290 TraceCheckUtils]: 25: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:19:29,944 INFO L290 TraceCheckUtils]: 26: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:19:29,944 INFO L290 TraceCheckUtils]: 27: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:19:29,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:19:29,945 INFO L290 TraceCheckUtils]: 29: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {183046#false} is VALID [2022-04-15 11:19:29,945 INFO L290 TraceCheckUtils]: 30: Hoare triple {183046#false} assume 0 != ~p8~0; {183046#false} is VALID [2022-04-15 11:19:29,945 INFO L290 TraceCheckUtils]: 31: Hoare triple {183046#false} assume 1 != ~lk8~0; {183046#false} is VALID [2022-04-15 11:19:29,945 INFO L290 TraceCheckUtils]: 32: Hoare triple {183046#false} assume !false; {183046#false} is VALID [2022-04-15 11:19:29,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:19:29,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:29,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980890511] [2022-04-15 11:19:29,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980890511] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:29,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:29,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:29,945 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:29,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1334636284] [2022-04-15 11:19:29,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1334636284] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:29,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:29,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:29,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975809098] [2022-04-15 11:19:29,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:29,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 11:19:29,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:29,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:29,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:29,967 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:29,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:29,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:29,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:29,968 INFO L87 Difference]: Start difference. First operand 5641 states and 9031 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:34,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:34,008 INFO L93 Difference]: Finished difference Result 8461 states and 13513 transitions. [2022-04-15 11:19:34,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:34,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 11:19:34,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:34,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:34,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2022-04-15 11:19:34,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:34,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2022-04-15 11:19:34,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 259 transitions. [2022-04-15 11:19:34,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:35,451 INFO L225 Difference]: With dead ends: 8461 [2022-04-15 11:19:35,451 INFO L226 Difference]: Without dead ends: 5707 [2022-04-15 11:19:35,454 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:19:35,455 INFO L913 BasicCegarLoop]: 138 mSDtfsCounter, 190 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:19:35,455 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 145 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:19:35,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5707 states. [2022-04-15 11:19:35,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5707 to 5705. [2022-04-15 11:19:35,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:35,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5707 states. Second operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:35,898 INFO L74 IsIncluded]: Start isIncluded. First operand 5707 states. Second operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:35,908 INFO L87 Difference]: Start difference. First operand 5707 states. Second operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:36,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:36,833 INFO L93 Difference]: Finished difference Result 5707 states and 9032 transitions. [2022-04-15 11:19:36,833 INFO L276 IsEmpty]: Start isEmpty. Operand 5707 states and 9032 transitions. [2022-04-15 11:19:36,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:36,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:36,844 INFO L74 IsIncluded]: Start isIncluded. First operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5707 states. [2022-04-15 11:19:36,850 INFO L87 Difference]: Start difference. First operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5707 states. [2022-04-15 11:19:37,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:37,787 INFO L93 Difference]: Finished difference Result 5707 states and 9032 transitions. [2022-04-15 11:19:37,787 INFO L276 IsEmpty]: Start isEmpty. Operand 5707 states and 9032 transitions. [2022-04-15 11:19:37,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:37,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:37,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:37,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:37,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:39,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5705 states to 5705 states and 9031 transitions. [2022-04-15 11:19:39,322 INFO L78 Accepts]: Start accepts. Automaton has 5705 states and 9031 transitions. Word has length 33 [2022-04-15 11:19:39,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:39,322 INFO L478 AbstractCegarLoop]: Abstraction has 5705 states and 9031 transitions. [2022-04-15 11:19:39,323 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:39,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5705 states and 9031 transitions. [2022-04-15 11:19:48,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9031 edges. 9031 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:48,465 INFO L276 IsEmpty]: Start isEmpty. Operand 5705 states and 9031 transitions. [2022-04-15 11:19:48,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 11:19:48,468 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:48,468 INFO L499 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:19:48,469 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 11:19:48,469 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:48,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:48,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1490633615, now seen corresponding path program 1 times [2022-04-15 11:19:48,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:48,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [135418692] [2022-04-15 11:19:48,469 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:48,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1490633615, now seen corresponding path program 2 times [2022-04-15 11:19:48,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:48,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974210782] [2022-04-15 11:19:48,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:48,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:48,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:48,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {222809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {222803#true} is VALID [2022-04-15 11:19:48,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {222803#true} assume true; {222803#true} is VALID [2022-04-15 11:19:48,516 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {222803#true} {222803#true} #285#return; {222803#true} is VALID [2022-04-15 11:19:48,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {222803#true} call ULTIMATE.init(); {222809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:19:48,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {222809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {222803#true} is VALID [2022-04-15 11:19:48,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {222803#true} assume true; {222803#true} is VALID [2022-04-15 11:19:48,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {222803#true} {222803#true} #285#return; {222803#true} is VALID [2022-04-15 11:19:48,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {222803#true} call #t~ret20 := main(); {222803#true} is VALID [2022-04-15 11:19:48,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {222803#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {222803#true} is VALID [2022-04-15 11:19:48,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {222803#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {222803#true} is VALID [2022-04-15 11:19:48,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {222803#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {222803#true} is VALID [2022-04-15 11:19:48,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {222803#true} assume !(0 != ~p1~0); {222803#true} is VALID [2022-04-15 11:19:48,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {222803#true} assume !(0 != ~p2~0); {222803#true} is VALID [2022-04-15 11:19:48,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {222803#true} assume !(0 != ~p3~0); {222803#true} is VALID [2022-04-15 11:19:48,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {222803#true} assume !(0 != ~p4~0); {222803#true} is VALID [2022-04-15 11:19:48,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {222803#true} assume !(0 != ~p5~0); {222803#true} is VALID [2022-04-15 11:19:48,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {222803#true} assume !(0 != ~p6~0); {222803#true} is VALID [2022-04-15 11:19:48,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {222803#true} assume !(0 != ~p7~0); {222803#true} is VALID [2022-04-15 11:19:48,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {222803#true} assume 0 != ~p8~0;~lk8~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 11:19:48,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 11:19:48,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 11:19:48,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 11:19:48,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 11:19:48,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 11:19:48,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 11:19:48,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 11:19:48,520 INFO L290 TraceCheckUtils]: 23: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 11:19:48,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 11:19:48,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 11:19:48,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 11:19:48,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 11:19:48,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 11:19:48,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 11:19:48,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p8~0; {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 11:19:48,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {222808#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {222804#false} is VALID [2022-04-15 11:19:48,522 INFO L290 TraceCheckUtils]: 32: Hoare triple {222804#false} assume !false; {222804#false} is VALID [2022-04-15 11:19:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:19:48,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:48,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974210782] [2022-04-15 11:19:48,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974210782] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:48,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:48,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:48,523 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:48,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [135418692] [2022-04-15 11:19:48,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [135418692] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:48,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:48,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:48,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54095836] [2022-04-15 11:19:48,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:48,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 11:19:48,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:48,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:48,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:48,545 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:48,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:48,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:48,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:48,545 INFO L87 Difference]: Start difference. First operand 5705 states and 9031 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:54,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:54,255 INFO L93 Difference]: Finished difference Result 10253 states and 16585 transitions. [2022-04-15 11:19:54,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:54,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 11:19:54,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:54,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:54,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-15 11:19:54,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:54,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-15 11:19:54,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-15 11:19:54,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:58,680 INFO L225 Difference]: With dead ends: 10253 [2022-04-15 11:19:58,680 INFO L226 Difference]: Without dead ends: 10251 [2022-04-15 11:19:58,682 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:19:58,682 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 204 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:19:58,682 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 101 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:19:58,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10251 states. [2022-04-15 11:19:59,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10251 to 8201. [2022-04-15 11:19:59,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:59,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10251 states. Second operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:59,322 INFO L74 IsIncluded]: Start isIncluded. First operand 10251 states. Second operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:59,331 INFO L87 Difference]: Start difference. First operand 10251 states. Second operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:02,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:20:02,364 INFO L93 Difference]: Finished difference Result 10251 states and 16456 transitions. [2022-04-15 11:20:02,364 INFO L276 IsEmpty]: Start isEmpty. Operand 10251 states and 16456 transitions. [2022-04-15 11:20:02,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:20:02,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:20:02,383 INFO L74 IsIncluded]: Start isIncluded. First operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 10251 states. [2022-04-15 11:20:02,391 INFO L87 Difference]: Start difference. First operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 10251 states. [2022-04-15 11:20:05,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:20:05,559 INFO L93 Difference]: Finished difference Result 10251 states and 16456 transitions. [2022-04-15 11:20:05,559 INFO L276 IsEmpty]: Start isEmpty. Operand 10251 states and 16456 transitions. [2022-04-15 11:20:05,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:20:05,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:20:05,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:20:05,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:20:05,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:08,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8201 states to 8201 states and 12615 transitions. [2022-04-15 11:20:08,992 INFO L78 Accepts]: Start accepts. Automaton has 8201 states and 12615 transitions. Word has length 33 [2022-04-15 11:20:08,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:20:08,993 INFO L478 AbstractCegarLoop]: Abstraction has 8201 states and 12615 transitions. [2022-04-15 11:20:08,993 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:08,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8201 states and 12615 transitions. [2022-04-15 11:20:21,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12615 edges. 12615 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:20:21,662 INFO L276 IsEmpty]: Start isEmpty. Operand 8201 states and 12615 transitions. [2022-04-15 11:20:21,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 11:20:21,667 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:20:21,667 INFO L499 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:20:21,667 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 11:20:21,668 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:20:21,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:20:21,668 INFO L85 PathProgramCache]: Analyzing trace with hash -503511091, now seen corresponding path program 1 times [2022-04-15 11:20:21,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:20:21,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1942265351] [2022-04-15 11:20:21,668 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:20:21,668 INFO L85 PathProgramCache]: Analyzing trace with hash -503511091, now seen corresponding path program 2 times [2022-04-15 11:20:21,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:20:21,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983320156] [2022-04-15 11:20:21,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:20:21,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:20:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:20:21,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:20:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:20:21,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {280231#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {280225#true} is VALID [2022-04-15 11:20:21,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {280225#true} assume true; {280225#true} is VALID [2022-04-15 11:20:21,705 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {280225#true} {280225#true} #285#return; {280225#true} is VALID [2022-04-15 11:20:21,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {280225#true} call ULTIMATE.init(); {280231#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:20:21,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {280231#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {280225#true} is VALID [2022-04-15 11:20:21,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {280225#true} assume true; {280225#true} is VALID [2022-04-15 11:20:21,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {280225#true} {280225#true} #285#return; {280225#true} is VALID [2022-04-15 11:20:21,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {280225#true} call #t~ret20 := main(); {280225#true} is VALID [2022-04-15 11:20:21,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {280225#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {280225#true} is VALID [2022-04-15 11:20:21,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {280225#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {280225#true} is VALID [2022-04-15 11:20:21,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {280225#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {280225#true} is VALID [2022-04-15 11:20:21,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {280225#true} assume !(0 != ~p1~0); {280225#true} is VALID [2022-04-15 11:20:21,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {280225#true} assume !(0 != ~p2~0); {280225#true} is VALID [2022-04-15 11:20:21,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {280225#true} assume !(0 != ~p3~0); {280225#true} is VALID [2022-04-15 11:20:21,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {280225#true} assume !(0 != ~p4~0); {280225#true} is VALID [2022-04-15 11:20:21,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {280225#true} assume !(0 != ~p5~0); {280225#true} is VALID [2022-04-15 11:20:21,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {280225#true} assume !(0 != ~p6~0); {280225#true} is VALID [2022-04-15 11:20:21,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {280225#true} assume !(0 != ~p7~0); {280225#true} is VALID [2022-04-15 11:20:21,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {280225#true} assume !(0 != ~p8~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-15 11:20:21,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-15 11:20:21,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p10~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-15 11:20:21,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-15 11:20:21,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-15 11:20:21,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-15 11:20:21,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-15 11:20:21,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-15 11:20:21,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p1~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-15 11:20:21,720 INFO L290 TraceCheckUtils]: 24: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p2~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-15 11:20:21,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p3~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-15 11:20:21,721 INFO L290 TraceCheckUtils]: 26: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p4~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-15 11:20:21,721 INFO L290 TraceCheckUtils]: 27: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p5~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-15 11:20:21,721 INFO L290 TraceCheckUtils]: 28: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p6~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-15 11:20:21,722 INFO L290 TraceCheckUtils]: 29: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p7~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-15 11:20:21,722 INFO L290 TraceCheckUtils]: 30: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p8~0; {280226#false} is VALID [2022-04-15 11:20:21,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {280226#false} assume 1 != ~lk8~0; {280226#false} is VALID [2022-04-15 11:20:21,722 INFO L290 TraceCheckUtils]: 32: Hoare triple {280226#false} assume !false; {280226#false} is VALID [2022-04-15 11:20:21,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:20:21,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:20:21,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983320156] [2022-04-15 11:20:21,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983320156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:20:21,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:20:21,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:20:21,723 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:20:21,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1942265351] [2022-04-15 11:20:21,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1942265351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:20:21,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:20:21,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:20:21,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914375622] [2022-04-15 11:20:21,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:20:21,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 11:20:21,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:20:21,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:21,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:20:21,741 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:20:21,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:20:21,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:20:21,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:20:21,742 INFO L87 Difference]: Start difference. First operand 8201 states and 12615 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:39,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:20:39,986 INFO L93 Difference]: Finished difference Result 19213 states and 29769 transitions. [2022-04-15 11:20:39,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:20:39,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 11:20:39,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:20:39,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:39,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 261 transitions. [2022-04-15 11:20:39,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:39,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 261 transitions. [2022-04-15 11:20:39,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 261 transitions. [2022-04-15 11:20:40,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:20:44,953 INFO L225 Difference]: With dead ends: 19213 [2022-04-15 11:20:44,953 INFO L226 Difference]: Without dead ends: 11147 [2022-04-15 11:20:44,962 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:20:44,962 INFO L913 BasicCegarLoop]: 142 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:20:44,962 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 149 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:20:44,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11147 states. [2022-04-15 11:20:45,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11147 to 11145. [2022-04-15 11:20:45,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:20:45,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11147 states. Second operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:45,874 INFO L74 IsIncluded]: Start isIncluded. First operand 11147 states. Second operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:45,890 INFO L87 Difference]: Start difference. First operand 11147 states. Second operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:49,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:20:49,636 INFO L93 Difference]: Finished difference Result 11147 states and 17160 transitions. [2022-04-15 11:20:49,636 INFO L276 IsEmpty]: Start isEmpty. Operand 11147 states and 17160 transitions. [2022-04-15 11:20:49,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:20:49,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:20:49,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 11147 states. [2022-04-15 11:20:49,673 INFO L87 Difference]: Start difference. First operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 11147 states. [2022-04-15 11:20:53,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:20:53,400 INFO L93 Difference]: Finished difference Result 11147 states and 17160 transitions. [2022-04-15 11:20:53,400 INFO L276 IsEmpty]: Start isEmpty. Operand 11147 states and 17160 transitions. [2022-04-15 11:20:53,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:20:53,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:20:53,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:20:53,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:20:53,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:59,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11145 states to 11145 states and 17159 transitions. [2022-04-15 11:20:59,086 INFO L78 Accepts]: Start accepts. Automaton has 11145 states and 17159 transitions. Word has length 33 [2022-04-15 11:20:59,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:20:59,086 INFO L478 AbstractCegarLoop]: Abstraction has 11145 states and 17159 transitions. [2022-04-15 11:20:59,086 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:59,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11145 states and 17159 transitions. [2022-04-15 11:21:17,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17159 edges. 17159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:21:17,291 INFO L276 IsEmpty]: Start isEmpty. Operand 11145 states and 17159 transitions. [2022-04-15 11:21:17,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 11:21:17,298 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:21:17,298 INFO L499 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:21:17,298 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 11:21:17,298 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:21:17,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:21:17,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1034784041, now seen corresponding path program 1 times [2022-04-15 11:21:17,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:21:17,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1334293680] [2022-04-15 11:21:17,299 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:21:17,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1034784041, now seen corresponding path program 2 times [2022-04-15 11:21:17,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:21:17,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197508869] [2022-04-15 11:21:17,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:21:17,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:21:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:21:17,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:21:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:21:17,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {363253#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {363247#true} is VALID [2022-04-15 11:21:17,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {363247#true} assume true; {363247#true} is VALID [2022-04-15 11:21:17,354 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {363247#true} {363247#true} #285#return; {363247#true} is VALID [2022-04-15 11:21:17,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {363247#true} call ULTIMATE.init(); {363253#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:21:17,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {363253#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {363247#true} is VALID [2022-04-15 11:21:17,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {363247#true} assume true; {363247#true} is VALID [2022-04-15 11:21:17,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {363247#true} {363247#true} #285#return; {363247#true} is VALID [2022-04-15 11:21:17,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {363247#true} call #t~ret20 := main(); {363247#true} is VALID [2022-04-15 11:21:17,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {363247#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {363247#true} is VALID [2022-04-15 11:21:17,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {363247#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {363247#true} is VALID [2022-04-15 11:21:17,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {363247#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {363247#true} is VALID [2022-04-15 11:21:17,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {363247#true} assume !(0 != ~p1~0); {363247#true} is VALID [2022-04-15 11:21:17,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {363247#true} assume !(0 != ~p2~0); {363247#true} is VALID [2022-04-15 11:21:17,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {363247#true} assume !(0 != ~p3~0); {363247#true} is VALID [2022-04-15 11:21:17,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {363247#true} assume !(0 != ~p4~0); {363247#true} is VALID [2022-04-15 11:21:17,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {363247#true} assume !(0 != ~p5~0); {363247#true} is VALID [2022-04-15 11:21:17,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {363247#true} assume !(0 != ~p6~0); {363247#true} is VALID [2022-04-15 11:21:17,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {363247#true} assume !(0 != ~p7~0); {363247#true} is VALID [2022-04-15 11:21:17,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {363247#true} assume 0 != ~p8~0;~lk8~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:21:17,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:21:17,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:21:17,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:21:17,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:21:17,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:21:17,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:21:17,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:21:17,358 INFO L290 TraceCheckUtils]: 23: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:21:17,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:21:17,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:21:17,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:21:17,359 INFO L290 TraceCheckUtils]: 27: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:21:17,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:21:17,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:21:17,359 INFO L290 TraceCheckUtils]: 30: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {363248#false} is VALID [2022-04-15 11:21:17,359 INFO L290 TraceCheckUtils]: 31: Hoare triple {363248#false} assume 0 != ~p9~0; {363248#false} is VALID [2022-04-15 11:21:17,359 INFO L290 TraceCheckUtils]: 32: Hoare triple {363248#false} assume 1 != ~lk9~0; {363248#false} is VALID [2022-04-15 11:21:17,359 INFO L290 TraceCheckUtils]: 33: Hoare triple {363248#false} assume !false; {363248#false} is VALID [2022-04-15 11:21:17,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:21:17,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:21:17,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197508869] [2022-04-15 11:21:17,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197508869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:21:17,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:21:17,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:21:17,362 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:21:17,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1334293680] [2022-04-15 11:21:17,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1334293680] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:21:17,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:21:17,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:21:17,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125606120] [2022-04-15 11:21:17,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:21:17,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 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-15 11:21:17,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:21:17,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 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-15 11:21:17,380 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-15 11:21:17,380 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:21:17,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:21:17,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:21:17,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:21:17,381 INFO L87 Difference]: Start difference. First operand 11145 states and 17159 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 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-15 11:21:32,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:21:32,108 INFO L93 Difference]: Finished difference Result 16717 states and 25673 transitions. [2022-04-15 11:21:32,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:21:32,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 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-15 11:21:32,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:21:32,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 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-15 11:21:32,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 256 transitions. [2022-04-15 11:21:32,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 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-15 11:21:32,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 256 transitions. [2022-04-15 11:21:32,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 256 transitions. [2022-04-15 11:21:32,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:21:37,201 INFO L225 Difference]: With dead ends: 16717 [2022-04-15 11:21:37,202 INFO L226 Difference]: Without dead ends: 11275 [2022-04-15 11:21:37,208 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:21:37,209 INFO L913 BasicCegarLoop]: 135 mSDtfsCounter, 189 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:21:37,209 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 142 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:21:37,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11275 states. [2022-04-15 11:21:38,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11275 to 11273. [2022-04-15 11:21:38,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:21:38,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11275 states. Second operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:21:38,107 INFO L74 IsIncluded]: Start isIncluded. First operand 11275 states. Second operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:21:38,119 INFO L87 Difference]: Start difference. First operand 11275 states. Second operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:21:41,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:21:41,818 INFO L93 Difference]: Finished difference Result 11275 states and 17160 transitions. [2022-04-15 11:21:41,818 INFO L276 IsEmpty]: Start isEmpty. Operand 11275 states and 17160 transitions. [2022-04-15 11:21:41,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:21:41,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:21:41,838 INFO L74 IsIncluded]: Start isIncluded. First operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 11275 states. [2022-04-15 11:21:41,850 INFO L87 Difference]: Start difference. First operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 11275 states. [2022-04-15 11:21:45,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:21:45,534 INFO L93 Difference]: Finished difference Result 11275 states and 17160 transitions. [2022-04-15 11:21:45,534 INFO L276 IsEmpty]: Start isEmpty. Operand 11275 states and 17160 transitions. [2022-04-15 11:21:45,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:21:45,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:21:45,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:21:45,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:21:45,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:21:51,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11273 states to 11273 states and 17159 transitions. [2022-04-15 11:21:51,307 INFO L78 Accepts]: Start accepts. Automaton has 11273 states and 17159 transitions. Word has length 34 [2022-04-15 11:21:51,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:21:51,307 INFO L478 AbstractCegarLoop]: Abstraction has 11273 states and 17159 transitions. [2022-04-15 11:21:51,307 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 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-15 11:21:51,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11273 states and 17159 transitions. [2022-04-15 11:22:09,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17159 edges. 17159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:22:09,633 INFO L276 IsEmpty]: Start isEmpty. Operand 11273 states and 17159 transitions. [2022-04-15 11:22:09,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 11:22:09,638 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:22:09,638 INFO L499 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:22:09,638 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 11:22:09,639 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:22:09,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:22:09,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1571239513, now seen corresponding path program 1 times [2022-04-15 11:22:09,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:22:09,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [712179360] [2022-04-15 11:22:09,639 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:22:09,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1571239513, now seen corresponding path program 2 times [2022-04-15 11:22:09,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:22:09,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348365964] [2022-04-15 11:22:09,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:22:09,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:22:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:22:09,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:22:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:22:09,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {441795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {441789#true} is VALID [2022-04-15 11:22:09,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {441789#true} assume true; {441789#true} is VALID [2022-04-15 11:22:09,672 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {441789#true} {441789#true} #285#return; {441789#true} is VALID [2022-04-15 11:22:09,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {441789#true} call ULTIMATE.init(); {441795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:22:09,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {441795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {441789#true} is VALID [2022-04-15 11:22:09,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {441789#true} assume true; {441789#true} is VALID [2022-04-15 11:22:09,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {441789#true} {441789#true} #285#return; {441789#true} is VALID [2022-04-15 11:22:09,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {441789#true} call #t~ret20 := main(); {441789#true} is VALID [2022-04-15 11:22:09,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {441789#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {441789#true} is VALID [2022-04-15 11:22:09,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {441789#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {441789#true} is VALID [2022-04-15 11:22:09,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {441789#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {441789#true} is VALID [2022-04-15 11:22:09,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {441789#true} assume !(0 != ~p1~0); {441789#true} is VALID [2022-04-15 11:22:09,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {441789#true} assume !(0 != ~p2~0); {441789#true} is VALID [2022-04-15 11:22:09,673 INFO L290 TraceCheckUtils]: 10: Hoare triple {441789#true} assume !(0 != ~p3~0); {441789#true} is VALID [2022-04-15 11:22:09,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {441789#true} assume !(0 != ~p4~0); {441789#true} is VALID [2022-04-15 11:22:09,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {441789#true} assume !(0 != ~p5~0); {441789#true} is VALID [2022-04-15 11:22:09,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {441789#true} assume !(0 != ~p6~0); {441789#true} is VALID [2022-04-15 11:22:09,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {441789#true} assume !(0 != ~p7~0); {441789#true} is VALID [2022-04-15 11:22:09,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {441789#true} assume !(0 != ~p8~0); {441789#true} is VALID [2022-04-15 11:22:09,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {441789#true} assume 0 != ~p9~0;~lk9~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 11:22:09,674 INFO L290 TraceCheckUtils]: 17: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 11:22:09,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 11:22:09,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 11:22:09,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 11:22:09,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 11:22:09,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 11:22:09,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 11:22:09,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 11:22:09,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 11:22:09,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 11:22:09,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 11:22:09,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 11:22:09,676 INFO L290 TraceCheckUtils]: 29: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 11:22:09,677 INFO L290 TraceCheckUtils]: 30: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 11:22:09,677 INFO L290 TraceCheckUtils]: 31: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p9~0; {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 11:22:09,677 INFO L290 TraceCheckUtils]: 32: Hoare triple {441794#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {441790#false} is VALID [2022-04-15 11:22:09,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {441790#false} assume !false; {441790#false} is VALID [2022-04-15 11:22:09,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:22:09,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:22:09,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348365964] [2022-04-15 11:22:09,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348365964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:22:09,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:22:09,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:22:09,678 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:22:09,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [712179360] [2022-04-15 11:22:09,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [712179360] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:22:09,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:22:09,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:22:09,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622295035] [2022-04-15 11:22:09,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:22:09,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 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-15 11:22:09,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:22:09,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 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-15 11:22:09,695 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-15 11:22:09,695 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:22:09,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:22:09,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:22:09,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:22:09,696 INFO L87 Difference]: Start difference. First operand 11273 states and 17159 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 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-15 11:22:30,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:22:30,507 INFO L93 Difference]: Finished difference Result 19981 states and 31113 transitions. [2022-04-15 11:22:30,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:22:30,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 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-15 11:22:30,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:22:30,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 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-15 11:22:30,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-15 11:22:30,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 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-15 11:22:30,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-15 11:22:30,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-04-15 11:22:30,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:22:46,471 INFO L225 Difference]: With dead ends: 19981 [2022-04-15 11:22:46,472 INFO L226 Difference]: Without dead ends: 19979 [2022-04-15 11:22:46,475 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:22:46,476 INFO L913 BasicCegarLoop]: 93 mSDtfsCounter, 197 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:22:46,476 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 100 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:22:46,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19979 states. [2022-04-15 11:22:47,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19979 to 16393. [2022-04-15 11:22:47,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:22:47,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19979 states. Second operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:22:47,806 INFO L74 IsIncluded]: Start isIncluded. First operand 19979 states. Second operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:22:47,823 INFO L87 Difference]: Start difference. First operand 19979 states. Second operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:22:59,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:22:59,220 INFO L93 Difference]: Finished difference Result 19979 states and 30856 transitions. [2022-04-15 11:22:59,220 INFO L276 IsEmpty]: Start isEmpty. Operand 19979 states and 30856 transitions. [2022-04-15 11:22:59,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:22:59,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:22:59,250 INFO L74 IsIncluded]: Start isIncluded. First operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19979 states. [2022-04-15 11:22:59,267 INFO L87 Difference]: Start difference. First operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19979 states. [2022-04-15 11:23:10,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:23:10,160 INFO L93 Difference]: Finished difference Result 19979 states and 30856 transitions. [2022-04-15 11:23:10,160 INFO L276 IsEmpty]: Start isEmpty. Operand 19979 states and 30856 transitions. [2022-04-15 11:23:10,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:23:10,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:23:10,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:23:10,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:23:10,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:23:23,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16393 states to 16393 states and 24199 transitions. [2022-04-15 11:23:23,454 INFO L78 Accepts]: Start accepts. Automaton has 16393 states and 24199 transitions. Word has length 34 [2022-04-15 11:23:23,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:23:23,454 INFO L478 AbstractCegarLoop]: Abstraction has 16393 states and 24199 transitions. [2022-04-15 11:23:23,455 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 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-15 11:23:23,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16393 states and 24199 transitions. [2022-04-15 11:23:49,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24199 edges. 24199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:23:49,650 INFO L276 IsEmpty]: Start isEmpty. Operand 16393 states and 24199 transitions. [2022-04-15 11:23:49,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 11:23:49,660 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:23:49,661 INFO L499 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:23:49,661 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 11:23:49,661 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:23:49,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:23:49,661 INFO L85 PathProgramCache]: Analyzing trace with hash -422905193, now seen corresponding path program 1 times [2022-04-15 11:23:49,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:23:49,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1247073676] [2022-04-15 11:23:49,661 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:23:49,662 INFO L85 PathProgramCache]: Analyzing trace with hash -422905193, now seen corresponding path program 2 times [2022-04-15 11:23:49,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:23:49,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698230773] [2022-04-15 11:23:49,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:23:49,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:23:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:23:49,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:23:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:23:49,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {554513#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {554507#true} is VALID [2022-04-15 11:23:49,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {554507#true} assume true; {554507#true} is VALID [2022-04-15 11:23:49,696 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {554507#true} {554507#true} #285#return; {554507#true} is VALID [2022-04-15 11:23:49,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {554507#true} call ULTIMATE.init(); {554513#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:23:49,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {554513#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {554507#true} is VALID [2022-04-15 11:23:49,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {554507#true} assume true; {554507#true} is VALID [2022-04-15 11:23:49,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554507#true} {554507#true} #285#return; {554507#true} is VALID [2022-04-15 11:23:49,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {554507#true} call #t~ret20 := main(); {554507#true} is VALID [2022-04-15 11:23:49,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {554507#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {554507#true} is VALID [2022-04-15 11:23:49,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {554507#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {554507#true} is VALID [2022-04-15 11:23:49,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {554507#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {554507#true} is VALID [2022-04-15 11:23:49,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {554507#true} assume !(0 != ~p1~0); {554507#true} is VALID [2022-04-15 11:23:49,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {554507#true} assume !(0 != ~p2~0); {554507#true} is VALID [2022-04-15 11:23:49,696 INFO L290 TraceCheckUtils]: 10: Hoare triple {554507#true} assume !(0 != ~p3~0); {554507#true} is VALID [2022-04-15 11:23:49,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {554507#true} assume !(0 != ~p4~0); {554507#true} is VALID [2022-04-15 11:23:49,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {554507#true} assume !(0 != ~p5~0); {554507#true} is VALID [2022-04-15 11:23:49,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {554507#true} assume !(0 != ~p6~0); {554507#true} is VALID [2022-04-15 11:23:49,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {554507#true} assume !(0 != ~p7~0); {554507#true} is VALID [2022-04-15 11:23:49,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {554507#true} assume !(0 != ~p8~0); {554507#true} is VALID [2022-04-15 11:23:49,700 INFO L290 TraceCheckUtils]: 16: Hoare triple {554507#true} assume !(0 != ~p9~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-15 11:23:49,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p10~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-15 11:23:49,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {554512#(= main_~p9~0 0)} is VALID [2022-04-15 11:23:49,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {554512#(= main_~p9~0 0)} is VALID [2022-04-15 11:23:49,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {554512#(= main_~p9~0 0)} is VALID [2022-04-15 11:23:49,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {554512#(= main_~p9~0 0)} is VALID [2022-04-15 11:23:49,701 INFO L290 TraceCheckUtils]: 22: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {554512#(= main_~p9~0 0)} is VALID [2022-04-15 11:23:49,701 INFO L290 TraceCheckUtils]: 23: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p1~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-15 11:23:49,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p2~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-15 11:23:49,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p3~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-15 11:23:49,702 INFO L290 TraceCheckUtils]: 26: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p4~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-15 11:23:49,702 INFO L290 TraceCheckUtils]: 27: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p5~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-15 11:23:49,702 INFO L290 TraceCheckUtils]: 28: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p6~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-15 11:23:49,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p7~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-15 11:23:49,703 INFO L290 TraceCheckUtils]: 30: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p8~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-15 11:23:49,703 INFO L290 TraceCheckUtils]: 31: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p9~0; {554508#false} is VALID [2022-04-15 11:23:49,703 INFO L290 TraceCheckUtils]: 32: Hoare triple {554508#false} assume 1 != ~lk9~0; {554508#false} is VALID [2022-04-15 11:23:49,703 INFO L290 TraceCheckUtils]: 33: Hoare triple {554508#false} assume !false; {554508#false} is VALID [2022-04-15 11:23:49,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:23:49,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:23:49,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698230773] [2022-04-15 11:23:49,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698230773] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:23:49,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:23:49,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:23:49,704 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:23:49,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1247073676] [2022-04-15 11:23:49,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1247073676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:23:49,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:23:49,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:23:49,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948093545] [2022-04-15 11:23:49,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:23:49,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 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-15 11:23:49,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:23:49,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 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-15 11:23:49,721 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-15 11:23:49,721 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:23:49,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:23:49,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:23:49,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:23:49,721 INFO L87 Difference]: Start difference. First operand 16393 states and 24199 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 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-15 11:25:46,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:25:46,037 INFO L93 Difference]: Finished difference Result 38157 states and 56713 transitions. [2022-04-15 11:25:46,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:25:46,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 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-15 11:25:46,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:25:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 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-15 11:25:46,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2022-04-15 11:25:46,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 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-15 11:25:46,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2022-04-15 11:25:46,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 258 transitions. [2022-04-15 11:25:46,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:26:06,093 INFO L225 Difference]: With dead ends: 38157 [2022-04-15 11:26:06,093 INFO L226 Difference]: Without dead ends: 22027 [2022-04-15 11:26:06,112 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:26:06,112 INFO L913 BasicCegarLoop]: 144 mSDtfsCounter, 175 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:26:06,113 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 151 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:26:06,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22027 states. [2022-04-15 11:26:08,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22027 to 22025. [2022-04-15 11:26:08,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:26:08,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22027 states. Second operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:26:08,072 INFO L74 IsIncluded]: Start isIncluded. First operand 22027 states. Second operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:26:08,101 INFO L87 Difference]: Start difference. First operand 22027 states. Second operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:26:22,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:26:22,643 INFO L93 Difference]: Finished difference Result 22027 states and 32520 transitions. [2022-04-15 11:26:22,643 INFO L276 IsEmpty]: Start isEmpty. Operand 22027 states and 32520 transitions. [2022-04-15 11:26:22,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:26:22,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:26:22,687 INFO L74 IsIncluded]: Start isIncluded. First operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22027 states. [2022-04-15 11:26:22,716 INFO L87 Difference]: Start difference. First operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22027 states. [2022-04-15 11:26:35,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:26:35,075 INFO L93 Difference]: Finished difference Result 22027 states and 32520 transitions. [2022-04-15 11:26:35,075 INFO L276 IsEmpty]: Start isEmpty. Operand 22027 states and 32520 transitions. [2022-04-15 11:26:35,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:26:35,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:26:35,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:26:35,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:26:35,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:26:58,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22025 states to 22025 states and 32519 transitions. [2022-04-15 11:26:58,734 INFO L78 Accepts]: Start accepts. Automaton has 22025 states and 32519 transitions. Word has length 34 [2022-04-15 11:26:58,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:26:58,735 INFO L478 AbstractCegarLoop]: Abstraction has 22025 states and 32519 transitions. [2022-04-15 11:26:58,735 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 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-15 11:26:58,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22025 states and 32519 transitions. [2022-04-15 11:27:35,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32519 edges. 32519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:27:35,412 INFO L276 IsEmpty]: Start isEmpty. Operand 22025 states and 32519 transitions. [2022-04-15 11:27:35,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 11:27:35,424 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:27:35,424 INFO L499 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:27:35,424 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 11:27:35,424 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:27:35,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:27:35,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1463999138, now seen corresponding path program 1 times [2022-04-15 11:27:35,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:27:35,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2132861214] [2022-04-15 11:27:35,425 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:27:35,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1463999138, now seen corresponding path program 2 times [2022-04-15 11:27:35,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:27:35,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382793661] [2022-04-15 11:27:35,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:27:35,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:27:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:27:35,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:27:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:27:35,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {718943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {718937#true} is VALID [2022-04-15 11:27:35,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {718937#true} assume true; {718937#true} is VALID [2022-04-15 11:27:35,459 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {718937#true} {718937#true} #285#return; {718937#true} is VALID [2022-04-15 11:27:35,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {718937#true} call ULTIMATE.init(); {718943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:27:35,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {718943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {718937#true} is VALID [2022-04-15 11:27:35,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {718937#true} assume true; {718937#true} is VALID [2022-04-15 11:27:35,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {718937#true} {718937#true} #285#return; {718937#true} is VALID [2022-04-15 11:27:35,460 INFO L272 TraceCheckUtils]: 4: Hoare triple {718937#true} call #t~ret20 := main(); {718937#true} is VALID [2022-04-15 11:27:35,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {718937#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {718937#true} is VALID [2022-04-15 11:27:35,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {718937#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {718937#true} is VALID [2022-04-15 11:27:35,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {718937#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {718937#true} is VALID [2022-04-15 11:27:35,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {718937#true} assume !(0 != ~p1~0); {718937#true} is VALID [2022-04-15 11:27:35,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {718937#true} assume !(0 != ~p2~0); {718937#true} is VALID [2022-04-15 11:27:35,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {718937#true} assume !(0 != ~p3~0); {718937#true} is VALID [2022-04-15 11:27:35,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {718937#true} assume !(0 != ~p4~0); {718937#true} is VALID [2022-04-15 11:27:35,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {718937#true} assume !(0 != ~p5~0); {718937#true} is VALID [2022-04-15 11:27:35,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {718937#true} assume !(0 != ~p6~0); {718937#true} is VALID [2022-04-15 11:27:35,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {718937#true} assume !(0 != ~p7~0); {718937#true} is VALID [2022-04-15 11:27:35,461 INFO L290 TraceCheckUtils]: 15: Hoare triple {718937#true} assume !(0 != ~p8~0); {718937#true} is VALID [2022-04-15 11:27:35,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {718937#true} assume 0 != ~p9~0;~lk9~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:27:35,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:27:35,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {718942#(not (= main_~p9~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:27:35,461 INFO L290 TraceCheckUtils]: 19: Hoare triple {718942#(not (= main_~p9~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:27:35,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {718942#(not (= main_~p9~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:27:35,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {718942#(not (= main_~p9~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:27:35,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {718942#(not (= main_~p9~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:27:35,462 INFO L290 TraceCheckUtils]: 23: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:27:35,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:27:35,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:27:35,463 INFO L290 TraceCheckUtils]: 26: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:27:35,463 INFO L290 TraceCheckUtils]: 27: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:27:35,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:27:35,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:27:35,464 INFO L290 TraceCheckUtils]: 30: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:27:35,464 INFO L290 TraceCheckUtils]: 31: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {718938#false} is VALID [2022-04-15 11:27:35,465 INFO L290 TraceCheckUtils]: 32: Hoare triple {718938#false} assume 0 != ~p10~0; {718938#false} is VALID [2022-04-15 11:27:35,465 INFO L290 TraceCheckUtils]: 33: Hoare triple {718938#false} assume 1 != ~lk10~0; {718938#false} is VALID [2022-04-15 11:27:35,465 INFO L290 TraceCheckUtils]: 34: Hoare triple {718938#false} assume !false; {718938#false} is VALID [2022-04-15 11:27:35,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:27:35,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:27:35,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382793661] [2022-04-15 11:27:35,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382793661] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:27:35,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:27:35,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:27:35,465 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:27:35,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2132861214] [2022-04-15 11:27:35,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2132861214] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:27:35,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:27:35,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:27:35,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889375857] [2022-04-15 11:27:35,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:27:35,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 11:27:35,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:27:35,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:27:35,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:27:35,485 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:27:35,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:27:35,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:27:35,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:27:35,486 INFO L87 Difference]: Start difference. First operand 22025 states and 32519 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:29:02,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:29:02,611 INFO L93 Difference]: Finished difference Result 33037 states and 48649 transitions. [2022-04-15 11:29:02,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:29:02,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 11:29:02,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:29:02,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:29:02,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2022-04-15 11:29:02,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:29:02,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2022-04-15 11:29:02,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 253 transitions. [2022-04-15 11:29:02,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:29:22,953 INFO L225 Difference]: With dead ends: 33037 [2022-04-15 11:29:22,953 INFO L226 Difference]: Without dead ends: 22283 [2022-04-15 11:29:22,967 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:29:22,968 INFO L913 BasicCegarLoop]: 132 mSDtfsCounter, 188 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:29:22,968 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 139 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:29:22,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22283 states. [2022-04-15 11:29:24,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22283 to 22281. [2022-04-15 11:29:24,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:29:24,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22283 states. Second operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:29:25,007 INFO L74 IsIncluded]: Start isIncluded. First operand 22283 states. Second operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:29:25,034 INFO L87 Difference]: Start difference. First operand 22283 states. Second operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:29:38,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:29:38,550 INFO L93 Difference]: Finished difference Result 22283 states and 32520 transitions. [2022-04-15 11:29:38,550 INFO L276 IsEmpty]: Start isEmpty. Operand 22283 states and 32520 transitions. [2022-04-15 11:29:38,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:29:38,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:29:38,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22283 states. [2022-04-15 11:29:38,618 INFO L87 Difference]: Start difference. First operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22283 states. [2022-04-15 11:29:54,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:29:54,533 INFO L93 Difference]: Finished difference Result 22283 states and 32520 transitions. [2022-04-15 11:29:54,533 INFO L276 IsEmpty]: Start isEmpty. Operand 22283 states and 32520 transitions. [2022-04-15 11:29:54,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:29:54,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:29:54,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:29:54,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:29:54,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:30:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22281 states to 22281 states and 32519 transitions. [2022-04-15 11:30:20,478 INFO L78 Accepts]: Start accepts. Automaton has 22281 states and 32519 transitions. Word has length 35 [2022-04-15 11:30:20,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:30:20,478 INFO L478 AbstractCegarLoop]: Abstraction has 22281 states and 32519 transitions. [2022-04-15 11:30:20,478 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:30:20,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22281 states and 32519 transitions. [2022-04-15 11:30:56,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32519 edges. 32519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:30:56,995 INFO L276 IsEmpty]: Start isEmpty. Operand 22281 states and 32519 transitions. [2022-04-15 11:30:57,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 11:30:57,008 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:30:57,008 INFO L499 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:30:57,008 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 11:30:57,008 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:30:57,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:30:57,008 INFO L85 PathProgramCache]: Analyzing trace with hash -224944604, now seen corresponding path program 1 times [2022-04-15 11:30:57,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:30:57,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1069128730] [2022-04-15 11:30:57,009 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:30:57,009 INFO L85 PathProgramCache]: Analyzing trace with hash -224944604, now seen corresponding path program 2 times [2022-04-15 11:30:57,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:30:57,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123213511] [2022-04-15 11:30:57,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:30:57,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:30:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:57,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:30:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:57,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {874157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {874151#true} is VALID [2022-04-15 11:30:57,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {874151#true} assume true; {874151#true} is VALID [2022-04-15 11:30:57,041 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {874151#true} {874151#true} #285#return; {874151#true} is VALID [2022-04-15 11:30:57,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {874151#true} call ULTIMATE.init(); {874157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:30:57,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {874157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {874151#true} is VALID [2022-04-15 11:30:57,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {874151#true} assume true; {874151#true} is VALID [2022-04-15 11:30:57,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {874151#true} {874151#true} #285#return; {874151#true} is VALID [2022-04-15 11:30:57,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {874151#true} call #t~ret20 := main(); {874151#true} is VALID [2022-04-15 11:30:57,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {874151#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {874151#true} is VALID [2022-04-15 11:30:57,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {874151#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {874151#true} is VALID [2022-04-15 11:30:57,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {874151#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {874151#true} is VALID [2022-04-15 11:30:57,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {874151#true} assume !(0 != ~p1~0); {874151#true} is VALID [2022-04-15 11:30:57,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {874151#true} assume !(0 != ~p2~0); {874151#true} is VALID [2022-04-15 11:30:57,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {874151#true} assume !(0 != ~p3~0); {874151#true} is VALID [2022-04-15 11:30:57,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {874151#true} assume !(0 != ~p4~0); {874151#true} is VALID [2022-04-15 11:30:57,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {874151#true} assume !(0 != ~p5~0); {874151#true} is VALID [2022-04-15 11:30:57,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {874151#true} assume !(0 != ~p6~0); {874151#true} is VALID [2022-04-15 11:30:57,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {874151#true} assume !(0 != ~p7~0); {874151#true} is VALID [2022-04-15 11:30:57,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {874151#true} assume !(0 != ~p8~0); {874151#true} is VALID [2022-04-15 11:30:57,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {874151#true} assume !(0 != ~p9~0); {874151#true} is VALID [2022-04-15 11:30:57,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {874151#true} assume !(0 != ~p10~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-15 11:30:57,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {874156#(= main_~p10~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {874156#(= main_~p10~0 0)} is VALID [2022-04-15 11:30:57,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {874156#(= main_~p10~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {874156#(= main_~p10~0 0)} is VALID [2022-04-15 11:30:57,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {874156#(= main_~p10~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {874156#(= main_~p10~0 0)} is VALID [2022-04-15 11:30:57,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {874156#(= main_~p10~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {874156#(= main_~p10~0 0)} is VALID [2022-04-15 11:30:57,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {874156#(= main_~p10~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {874156#(= main_~p10~0 0)} is VALID [2022-04-15 11:30:57,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {874156#(= main_~p10~0 0)} assume !(0 != ~p1~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-15 11:30:57,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {874156#(= main_~p10~0 0)} assume !(0 != ~p2~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-15 11:30:57,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {874156#(= main_~p10~0 0)} assume !(0 != ~p3~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-15 11:30:57,045 INFO L290 TraceCheckUtils]: 26: Hoare triple {874156#(= main_~p10~0 0)} assume !(0 != ~p4~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-15 11:30:57,045 INFO L290 TraceCheckUtils]: 27: Hoare triple {874156#(= main_~p10~0 0)} assume !(0 != ~p5~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-15 11:30:57,046 INFO L290 TraceCheckUtils]: 28: Hoare triple {874156#(= main_~p10~0 0)} assume !(0 != ~p6~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-15 11:30:57,046 INFO L290 TraceCheckUtils]: 29: Hoare triple {874156#(= main_~p10~0 0)} assume !(0 != ~p7~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-15 11:30:57,046 INFO L290 TraceCheckUtils]: 30: Hoare triple {874156#(= main_~p10~0 0)} assume !(0 != ~p8~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-15 11:30:57,046 INFO L290 TraceCheckUtils]: 31: Hoare triple {874156#(= main_~p10~0 0)} assume !(0 != ~p9~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-15 11:30:57,047 INFO L290 TraceCheckUtils]: 32: Hoare triple {874156#(= main_~p10~0 0)} assume 0 != ~p10~0; {874152#false} is VALID [2022-04-15 11:30:57,047 INFO L290 TraceCheckUtils]: 33: Hoare triple {874152#false} assume 1 != ~lk10~0; {874152#false} is VALID [2022-04-15 11:30:57,047 INFO L290 TraceCheckUtils]: 34: Hoare triple {874152#false} assume !false; {874152#false} is VALID [2022-04-15 11:30:57,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:30:57,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:30:57,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123213511] [2022-04-15 11:30:57,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123213511] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:30:57,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:30:57,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:30:57,047 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:30:57,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1069128730] [2022-04-15 11:30:57,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1069128730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:30:57,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:30:57,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:30:57,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116402098] [2022-04-15 11:30:57,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:30:57,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 11:30:57,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:30:57,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:30:57,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:30:57,066 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:30:57,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:30:57,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:30:57,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:30:57,067 INFO L87 Difference]: Start difference. First operand 22281 states and 32519 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)