/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_14-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 08:16:14,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:16:14,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:16:14,892 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:16:14,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:16:14,893 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:16:14,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:16:14,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:16:14,895 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:16:14,896 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:16:14,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:16:14,897 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:16:14,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:16:14,898 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:16:14,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:16:14,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:16:14,899 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:16:14,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:16:14,900 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:16:14,901 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:16:14,902 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:16:14,903 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:16:14,903 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:16:14,904 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:16:14,904 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:16:14,906 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:16:14,906 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:16:14,906 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:16:14,907 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:16:14,907 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:16:14,907 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:16:14,908 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:16:14,908 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:16:14,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:16:14,909 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:16:14,909 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:16:14,909 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:16:14,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:16:14,910 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:16:14,910 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:16:14,911 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:16:14,911 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:16:14,912 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 08:16:14,917 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:16:14,917 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:16:14,918 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:16:14,918 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:16:14,918 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:16:14,918 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:16:14,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:16:14,919 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:16:14,919 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:16:14,919 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:16:14,919 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:16:14,919 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:16:14,919 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:16:14,920 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:16:14,920 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:16:14,920 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:16:14,920 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:16:14,920 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:16:14,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:16:14,920 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:16:14,920 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:16:14,921 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:16:14,921 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:16:14,921 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:16:14,921 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:16:14,921 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 08:16:15,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:16:15,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:16:15,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:16:15,077 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:16:15,078 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:16:15,079 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_14-1.c [2022-04-28 08:16:15,133 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c35fe4fae/d212d4a5e0e447b9aea75cbb9e11261c/FLAG438fc2f5e [2022-04-28 08:16:15,512 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:16:15,512 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-1.c [2022-04-28 08:16:15,517 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c35fe4fae/d212d4a5e0e447b9aea75cbb9e11261c/FLAG438fc2f5e [2022-04-28 08:16:15,525 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c35fe4fae/d212d4a5e0e447b9aea75cbb9e11261c [2022-04-28 08:16:15,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:16:15,527 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:16:15,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:16:15,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:16:15,530 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:16:15,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:16:15" (1/1) ... [2022-04-28 08:16:15,531 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f281993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:15, skipping insertion in model container [2022-04-28 08:16:15,531 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:16:15" (1/1) ... [2022-04-28 08:16:15,535 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:16:15,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:16:15,672 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_14-1.c[5283,5296] [2022-04-28 08:16:15,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:16:15,679 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:16:15,709 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_14-1.c[5283,5296] [2022-04-28 08:16:15,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:16:15,718 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:16:15,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:15 WrapperNode [2022-04-28 08:16:15,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:16:15,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:16:15,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:16:15,719 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:16:15,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:15" (1/1) ... [2022-04-28 08:16:15,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:15" (1/1) ... [2022-04-28 08:16:15,730 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:15" (1/1) ... [2022-04-28 08:16:15,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:15" (1/1) ... [2022-04-28 08:16:15,735 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:15" (1/1) ... [2022-04-28 08:16:15,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:15" (1/1) ... [2022-04-28 08:16:15,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:15" (1/1) ... [2022-04-28 08:16:15,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:16:15,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:16:15,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:16:15,750 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:16:15,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:15" (1/1) ... [2022-04-28 08:16:15,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:16:15,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:16:15,777 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 08:16:15,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 08:16:15,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:16:15,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:16:15,802 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:16:15,802 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:16:15,803 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:16:15,803 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:16:15,803 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:16:15,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:16:15,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:16:15,803 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:16:15,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:16:15,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:16:15,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:16:15,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:16:15,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:16:15,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:16:15,874 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:16:15,875 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:16:16,105 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:16:16,110 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:16:16,110 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 08:16:16,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:16:16 BoogieIcfgContainer [2022-04-28 08:16:16,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:16:16,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:16:16,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:16:16,114 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:16:16,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:16:15" (1/3) ... [2022-04-28 08:16:16,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4a295d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:16:16, skipping insertion in model container [2022-04-28 08:16:16,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:15" (2/3) ... [2022-04-28 08:16:16,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4a295d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:16:16, skipping insertion in model container [2022-04-28 08:16:16,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:16:16" (3/3) ... [2022-04-28 08:16:16,116 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2022-04-28 08:16:16,124 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:16:16,125 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:16:16,161 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:16:16,167 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@647835a0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@cae5045 [2022-04-28 08:16:16,167 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:16:16,173 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 52 states have internal predecessors, (97), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 08:16:16,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 08:16:16,178 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:16,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:16,179 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:16,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:16,182 INFO L85 PathProgramCache]: Analyzing trace with hash -406532905, now seen corresponding path program 1 times [2022-04-28 08:16:16,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:16,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1777719459] [2022-04-28 08:16:16,194 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:16,194 INFO L85 PathProgramCache]: Analyzing trace with hash -406532905, now seen corresponding path program 2 times [2022-04-28 08:16:16,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:16,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274251145] [2022-04-28 08:16:16,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:16,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:16,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:16,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {60#true} is VALID [2022-04-28 08:16:16,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#true} assume true; {60#true} is VALID [2022-04-28 08:16:16,385 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60#true} {60#true} #268#return; {60#true} is VALID [2022-04-28 08:16:16,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {60#true} call ULTIMATE.init(); {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:16,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {60#true} is VALID [2022-04-28 08:16:16,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {60#true} assume true; {60#true} is VALID [2022-04-28 08:16:16,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60#true} {60#true} #268#return; {60#true} is VALID [2022-04-28 08:16:16,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {60#true} call #t~ret19 := main(); {60#true} is VALID [2022-04-28 08:16:16,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {60#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;havoc ~cond~0; {60#true} is VALID [2022-04-28 08:16:16,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {60#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {60#true} is VALID [2022-04-28 08:16:16,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {60#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; {60#true} is VALID [2022-04-28 08:16:16,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {60#true} assume 0 != ~p1~0;~lk1~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:16,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {65#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {65#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:16,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:16,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:16,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:16,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:16,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:16,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:16,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:16,403 INFO L290 TraceCheckUtils]: 17: Hoare triple {65#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {65#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:16,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:16,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:16,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:16,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:16,405 INFO L290 TraceCheckUtils]: 22: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p1~0; {65#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:16,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {65#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {61#false} is VALID [2022-04-28 08:16:16,406 INFO L290 TraceCheckUtils]: 24: Hoare triple {61#false} assume !false; {61#false} is VALID [2022-04-28 08:16:16,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:16,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:16,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274251145] [2022-04-28 08:16:16,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274251145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:16,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:16,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:16,409 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:16,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1777719459] [2022-04-28 08:16:16,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1777719459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:16,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:16,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:16,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967911374] [2022-04-28 08:16:16,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:16,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 08:16:16,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:16,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:16,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:16,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:16,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:16,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:16,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:16,456 INFO L87 Difference]: Start difference. First operand has 57 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 52 states have internal predecessors, (97), 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.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:16,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:16,748 INFO L93 Difference]: Finished difference Result 112 states and 199 transitions. [2022-04-28 08:16:16,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:16,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 08:16:16,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:16,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:16,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-28 08:16:16,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:16,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-28 08:16:16,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 199 transitions. [2022-04-28 08:16:16,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:16,931 INFO L225 Difference]: With dead ends: 112 [2022-04-28 08:16:16,931 INFO L226 Difference]: Without dead ends: 97 [2022-04-28 08:16:16,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:16,938 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 242 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:16,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 113 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:16:16,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-28 08:16:16,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 67. [2022-04-28 08:16:16,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:16,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:16,979 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:16,981 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:16,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:16,990 INFO L93 Difference]: Finished difference Result 97 states and 177 transitions. [2022-04-28 08:16:16,990 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 177 transitions. [2022-04-28 08:16:16,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:16,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:16,991 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states. [2022-04-28 08:16:16,993 INFO L87 Difference]: Start difference. First operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states. [2022-04-28 08:16:17,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:17,009 INFO L93 Difference]: Finished difference Result 97 states and 177 transitions. [2022-04-28 08:16:17,009 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 177 transitions. [2022-04-28 08:16:17,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:17,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:17,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:17,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:17,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:17,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 122 transitions. [2022-04-28 08:16:17,014 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 122 transitions. Word has length 25 [2022-04-28 08:16:17,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:17,014 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 122 transitions. [2022-04-28 08:16:17,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:17,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 122 transitions. [2022-04-28 08:16:17,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:17,147 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 122 transitions. [2022-04-28 08:16:17,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 08:16:17,148 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:17,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:17,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:16:17,148 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:17,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:17,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1994880807, now seen corresponding path program 1 times [2022-04-28 08:16:17,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:17,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1784765181] [2022-04-28 08:16:17,150 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:17,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1994880807, now seen corresponding path program 2 times [2022-04-28 08:16:17,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:17,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788555826] [2022-04-28 08:16:17,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:17,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:17,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:17,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {624#true} is VALID [2022-04-28 08:16:17,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {624#true} assume true; {624#true} is VALID [2022-04-28 08:16:17,243 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {624#true} {624#true} #268#return; {624#true} is VALID [2022-04-28 08:16:17,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {624#true} call ULTIMATE.init(); {630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:17,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {624#true} is VALID [2022-04-28 08:16:17,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {624#true} assume true; {624#true} is VALID [2022-04-28 08:16:17,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {624#true} {624#true} #268#return; {624#true} is VALID [2022-04-28 08:16:17,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {624#true} call #t~ret19 := main(); {624#true} is VALID [2022-04-28 08:16:17,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {624#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;havoc ~cond~0; {624#true} is VALID [2022-04-28 08:16:17,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {624#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {624#true} is VALID [2022-04-28 08:16:17,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {624#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; {624#true} is VALID [2022-04-28 08:16:17,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {624#true} assume !(0 != ~p1~0); {629#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:17,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {629#(= main_~p1~0 0)} assume !(0 != ~p2~0); {629#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:17,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:17,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:17,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:17,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:17,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:17,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:17,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:17,248 INFO L290 TraceCheckUtils]: 17: Hoare triple {629#(= main_~p1~0 0)} assume !(0 != ~p10~0); {629#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:17,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:17,249 INFO L290 TraceCheckUtils]: 19: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:17,249 INFO L290 TraceCheckUtils]: 20: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:17,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:17,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p1~0; {625#false} is VALID [2022-04-28 08:16:17,250 INFO L290 TraceCheckUtils]: 23: Hoare triple {625#false} assume 1 != ~lk1~0; {625#false} is VALID [2022-04-28 08:16:17,250 INFO L290 TraceCheckUtils]: 24: Hoare triple {625#false} assume !false; {625#false} is VALID [2022-04-28 08:16:17,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:17,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:17,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788555826] [2022-04-28 08:16:17,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788555826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:17,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:17,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:17,252 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:17,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1784765181] [2022-04-28 08:16:17,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1784765181] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:17,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:17,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:17,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984745478] [2022-04-28 08:16:17,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:17,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 08:16:17,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:17,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:17,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:17,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:17,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:17,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:17,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:17,269 INFO L87 Difference]: Start difference. First operand 67 states and 122 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:17,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:17,469 INFO L93 Difference]: Finished difference Result 158 states and 293 transitions. [2022-04-28 08:16:17,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:17,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 08:16:17,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:17,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:17,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2022-04-28 08:16:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:17,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2022-04-28 08:16:17,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 264 transitions. [2022-04-28 08:16:17,625 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-28 08:16:17,627 INFO L225 Difference]: With dead ends: 158 [2022-04-28 08:16:17,627 INFO L226 Difference]: Without dead ends: 97 [2022-04-28 08:16:17,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:17,628 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 208 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 127 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-28 08:16:17,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 127 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:17,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-28 08:16:17,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2022-04-28 08:16:17,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:17,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:17,644 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:17,645 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:17,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:17,649 INFO L93 Difference]: Finished difference Result 97 states and 175 transitions. [2022-04-28 08:16:17,650 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2022-04-28 08:16:17,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:17,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:17,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states. [2022-04-28 08:16:17,652 INFO L87 Difference]: Start difference. First operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states. [2022-04-28 08:16:17,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:17,656 INFO L93 Difference]: Finished difference Result 97 states and 175 transitions. [2022-04-28 08:16:17,656 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2022-04-28 08:16:17,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:17,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:17,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:17,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:17,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:17,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 174 transitions. [2022-04-28 08:16:17,663 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 174 transitions. Word has length 25 [2022-04-28 08:16:17,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:17,663 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 174 transitions. [2022-04-28 08:16:17,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:17,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 174 transitions. [2022-04-28 08:16:17,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:17,781 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 174 transitions. [2022-04-28 08:16:17,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 08:16:17,783 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:17,783 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:17,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:16:17,788 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:17,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:17,792 INFO L85 PathProgramCache]: Analyzing trace with hash 282593920, now seen corresponding path program 1 times [2022-04-28 08:16:17,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:17,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1769614945] [2022-04-28 08:16:17,793 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:17,793 INFO L85 PathProgramCache]: Analyzing trace with hash 282593920, now seen corresponding path program 2 times [2022-04-28 08:16:17,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:17,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850552550] [2022-04-28 08:16:17,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:17,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:17,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:17,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {1342#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1336#true} is VALID [2022-04-28 08:16:17,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {1336#true} assume true; {1336#true} is VALID [2022-04-28 08:16:17,880 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1336#true} {1336#true} #268#return; {1336#true} is VALID [2022-04-28 08:16:17,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {1336#true} call ULTIMATE.init(); {1342#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:17,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {1342#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1336#true} is VALID [2022-04-28 08:16:17,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {1336#true} assume true; {1336#true} is VALID [2022-04-28 08:16:17,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1336#true} {1336#true} #268#return; {1336#true} is VALID [2022-04-28 08:16:17,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {1336#true} call #t~ret19 := main(); {1336#true} is VALID [2022-04-28 08:16:17,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {1336#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;havoc ~cond~0; {1336#true} is VALID [2022-04-28 08:16:17,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {1336#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {1336#true} is VALID [2022-04-28 08:16:17,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {1336#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; {1336#true} is VALID [2022-04-28 08:16:17,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {1336#true} assume 0 != ~p1~0;~lk1~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:17,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {1341#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {1341#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:17,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:17,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:17,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:17,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:17,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:17,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:17,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:17,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {1341#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {1341#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:17,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:17,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:17,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:17,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:17,886 INFO L290 TraceCheckUtils]: 22: Hoare triple {1341#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1337#false} is VALID [2022-04-28 08:16:17,886 INFO L290 TraceCheckUtils]: 23: Hoare triple {1337#false} assume 0 != ~p2~0; {1337#false} is VALID [2022-04-28 08:16:17,886 INFO L290 TraceCheckUtils]: 24: Hoare triple {1337#false} assume 1 != ~lk2~0; {1337#false} is VALID [2022-04-28 08:16:17,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {1337#false} assume !false; {1337#false} is VALID [2022-04-28 08:16:17,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:17,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:17,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850552550] [2022-04-28 08:16:17,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850552550] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:17,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:17,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:17,888 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:17,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1769614945] [2022-04-28 08:16:17,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1769614945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:17,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:17,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:17,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134757905] [2022-04-28 08:16:17,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:17,889 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-28 08:16:17,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:17,889 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-28 08:16:17,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:17,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:17,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:17,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:17,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:17,904 INFO L87 Difference]: Start difference. First operand 95 states and 174 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-28 08:16:18,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:18,113 INFO L93 Difference]: Finished difference Result 145 states and 262 transitions. [2022-04-28 08:16:18,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:18,113 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-28 08:16:18,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:18,114 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-28 08:16:18,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2022-04-28 08:16:18,117 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-28 08:16:18,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2022-04-28 08:16:18,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 259 transitions. [2022-04-28 08:16:18,264 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-28 08:16:18,265 INFO L225 Difference]: With dead ends: 145 [2022-04-28 08:16:18,265 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 08:16:18,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:18,267 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 183 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 153 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-28 08:16:18,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 153 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:18,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 08:16:18,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2022-04-28 08:16:18,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:18,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:18,275 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:18,275 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:18,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:18,278 INFO L93 Difference]: Finished difference Result 100 states and 177 transitions. [2022-04-28 08:16:18,278 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 177 transitions. [2022-04-28 08:16:18,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:18,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:18,278 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 100 states. [2022-04-28 08:16:18,278 INFO L87 Difference]: Start difference. First operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 100 states. [2022-04-28 08:16:18,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:18,281 INFO L93 Difference]: Finished difference Result 100 states and 177 transitions. [2022-04-28 08:16:18,281 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 177 transitions. [2022-04-28 08:16:18,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:18,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:18,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:18,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:18,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:18,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 176 transitions. [2022-04-28 08:16:18,284 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 176 transitions. Word has length 26 [2022-04-28 08:16:18,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:18,284 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 176 transitions. [2022-04-28 08:16:18,284 INFO L496 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-28 08:16:18,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 176 transitions. [2022-04-28 08:16:18,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:18,408 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 176 transitions. [2022-04-28 08:16:18,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 08:16:18,408 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:18,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:18,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 08:16:18,409 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:18,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:18,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1711550786, now seen corresponding path program 1 times [2022-04-28 08:16:18,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:18,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [255668175] [2022-04-28 08:16:18,410 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:18,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1711550786, now seen corresponding path program 2 times [2022-04-28 08:16:18,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:18,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037304105] [2022-04-28 08:16:18,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:18,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:18,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:18,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {2040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {2034#true} is VALID [2022-04-28 08:16:18,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {2034#true} assume true; {2034#true} is VALID [2022-04-28 08:16:18,454 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2034#true} {2034#true} #268#return; {2034#true} is VALID [2022-04-28 08:16:18,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {2034#true} call ULTIMATE.init(); {2040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:18,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {2040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {2034#true} is VALID [2022-04-28 08:16:18,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {2034#true} assume true; {2034#true} is VALID [2022-04-28 08:16:18,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2034#true} {2034#true} #268#return; {2034#true} is VALID [2022-04-28 08:16:18,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {2034#true} call #t~ret19 := main(); {2034#true} is VALID [2022-04-28 08:16:18,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {2034#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;havoc ~cond~0; {2034#true} is VALID [2022-04-28 08:16:18,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {2034#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {2034#true} is VALID [2022-04-28 08:16:18,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {2034#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; {2034#true} is VALID [2022-04-28 08:16:18,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {2034#true} assume !(0 != ~p1~0); {2034#true} is VALID [2022-04-28 08:16:18,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {2034#true} assume !(0 != ~p2~0); {2039#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:18,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:18,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:18,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:18,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:18,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:18,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:18,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:18,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {2039#(= main_~p2~0 0)} assume !(0 != ~p10~0); {2039#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:18,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:18,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:18,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:18,459 INFO L290 TraceCheckUtils]: 21: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:18,460 INFO L290 TraceCheckUtils]: 22: Hoare triple {2039#(= main_~p2~0 0)} assume !(0 != ~p1~0); {2039#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:18,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p2~0; {2035#false} is VALID [2022-04-28 08:16:18,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {2035#false} assume 1 != ~lk2~0; {2035#false} is VALID [2022-04-28 08:16:18,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {2035#false} assume !false; {2035#false} is VALID [2022-04-28 08:16:18,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:18,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:18,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037304105] [2022-04-28 08:16:18,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037304105] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:18,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:18,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:18,461 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:18,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [255668175] [2022-04-28 08:16:18,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [255668175] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:18,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:18,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:18,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764351583] [2022-04-28 08:16:18,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:18,462 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-28 08:16:18,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:18,462 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-28 08:16:18,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:18,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:18,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:18,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:18,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:18,476 INFO L87 Difference]: Start difference. First operand 98 states and 176 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-28 08:16:18,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:18,660 INFO L93 Difference]: Finished difference Result 274 states and 504 transitions. [2022-04-28 08:16:18,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:18,660 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-28 08:16:18,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:18,661 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-28 08:16:18,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2022-04-28 08:16:18,663 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-28 08:16:18,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2022-04-28 08:16:18,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 262 transitions. [2022-04-28 08:16:18,821 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-28 08:16:18,824 INFO L225 Difference]: With dead ends: 274 [2022-04-28 08:16:18,824 INFO L226 Difference]: Without dead ends: 185 [2022-04-28 08:16:18,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:18,825 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 231 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 103 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-28 08:16:18,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 103 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:18,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-04-28 08:16:18,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2022-04-28 08:16:18,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:18,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:18,836 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:18,837 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:18,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:18,841 INFO L93 Difference]: Finished difference Result 185 states and 334 transitions. [2022-04-28 08:16:18,841 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 334 transitions. [2022-04-28 08:16:18,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:18,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:18,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 185 states. [2022-04-28 08:16:18,842 INFO L87 Difference]: Start difference. First operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 185 states. [2022-04-28 08:16:18,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:18,846 INFO L93 Difference]: Finished difference Result 185 states and 334 transitions. [2022-04-28 08:16:18,846 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 334 transitions. [2022-04-28 08:16:18,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:18,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:18,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:18,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:18,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:18,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 333 transitions. [2022-04-28 08:16:18,851 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 333 transitions. Word has length 26 [2022-04-28 08:16:18,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:18,851 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 333 transitions. [2022-04-28 08:16:18,851 INFO L496 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-28 08:16:18,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 183 states and 333 transitions. [2022-04-28 08:16:19,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 333 edges. 333 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:19,116 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 333 transitions. [2022-04-28 08:16:19,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 08:16:19,116 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:19,116 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:19,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 08:16:19,117 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:19,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:19,117 INFO L85 PathProgramCache]: Analyzing trace with hash -123202884, now seen corresponding path program 1 times [2022-04-28 08:16:19,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:19,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2052656544] [2022-04-28 08:16:19,118 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:19,118 INFO L85 PathProgramCache]: Analyzing trace with hash -123202884, now seen corresponding path program 2 times [2022-04-28 08:16:19,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:19,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933231192] [2022-04-28 08:16:19,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:19,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:19,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:19,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {3336#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {3330#true} is VALID [2022-04-28 08:16:19,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {3330#true} assume true; {3330#true} is VALID [2022-04-28 08:16:19,160 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3330#true} {3330#true} #268#return; {3330#true} is VALID [2022-04-28 08:16:19,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {3330#true} call ULTIMATE.init(); {3336#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:19,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {3336#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {3330#true} is VALID [2022-04-28 08:16:19,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {3330#true} assume true; {3330#true} is VALID [2022-04-28 08:16:19,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3330#true} {3330#true} #268#return; {3330#true} is VALID [2022-04-28 08:16:19,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {3330#true} call #t~ret19 := main(); {3330#true} is VALID [2022-04-28 08:16:19,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {3330#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;havoc ~cond~0; {3330#true} is VALID [2022-04-28 08:16:19,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {3330#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {3330#true} is VALID [2022-04-28 08:16:19,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {3330#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; {3330#true} is VALID [2022-04-28 08:16:19,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {3330#true} assume !(0 != ~p1~0); {3330#true} is VALID [2022-04-28 08:16:19,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {3330#true} assume 0 != ~p2~0;~lk2~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:19,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:19,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:19,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:19,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:19,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:19,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:19,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:19,165 INFO L290 TraceCheckUtils]: 17: Hoare triple {3335#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:19,165 INFO L290 TraceCheckUtils]: 18: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:19,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:19,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:19,166 INFO L290 TraceCheckUtils]: 21: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:19,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {3335#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:19,166 INFO L290 TraceCheckUtils]: 23: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p2~0; {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:19,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {3335#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {3331#false} is VALID [2022-04-28 08:16:19,167 INFO L290 TraceCheckUtils]: 25: Hoare triple {3331#false} assume !false; {3331#false} is VALID [2022-04-28 08:16:19,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:19,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:19,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933231192] [2022-04-28 08:16:19,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933231192] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:19,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:19,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:19,168 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:19,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2052656544] [2022-04-28 08:16:19,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2052656544] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:19,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:19,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:19,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811941165] [2022-04-28 08:16:19,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:19,168 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-28 08:16:19,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:19,169 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-28 08:16:19,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:19,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:19,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:19,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:19,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:19,183 INFO L87 Difference]: Start difference. First operand 183 states and 333 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-28 08:16:19,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:19,373 INFO L93 Difference]: Finished difference Result 239 states and 435 transitions. [2022-04-28 08:16:19,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:19,374 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-28 08:16:19,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:19,374 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-28 08:16:19,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-28 08:16:19,376 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-28 08:16:19,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-28 08:16:19,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 172 transitions. [2022-04-28 08:16:19,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:19,488 INFO L225 Difference]: With dead ends: 239 [2022-04-28 08:16:19,488 INFO L226 Difference]: Without dead ends: 237 [2022-04-28 08:16:19,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:19,489 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 150 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 176 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-28 08:16:19,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 176 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:19,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-04-28 08:16:19,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 183. [2022-04-28 08:16:19,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:19,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:19,500 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:19,500 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:19,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:19,505 INFO L93 Difference]: Finished difference Result 237 states and 432 transitions. [2022-04-28 08:16:19,505 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 432 transitions. [2022-04-28 08:16:19,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:19,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:19,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 237 states. [2022-04-28 08:16:19,506 INFO L87 Difference]: Start difference. First operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 237 states. [2022-04-28 08:16:19,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:19,511 INFO L93 Difference]: Finished difference Result 237 states and 432 transitions. [2022-04-28 08:16:19,511 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 432 transitions. [2022-04-28 08:16:19,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:19,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:19,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:19,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:19,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:19,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 331 transitions. [2022-04-28 08:16:19,516 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 331 transitions. Word has length 26 [2022-04-28 08:16:19,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:19,516 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 331 transitions. [2022-04-28 08:16:19,516 INFO L496 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-28 08:16:19,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 183 states and 331 transitions. [2022-04-28 08:16:19,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 331 edges. 331 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:19,764 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 331 transitions. [2022-04-28 08:16:19,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 08:16:19,764 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:19,764 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:19,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 08:16:19,765 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:19,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:19,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1518254386, now seen corresponding path program 1 times [2022-04-28 08:16:19,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:19,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1995151828] [2022-04-28 08:16:19,765 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:19,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1518254386, now seen corresponding path program 2 times [2022-04-28 08:16:19,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:19,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851570307] [2022-04-28 08:16:19,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:19,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:19,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:19,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {4666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {4660#true} is VALID [2022-04-28 08:16:19,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {4660#true} assume true; {4660#true} is VALID [2022-04-28 08:16:19,806 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4660#true} {4660#true} #268#return; {4660#true} is VALID [2022-04-28 08:16:19,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {4660#true} call ULTIMATE.init(); {4666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:19,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {4666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {4660#true} is VALID [2022-04-28 08:16:19,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {4660#true} assume true; {4660#true} is VALID [2022-04-28 08:16:19,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4660#true} {4660#true} #268#return; {4660#true} is VALID [2022-04-28 08:16:19,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {4660#true} call #t~ret19 := main(); {4660#true} is VALID [2022-04-28 08:16:19,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {4660#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;havoc ~cond~0; {4660#true} is VALID [2022-04-28 08:16:19,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {4660#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {4660#true} is VALID [2022-04-28 08:16:19,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {4660#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; {4660#true} is VALID [2022-04-28 08:16:19,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {4660#true} assume !(0 != ~p1~0); {4660#true} is VALID [2022-04-28 08:16:19,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {4660#true} assume !(0 != ~p2~0); {4660#true} is VALID [2022-04-28 08:16:19,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {4660#true} assume 0 != ~p3~0;~lk3~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:19,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:19,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:19,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:19,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:19,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:19,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:19,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {4665#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:19,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:19,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:19,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:19,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:19,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {4665#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:19,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {4665#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:19,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p3~0; {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:19,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {4665#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {4661#false} is VALID [2022-04-28 08:16:19,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {4661#false} assume !false; {4661#false} is VALID [2022-04-28 08:16:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:19,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:19,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851570307] [2022-04-28 08:16:19,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851570307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:19,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:19,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:19,813 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:19,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1995151828] [2022-04-28 08:16:19,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1995151828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:19,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:19,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:19,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546170213] [2022-04-28 08:16:19,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:19,814 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-28 08:16:19,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:19,814 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-28 08:16:19,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:19,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:19,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:19,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:19,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:19,828 INFO L87 Difference]: Start difference. First operand 183 states and 331 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-28 08:16:20,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:20,010 INFO L93 Difference]: Finished difference Result 347 states and 635 transitions. [2022-04-28 08:16:20,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:20,011 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-28 08:16:20,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:20,011 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-28 08:16:20,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-28 08:16:20,012 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-28 08:16:20,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-28 08:16:20,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 171 transitions. [2022-04-28 08:16:20,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:20,125 INFO L225 Difference]: With dead ends: 347 [2022-04-28 08:16:20,126 INFO L226 Difference]: Without dead ends: 345 [2022-04-28 08:16:20,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:20,126 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 222 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:20,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 100 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:20,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-04-28 08:16:20,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 247. [2022-04-28 08:16:20,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:20,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:20,140 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:20,141 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:20,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:20,147 INFO L93 Difference]: Finished difference Result 345 states and 630 transitions. [2022-04-28 08:16:20,147 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 630 transitions. [2022-04-28 08:16:20,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:20,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:20,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 345 states. [2022-04-28 08:16:20,149 INFO L87 Difference]: Start difference. First operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 345 states. [2022-04-28 08:16:20,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:20,154 INFO L93 Difference]: Finished difference Result 345 states and 630 transitions. [2022-04-28 08:16:20,154 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 630 transitions. [2022-04-28 08:16:20,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:20,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:20,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:20,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:20,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:20,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 445 transitions. [2022-04-28 08:16:20,160 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 445 transitions. Word has length 27 [2022-04-28 08:16:20,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:20,160 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 445 transitions. [2022-04-28 08:16:20,160 INFO L496 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-28 08:16:20,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 247 states and 445 transitions. [2022-04-28 08:16:20,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:20,509 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 445 transitions. [2022-04-28 08:16:20,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 08:16:20,510 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:20,510 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:20,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 08:16:20,510 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:20,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:20,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1188365008, now seen corresponding path program 1 times [2022-04-28 08:16:20,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:20,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [88415240] [2022-04-28 08:16:20,511 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:20,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1188365008, now seen corresponding path program 2 times [2022-04-28 08:16:20,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:20,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499465677] [2022-04-28 08:16:20,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:20,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:20,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:20,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {6556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {6550#true} is VALID [2022-04-28 08:16:20,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {6550#true} assume true; {6550#true} is VALID [2022-04-28 08:16:20,545 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6550#true} {6550#true} #268#return; {6550#true} is VALID [2022-04-28 08:16:20,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {6550#true} call ULTIMATE.init(); {6556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:20,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {6556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {6550#true} is VALID [2022-04-28 08:16:20,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {6550#true} assume true; {6550#true} is VALID [2022-04-28 08:16:20,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6550#true} {6550#true} #268#return; {6550#true} is VALID [2022-04-28 08:16:20,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {6550#true} call #t~ret19 := main(); {6550#true} is VALID [2022-04-28 08:16:20,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {6550#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;havoc ~cond~0; {6550#true} is VALID [2022-04-28 08:16:20,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {6550#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {6550#true} is VALID [2022-04-28 08:16:20,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {6550#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; {6550#true} is VALID [2022-04-28 08:16:20,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {6550#true} assume !(0 != ~p1~0); {6550#true} is VALID [2022-04-28 08:16:20,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {6550#true} assume !(0 != ~p2~0); {6550#true} is VALID [2022-04-28 08:16:20,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {6550#true} assume !(0 != ~p3~0); {6555#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:20,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:20,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:20,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:20,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:20,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:20,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:20,549 INFO L290 TraceCheckUtils]: 17: Hoare triple {6555#(= main_~p3~0 0)} assume !(0 != ~p10~0); {6555#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:20,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:20,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:20,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:20,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:20,551 INFO L290 TraceCheckUtils]: 22: Hoare triple {6555#(= main_~p3~0 0)} assume !(0 != ~p1~0); {6555#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:20,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {6555#(= main_~p3~0 0)} assume !(0 != ~p2~0); {6555#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:20,551 INFO L290 TraceCheckUtils]: 24: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p3~0; {6551#false} is VALID [2022-04-28 08:16:20,552 INFO L290 TraceCheckUtils]: 25: Hoare triple {6551#false} assume 1 != ~lk3~0; {6551#false} is VALID [2022-04-28 08:16:20,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {6551#false} assume !false; {6551#false} is VALID [2022-04-28 08:16:20,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:20,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:20,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499465677] [2022-04-28 08:16:20,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499465677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:20,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:20,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:20,553 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:20,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [88415240] [2022-04-28 08:16:20,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [88415240] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:20,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:20,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:20,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361125378] [2022-04-28 08:16:20,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:20,553 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-28 08:16:20,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:20,554 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-28 08:16:20,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:20,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:20,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:20,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:20,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:20,568 INFO L87 Difference]: Start difference. First operand 247 states and 445 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-28 08:16:20,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:20,766 INFO L93 Difference]: Finished difference Result 591 states and 1075 transitions. [2022-04-28 08:16:20,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:20,766 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-28 08:16:20,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:20,766 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-28 08:16:20,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2022-04-28 08:16:20,768 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-28 08:16:20,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2022-04-28 08:16:20,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 258 transitions. [2022-04-28 08:16:20,906 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-28 08:16:20,917 INFO L225 Difference]: With dead ends: 591 [2022-04-28 08:16:20,918 INFO L226 Difference]: Without dead ends: 353 [2022-04-28 08:16:20,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:20,920 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 196 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 131 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-28 08:16:20,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 131 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:20,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-04-28 08:16:20,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2022-04-28 08:16:20,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:20,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 353 states. Second operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:20,937 INFO L74 IsIncluded]: Start isIncluded. First operand 353 states. Second operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:20,938 INFO L87 Difference]: Start difference. First operand 353 states. Second operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:20,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:20,944 INFO L93 Difference]: Finished difference Result 353 states and 632 transitions. [2022-04-28 08:16:20,944 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 632 transitions. [2022-04-28 08:16:20,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:20,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:20,945 INFO L74 IsIncluded]: Start isIncluded. First operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 353 states. [2022-04-28 08:16:20,946 INFO L87 Difference]: Start difference. First operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 353 states. [2022-04-28 08:16:20,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:20,952 INFO L93 Difference]: Finished difference Result 353 states and 632 transitions. [2022-04-28 08:16:20,952 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 632 transitions. [2022-04-28 08:16:20,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:20,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:20,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:20,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:20,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:20,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 631 transitions. [2022-04-28 08:16:20,959 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 631 transitions. Word has length 27 [2022-04-28 08:16:20,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:20,959 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 631 transitions. [2022-04-28 08:16:20,960 INFO L496 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-28 08:16:20,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 351 states and 631 transitions. [2022-04-28 08:16:21,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 631 edges. 631 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:21,475 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 631 transitions. [2022-04-28 08:16:21,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 08:16:21,475 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:21,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:21,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 08:16:21,476 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:21,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:21,476 INFO L85 PathProgramCache]: Analyzing trace with hash 178967059, now seen corresponding path program 1 times [2022-04-28 08:16:21,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:21,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [66092987] [2022-04-28 08:16:21,476 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:21,476 INFO L85 PathProgramCache]: Analyzing trace with hash 178967059, now seen corresponding path program 2 times [2022-04-28 08:16:21,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:21,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507416806] [2022-04-28 08:16:21,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:21,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:21,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:21,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {9158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {9152#true} is VALID [2022-04-28 08:16:21,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {9152#true} assume true; {9152#true} is VALID [2022-04-28 08:16:21,536 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9152#true} {9152#true} #268#return; {9152#true} is VALID [2022-04-28 08:16:21,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {9152#true} call ULTIMATE.init(); {9158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:21,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {9158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {9152#true} is VALID [2022-04-28 08:16:21,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {9152#true} assume true; {9152#true} is VALID [2022-04-28 08:16:21,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9152#true} {9152#true} #268#return; {9152#true} is VALID [2022-04-28 08:16:21,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {9152#true} call #t~ret19 := main(); {9152#true} is VALID [2022-04-28 08:16:21,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {9152#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;havoc ~cond~0; {9152#true} is VALID [2022-04-28 08:16:21,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {9152#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {9152#true} is VALID [2022-04-28 08:16:21,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {9152#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; {9152#true} is VALID [2022-04-28 08:16:21,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {9152#true} assume !(0 != ~p1~0); {9152#true} is VALID [2022-04-28 08:16:21,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {9152#true} assume !(0 != ~p2~0); {9152#true} is VALID [2022-04-28 08:16:21,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {9152#true} assume 0 != ~p3~0;~lk3~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:21,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:21,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:21,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:21,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:21,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:21,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:21,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {9157#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {9157#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:21,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:21,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:21,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:21,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:21,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {9157#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {9157#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:21,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {9157#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {9157#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:21,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {9157#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {9153#false} is VALID [2022-04-28 08:16:21,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {9153#false} assume 0 != ~p4~0; {9153#false} is VALID [2022-04-28 08:16:21,549 INFO L290 TraceCheckUtils]: 26: Hoare triple {9153#false} assume 1 != ~lk4~0; {9153#false} is VALID [2022-04-28 08:16:21,549 INFO L290 TraceCheckUtils]: 27: Hoare triple {9153#false} assume !false; {9153#false} is VALID [2022-04-28 08:16:21,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:21,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:21,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507416806] [2022-04-28 08:16:21,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507416806] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:21,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:21,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:21,550 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:21,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [66092987] [2022-04-28 08:16:21,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [66092987] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:21,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:21,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:21,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422611806] [2022-04-28 08:16:21,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:21,551 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-28 08:16:21,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:21,551 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-28 08:16:21,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:21,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:21,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:21,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:21,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:21,567 INFO L87 Difference]: Start difference. First operand 351 states and 631 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-28 08:16:21,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:21,778 INFO L93 Difference]: Finished difference Result 529 states and 949 transitions. [2022-04-28 08:16:21,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:21,778 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-28 08:16:21,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:21,778 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-28 08:16:21,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2022-04-28 08:16:21,780 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-28 08:16:21,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2022-04-28 08:16:21,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 253 transitions. [2022-04-28 08:16:21,941 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-28 08:16:21,947 INFO L225 Difference]: With dead ends: 529 [2022-04-28 08:16:21,947 INFO L226 Difference]: Without dead ends: 359 [2022-04-28 08:16:21,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:21,948 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 147 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:21,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 147 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:16:21,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-04-28 08:16:21,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2022-04-28 08:16:21,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:21,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 359 states. Second operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:21,965 INFO L74 IsIncluded]: Start isIncluded. First operand 359 states. Second operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:21,966 INFO L87 Difference]: Start difference. First operand 359 states. Second operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:21,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:21,972 INFO L93 Difference]: Finished difference Result 359 states and 636 transitions. [2022-04-28 08:16:21,972 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 636 transitions. [2022-04-28 08:16:21,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:21,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:21,974 INFO L74 IsIncluded]: Start isIncluded. First operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 359 states. [2022-04-28 08:16:21,974 INFO L87 Difference]: Start difference. First operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 359 states. [2022-04-28 08:16:21,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:21,994 INFO L93 Difference]: Finished difference Result 359 states and 636 transitions. [2022-04-28 08:16:21,994 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 636 transitions. [2022-04-28 08:16:21,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:21,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:21,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:21,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:21,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:22,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 635 transitions. [2022-04-28 08:16:22,002 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 635 transitions. Word has length 28 [2022-04-28 08:16:22,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:22,003 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 635 transitions. [2022-04-28 08:16:22,003 INFO L496 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-28 08:16:22,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 357 states and 635 transitions. [2022-04-28 08:16:22,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 635 edges. 635 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:22,518 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 635 transitions. [2022-04-28 08:16:22,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 08:16:22,518 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:22,518 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:22,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 08:16:22,518 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:22,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:22,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1815177647, now seen corresponding path program 1 times [2022-04-28 08:16:22,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:22,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1868427677] [2022-04-28 08:16:22,519 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:22,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1815177647, now seen corresponding path program 2 times [2022-04-28 08:16:22,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:22,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77842381] [2022-04-28 08:16:22,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:22,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:22,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:22,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {11660#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {11654#true} is VALID [2022-04-28 08:16:22,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {11654#true} assume true; {11654#true} is VALID [2022-04-28 08:16:22,562 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11654#true} {11654#true} #268#return; {11654#true} is VALID [2022-04-28 08:16:22,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {11654#true} call ULTIMATE.init(); {11660#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:22,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {11660#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {11654#true} is VALID [2022-04-28 08:16:22,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {11654#true} assume true; {11654#true} is VALID [2022-04-28 08:16:22,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11654#true} {11654#true} #268#return; {11654#true} is VALID [2022-04-28 08:16:22,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {11654#true} call #t~ret19 := main(); {11654#true} is VALID [2022-04-28 08:16:22,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {11654#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;havoc ~cond~0; {11654#true} is VALID [2022-04-28 08:16:22,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {11654#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {11654#true} is VALID [2022-04-28 08:16:22,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {11654#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; {11654#true} is VALID [2022-04-28 08:16:22,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {11654#true} assume !(0 != ~p1~0); {11654#true} is VALID [2022-04-28 08:16:22,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {11654#true} assume !(0 != ~p2~0); {11654#true} is VALID [2022-04-28 08:16:22,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {11654#true} assume !(0 != ~p3~0); {11654#true} is VALID [2022-04-28 08:16:22,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {11654#true} assume 0 != ~p4~0;~lk4~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:22,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:22,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:22,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:22,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:22,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:22,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {11659#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:22,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:22,580 INFO L290 TraceCheckUtils]: 19: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:22,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:22,580 INFO L290 TraceCheckUtils]: 21: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:22,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {11659#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:22,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {11659#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:22,581 INFO L290 TraceCheckUtils]: 24: Hoare triple {11659#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:22,581 INFO L290 TraceCheckUtils]: 25: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p4~0; {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:22,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {11659#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {11655#false} is VALID [2022-04-28 08:16:22,582 INFO L290 TraceCheckUtils]: 27: Hoare triple {11655#false} assume !false; {11655#false} is VALID [2022-04-28 08:16:22,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:22,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:22,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77842381] [2022-04-28 08:16:22,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77842381] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:22,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:22,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:22,583 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:22,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1868427677] [2022-04-28 08:16:22,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1868427677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:22,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:22,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:22,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305874804] [2022-04-28 08:16:22,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:22,583 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-28 08:16:22,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:22,583 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-28 08:16:22,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:22,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:22,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:22,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:22,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:22,597 INFO L87 Difference]: Start difference. First operand 357 states and 635 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-28 08:16:22,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:22,813 INFO L93 Difference]: Finished difference Result 669 states and 1205 transitions. [2022-04-28 08:16:22,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:22,814 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-28 08:16:22,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:22,814 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-28 08:16:22,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2022-04-28 08:16:22,815 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-28 08:16:22,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2022-04-28 08:16:22,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 167 transitions. [2022-04-28 08:16:22,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:22,932 INFO L225 Difference]: With dead ends: 669 [2022-04-28 08:16:22,933 INFO L226 Difference]: Without dead ends: 667 [2022-04-28 08:16:22,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:22,934 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 215 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 99 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-28 08:16:22,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 99 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:22,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-04-28 08:16:22,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 489. [2022-04-28 08:16:22,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:22,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 667 states. Second operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:22,959 INFO L74 IsIncluded]: Start isIncluded. First operand 667 states. Second operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:22,960 INFO L87 Difference]: Start difference. First operand 667 states. Second operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:22,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:22,975 INFO L93 Difference]: Finished difference Result 667 states and 1196 transitions. [2022-04-28 08:16:22,975 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1196 transitions. [2022-04-28 08:16:22,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:22,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:22,977 INFO L74 IsIncluded]: Start isIncluded. First operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 667 states. [2022-04-28 08:16:22,977 INFO L87 Difference]: Start difference. First operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 667 states. [2022-04-28 08:16:22,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:22,992 INFO L93 Difference]: Finished difference Result 667 states and 1196 transitions. [2022-04-28 08:16:22,993 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1196 transitions. [2022-04-28 08:16:22,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:22,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:22,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:22,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:22,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:23,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 859 transitions. [2022-04-28 08:16:23,006 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 859 transitions. Word has length 28 [2022-04-28 08:16:23,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:23,006 INFO L495 AbstractCegarLoop]: Abstraction has 489 states and 859 transitions. [2022-04-28 08:16:23,006 INFO L496 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-28 08:16:23,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 489 states and 859 transitions. [2022-04-28 08:16:23,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 859 edges. 859 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:23,723 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 859 transitions. [2022-04-28 08:16:23,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 08:16:23,724 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:23,724 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:23,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 08:16:23,724 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:23,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:23,724 INFO L85 PathProgramCache]: Analyzing trace with hash 891441747, now seen corresponding path program 1 times [2022-04-28 08:16:23,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:23,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2062473095] [2022-04-28 08:16:23,725 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:23,725 INFO L85 PathProgramCache]: Analyzing trace with hash 891441747, now seen corresponding path program 2 times [2022-04-28 08:16:23,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:23,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580370664] [2022-04-28 08:16:23,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:23,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:23,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:23,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {15322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {15316#true} is VALID [2022-04-28 08:16:23,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {15316#true} assume true; {15316#true} is VALID [2022-04-28 08:16:23,754 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15316#true} {15316#true} #268#return; {15316#true} is VALID [2022-04-28 08:16:23,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {15316#true} call ULTIMATE.init(); {15322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:23,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {15322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {15316#true} is VALID [2022-04-28 08:16:23,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {15316#true} assume true; {15316#true} is VALID [2022-04-28 08:16:23,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15316#true} {15316#true} #268#return; {15316#true} is VALID [2022-04-28 08:16:23,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {15316#true} call #t~ret19 := main(); {15316#true} is VALID [2022-04-28 08:16:23,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {15316#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;havoc ~cond~0; {15316#true} is VALID [2022-04-28 08:16:23,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {15316#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {15316#true} is VALID [2022-04-28 08:16:23,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {15316#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; {15316#true} is VALID [2022-04-28 08:16:23,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {15316#true} assume !(0 != ~p1~0); {15316#true} is VALID [2022-04-28 08:16:23,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {15316#true} assume !(0 != ~p2~0); {15316#true} is VALID [2022-04-28 08:16:23,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {15316#true} assume !(0 != ~p3~0); {15316#true} is VALID [2022-04-28 08:16:23,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {15316#true} assume !(0 != ~p4~0); {15321#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:23,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:23,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:23,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:23,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:23,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:23,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {15321#(= main_~p4~0 0)} assume !(0 != ~p10~0); {15321#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:23,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:23,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:23,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:23,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:23,758 INFO L290 TraceCheckUtils]: 22: Hoare triple {15321#(= main_~p4~0 0)} assume !(0 != ~p1~0); {15321#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:23,758 INFO L290 TraceCheckUtils]: 23: Hoare triple {15321#(= main_~p4~0 0)} assume !(0 != ~p2~0); {15321#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:23,758 INFO L290 TraceCheckUtils]: 24: Hoare triple {15321#(= main_~p4~0 0)} assume !(0 != ~p3~0); {15321#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:23,758 INFO L290 TraceCheckUtils]: 25: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p4~0; {15317#false} is VALID [2022-04-28 08:16:23,759 INFO L290 TraceCheckUtils]: 26: Hoare triple {15317#false} assume 1 != ~lk4~0; {15317#false} is VALID [2022-04-28 08:16:23,759 INFO L290 TraceCheckUtils]: 27: Hoare triple {15317#false} assume !false; {15317#false} is VALID [2022-04-28 08:16:23,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:23,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:23,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580370664] [2022-04-28 08:16:23,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580370664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:23,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:23,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:23,759 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:23,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2062473095] [2022-04-28 08:16:23,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2062473095] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:23,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:23,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:23,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574053203] [2022-04-28 08:16:23,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:23,760 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-28 08:16:23,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:23,760 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-28 08:16:23,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:23,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:23,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:23,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:23,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:23,774 INFO L87 Difference]: Start difference. First operand 489 states and 859 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-28 08:16:24,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:24,028 INFO L93 Difference]: Finished difference Result 1165 states and 2061 transitions. [2022-04-28 08:16:24,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:24,029 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-28 08:16:24,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:24,029 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-28 08:16:24,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 255 transitions. [2022-04-28 08:16:24,031 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-28 08:16:24,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 255 transitions. [2022-04-28 08:16:24,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 255 transitions. [2022-04-28 08:16:24,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:24,202 INFO L225 Difference]: With dead ends: 1165 [2022-04-28 08:16:24,203 INFO L226 Difference]: Without dead ends: 691 [2022-04-28 08:16:24,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:24,204 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 190 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:24,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 133 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:24,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-04-28 08:16:24,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 689. [2022-04-28 08:16:24,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:24,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 691 states. Second operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:24,242 INFO L74 IsIncluded]: Start isIncluded. First operand 691 states. Second operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:24,244 INFO L87 Difference]: Start difference. First operand 691 states. Second operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:24,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:24,260 INFO L93 Difference]: Finished difference Result 691 states and 1208 transitions. [2022-04-28 08:16:24,260 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1208 transitions. [2022-04-28 08:16:24,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:24,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:24,262 INFO L74 IsIncluded]: Start isIncluded. First operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 691 states. [2022-04-28 08:16:24,263 INFO L87 Difference]: Start difference. First operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 691 states. [2022-04-28 08:16:24,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:24,278 INFO L93 Difference]: Finished difference Result 691 states and 1208 transitions. [2022-04-28 08:16:24,279 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1208 transitions. [2022-04-28 08:16:24,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:24,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:24,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:24,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:24,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:24,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1207 transitions. [2022-04-28 08:16:24,302 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1207 transitions. Word has length 28 [2022-04-28 08:16:24,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:24,302 INFO L495 AbstractCegarLoop]: Abstraction has 689 states and 1207 transitions. [2022-04-28 08:16:24,302 INFO L496 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-28 08:16:24,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 689 states and 1207 transitions. [2022-04-28 08:16:25,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1207 edges. 1207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:25,300 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1207 transitions. [2022-04-28 08:16:25,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 08:16:25,301 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:25,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:25,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 08:16:25,301 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:25,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:25,301 INFO L85 PathProgramCache]: Analyzing trace with hash -435719099, now seen corresponding path program 1 times [2022-04-28 08:16:25,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:25,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1764831250] [2022-04-28 08:16:25,302 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:25,302 INFO L85 PathProgramCache]: Analyzing trace with hash -435719099, now seen corresponding path program 2 times [2022-04-28 08:16:25,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:25,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042588505] [2022-04-28 08:16:25,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:25,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:25,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:25,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {20424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {20418#true} is VALID [2022-04-28 08:16:25,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {20418#true} assume true; {20418#true} is VALID [2022-04-28 08:16:25,352 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20418#true} {20418#true} #268#return; {20418#true} is VALID [2022-04-28 08:16:25,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {20418#true} call ULTIMATE.init(); {20424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:25,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {20424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {20418#true} is VALID [2022-04-28 08:16:25,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {20418#true} assume true; {20418#true} is VALID [2022-04-28 08:16:25,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20418#true} {20418#true} #268#return; {20418#true} is VALID [2022-04-28 08:16:25,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {20418#true} call #t~ret19 := main(); {20418#true} is VALID [2022-04-28 08:16:25,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {20418#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;havoc ~cond~0; {20418#true} is VALID [2022-04-28 08:16:25,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {20418#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {20418#true} is VALID [2022-04-28 08:16:25,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {20418#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; {20418#true} is VALID [2022-04-28 08:16:25,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {20418#true} assume !(0 != ~p1~0); {20418#true} is VALID [2022-04-28 08:16:25,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {20418#true} assume !(0 != ~p2~0); {20418#true} is VALID [2022-04-28 08:16:25,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {20418#true} assume !(0 != ~p3~0); {20418#true} is VALID [2022-04-28 08:16:25,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {20418#true} assume 0 != ~p4~0;~lk4~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:25,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:25,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:25,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:25,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:25,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:25,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {20423#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {20423#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:25,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:25,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:25,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:25,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:25,358 INFO L290 TraceCheckUtils]: 22: Hoare triple {20423#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {20423#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:25,358 INFO L290 TraceCheckUtils]: 23: Hoare triple {20423#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {20423#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:25,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {20423#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {20423#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:25,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {20423#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {20419#false} is VALID [2022-04-28 08:16:25,359 INFO L290 TraceCheckUtils]: 26: Hoare triple {20419#false} assume 0 != ~p5~0; {20419#false} is VALID [2022-04-28 08:16:25,359 INFO L290 TraceCheckUtils]: 27: Hoare triple {20419#false} assume 1 != ~lk5~0; {20419#false} is VALID [2022-04-28 08:16:25,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {20419#false} assume !false; {20419#false} is VALID [2022-04-28 08:16:25,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:25,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:25,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042588505] [2022-04-28 08:16:25,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042588505] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:25,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:25,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:25,360 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:25,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1764831250] [2022-04-28 08:16:25,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1764831250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:25,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:25,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:25,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581502565] [2022-04-28 08:16:25,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:25,361 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-28 08:16:25,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:25,361 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-28 08:16:25,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:25,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:25,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:25,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:25,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:25,376 INFO L87 Difference]: Start difference. First operand 689 states and 1207 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-28 08:16:25,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:25,616 INFO L93 Difference]: Finished difference Result 1033 states and 1805 transitions. [2022-04-28 08:16:25,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:25,616 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-28 08:16:25,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:25,616 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-28 08:16:25,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2022-04-28 08:16:25,618 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-28 08:16:25,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2022-04-28 08:16:25,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 250 transitions. [2022-04-28 08:16:25,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:25,775 INFO L225 Difference]: With dead ends: 1033 [2022-04-28 08:16:25,776 INFO L226 Difference]: Without dead ends: 699 [2022-04-28 08:16:25,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:25,777 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 180 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:25,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 144 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:25,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-04-28 08:16:25,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2022-04-28 08:16:25,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:25,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:25,815 INFO L74 IsIncluded]: Start isIncluded. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:25,816 INFO L87 Difference]: Start difference. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:25,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:25,833 INFO L93 Difference]: Finished difference Result 699 states and 1208 transitions. [2022-04-28 08:16:25,834 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1208 transitions. [2022-04-28 08:16:25,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:25,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:25,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 699 states. [2022-04-28 08:16:25,836 INFO L87 Difference]: Start difference. First operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 699 states. [2022-04-28 08:16:25,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:25,851 INFO L93 Difference]: Finished difference Result 699 states and 1208 transitions. [2022-04-28 08:16:25,851 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1208 transitions. [2022-04-28 08:16:25,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:25,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:25,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:25,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:25,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:25,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1207 transitions. [2022-04-28 08:16:25,872 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1207 transitions. Word has length 29 [2022-04-28 08:16:25,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:25,872 INFO L495 AbstractCegarLoop]: Abstraction has 697 states and 1207 transitions. [2022-04-28 08:16:25,872 INFO L496 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-28 08:16:25,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 697 states and 1207 transitions. [2022-04-28 08:16:26,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1207 edges. 1207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:26,871 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1207 transitions. [2022-04-28 08:16:26,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 08:16:26,872 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:26,872 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:26,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 08:16:26,872 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:26,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:26,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1865103491, now seen corresponding path program 1 times [2022-04-28 08:16:26,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:26,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1471008416] [2022-04-28 08:16:26,873 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:26,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1865103491, now seen corresponding path program 2 times [2022-04-28 08:16:26,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:26,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649368192] [2022-04-28 08:16:26,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:26,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:26,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:26,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {25294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {25288#true} is VALID [2022-04-28 08:16:26,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {25288#true} assume true; {25288#true} is VALID [2022-04-28 08:16:26,923 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25288#true} {25288#true} #268#return; {25288#true} is VALID [2022-04-28 08:16:26,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {25288#true} call ULTIMATE.init(); {25294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:26,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {25294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {25288#true} is VALID [2022-04-28 08:16:26,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {25288#true} assume true; {25288#true} is VALID [2022-04-28 08:16:26,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25288#true} {25288#true} #268#return; {25288#true} is VALID [2022-04-28 08:16:26,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {25288#true} call #t~ret19 := main(); {25288#true} is VALID [2022-04-28 08:16:26,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {25288#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;havoc ~cond~0; {25288#true} is VALID [2022-04-28 08:16:26,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {25288#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {25288#true} is VALID [2022-04-28 08:16:26,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {25288#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; {25288#true} is VALID [2022-04-28 08:16:26,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {25288#true} assume !(0 != ~p1~0); {25288#true} is VALID [2022-04-28 08:16:26,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {25288#true} assume !(0 != ~p2~0); {25288#true} is VALID [2022-04-28 08:16:26,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {25288#true} assume !(0 != ~p3~0); {25288#true} is VALID [2022-04-28 08:16:26,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {25288#true} assume !(0 != ~p4~0); {25288#true} is VALID [2022-04-28 08:16:26,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {25288#true} assume 0 != ~p5~0;~lk5~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:26,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:26,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:26,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:26,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:26,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {25293#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:26,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:26,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:26,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:26,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:26,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {25293#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:26,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {25293#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:26,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {25293#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:26,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {25293#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:26,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p5~0; {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:26,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {25293#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {25289#false} is VALID [2022-04-28 08:16:26,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {25289#false} assume !false; {25289#false} is VALID [2022-04-28 08:16:26,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:26,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:26,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649368192] [2022-04-28 08:16:26,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649368192] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:26,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:26,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:26,935 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:26,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1471008416] [2022-04-28 08:16:26,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1471008416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:26,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:26,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:26,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380949534] [2022-04-28 08:16:26,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:26,936 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-28 08:16:26,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:26,936 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-28 08:16:26,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:26,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:26,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:26,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:26,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:26,950 INFO L87 Difference]: Start difference. First operand 697 states and 1207 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-28 08:16:27,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:27,241 INFO L93 Difference]: Finished difference Result 1293 states and 2273 transitions. [2022-04-28 08:16:27,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:27,241 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-28 08:16:27,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:27,241 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-28 08:16:27,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-28 08:16:27,242 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-28 08:16:27,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-28 08:16:27,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-28 08:16:27,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:27,397 INFO L225 Difference]: With dead ends: 1293 [2022-04-28 08:16:27,398 INFO L226 Difference]: Without dead ends: 1291 [2022-04-28 08:16:27,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:27,399 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 208 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 98 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-28 08:16:27,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 98 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:27,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2022-04-28 08:16:27,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 969. [2022-04-28 08:16:27,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:27,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1291 states. Second operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:27,454 INFO L74 IsIncluded]: Start isIncluded. First operand 1291 states. Second operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:27,483 INFO L87 Difference]: Start difference. First operand 1291 states. Second operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:27,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:27,527 INFO L93 Difference]: Finished difference Result 1291 states and 2256 transitions. [2022-04-28 08:16:27,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2256 transitions. [2022-04-28 08:16:27,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:27,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:27,530 INFO L74 IsIncluded]: Start isIncluded. First operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1291 states. [2022-04-28 08:16:27,530 INFO L87 Difference]: Start difference. First operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1291 states. [2022-04-28 08:16:27,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:27,573 INFO L93 Difference]: Finished difference Result 1291 states and 2256 transitions. [2022-04-28 08:16:27,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2256 transitions. [2022-04-28 08:16:27,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:27,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:27,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:27,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:27,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:27,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1647 transitions. [2022-04-28 08:16:27,612 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1647 transitions. Word has length 29 [2022-04-28 08:16:27,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:27,612 INFO L495 AbstractCegarLoop]: Abstraction has 969 states and 1647 transitions. [2022-04-28 08:16:27,612 INFO L496 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-28 08:16:27,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 969 states and 1647 transitions. [2022-04-28 08:16:28,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1647 edges. 1647 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:28,956 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1647 transitions. [2022-04-28 08:16:28,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 08:16:28,957 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:28,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:28,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 08:16:28,958 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:28,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:28,958 INFO L85 PathProgramCache]: Analyzing trace with hash 276755589, now seen corresponding path program 1 times [2022-04-28 08:16:28,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:28,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2066657601] [2022-04-28 08:16:28,960 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:28,960 INFO L85 PathProgramCache]: Analyzing trace with hash 276755589, now seen corresponding path program 2 times [2022-04-28 08:16:28,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:28,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102689220] [2022-04-28 08:16:28,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:28,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:28,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:29,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {32412#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {32406#true} is VALID [2022-04-28 08:16:29,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {32406#true} assume true; {32406#true} is VALID [2022-04-28 08:16:29,004 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32406#true} {32406#true} #268#return; {32406#true} is VALID [2022-04-28 08:16:29,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {32406#true} call ULTIMATE.init(); {32412#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:29,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {32412#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {32406#true} is VALID [2022-04-28 08:16:29,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {32406#true} assume true; {32406#true} is VALID [2022-04-28 08:16:29,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32406#true} {32406#true} #268#return; {32406#true} is VALID [2022-04-28 08:16:29,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {32406#true} call #t~ret19 := main(); {32406#true} is VALID [2022-04-28 08:16:29,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {32406#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;havoc ~cond~0; {32406#true} is VALID [2022-04-28 08:16:29,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {32406#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {32406#true} is VALID [2022-04-28 08:16:29,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {32406#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; {32406#true} is VALID [2022-04-28 08:16:29,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {32406#true} assume !(0 != ~p1~0); {32406#true} is VALID [2022-04-28 08:16:29,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {32406#true} assume !(0 != ~p2~0); {32406#true} is VALID [2022-04-28 08:16:29,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {32406#true} assume !(0 != ~p3~0); {32406#true} is VALID [2022-04-28 08:16:29,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {32406#true} assume !(0 != ~p4~0); {32406#true} is VALID [2022-04-28 08:16:29,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {32406#true} assume !(0 != ~p5~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:29,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:29,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:29,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:29,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:29,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {32411#(= main_~p5~0 0)} assume !(0 != ~p10~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:29,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:29,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:29,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:29,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:29,013 INFO L290 TraceCheckUtils]: 22: Hoare triple {32411#(= main_~p5~0 0)} assume !(0 != ~p1~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:29,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {32411#(= main_~p5~0 0)} assume !(0 != ~p2~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:29,013 INFO L290 TraceCheckUtils]: 24: Hoare triple {32411#(= main_~p5~0 0)} assume !(0 != ~p3~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:29,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {32411#(= main_~p5~0 0)} assume !(0 != ~p4~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:29,014 INFO L290 TraceCheckUtils]: 26: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p5~0; {32407#false} is VALID [2022-04-28 08:16:29,014 INFO L290 TraceCheckUtils]: 27: Hoare triple {32407#false} assume 1 != ~lk5~0; {32407#false} is VALID [2022-04-28 08:16:29,014 INFO L290 TraceCheckUtils]: 28: Hoare triple {32407#false} assume !false; {32407#false} is VALID [2022-04-28 08:16:29,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:29,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:29,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102689220] [2022-04-28 08:16:29,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102689220] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:29,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:29,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:29,015 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:29,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2066657601] [2022-04-28 08:16:29,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2066657601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:29,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:29,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:29,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807566138] [2022-04-28 08:16:29,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:29,015 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-28 08:16:29,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:29,016 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-28 08:16:29,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:29,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:29,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:29,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:29,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:29,029 INFO L87 Difference]: Start difference. First operand 969 states and 1647 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-28 08:16:29,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:29,473 INFO L93 Difference]: Finished difference Result 2301 states and 3937 transitions. [2022-04-28 08:16:29,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:29,473 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-28 08:16:29,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:29,473 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-28 08:16:29,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 252 transitions. [2022-04-28 08:16:29,474 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-28 08:16:29,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 252 transitions. [2022-04-28 08:16:29,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 252 transitions. [2022-04-28 08:16:29,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:29,676 INFO L225 Difference]: With dead ends: 2301 [2022-04-28 08:16:29,676 INFO L226 Difference]: Without dead ends: 1355 [2022-04-28 08:16:29,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:29,677 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 184 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:29,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 135 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:29,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-04-28 08:16:29,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1353. [2022-04-28 08:16:29,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:29,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:29,763 INFO L74 IsIncluded]: Start isIncluded. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:29,764 INFO L87 Difference]: Start difference. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:29,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:29,810 INFO L93 Difference]: Finished difference Result 1355 states and 2296 transitions. [2022-04-28 08:16:29,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 2296 transitions. [2022-04-28 08:16:29,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:29,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:29,814 INFO L74 IsIncluded]: Start isIncluded. First operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1355 states. [2022-04-28 08:16:29,815 INFO L87 Difference]: Start difference. First operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1355 states. [2022-04-28 08:16:29,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:29,862 INFO L93 Difference]: Finished difference Result 1355 states and 2296 transitions. [2022-04-28 08:16:29,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 2296 transitions. [2022-04-28 08:16:29,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:29,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:29,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:29,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:29,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:29,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 2295 transitions. [2022-04-28 08:16:29,934 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 2295 transitions. Word has length 29 [2022-04-28 08:16:29,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:29,934 INFO L495 AbstractCegarLoop]: Abstraction has 1353 states and 2295 transitions. [2022-04-28 08:16:29,937 INFO L496 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-28 08:16:29,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1353 states and 2295 transitions. [2022-04-28 08:16:31,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2295 edges. 2295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:31,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 2295 transitions. [2022-04-28 08:16:31,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 08:16:31,954 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:31,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:31,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 08:16:31,954 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:31,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:31,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1983846824, now seen corresponding path program 1 times [2022-04-28 08:16:31,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:31,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1083334458] [2022-04-28 08:16:31,955 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:31,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1983846824, now seen corresponding path program 2 times [2022-04-28 08:16:31,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:31,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822893129] [2022-04-28 08:16:31,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:31,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:31,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:31,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {42442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {42436#true} is VALID [2022-04-28 08:16:31,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {42436#true} assume true; {42436#true} is VALID [2022-04-28 08:16:31,982 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42436#true} {42436#true} #268#return; {42436#true} is VALID [2022-04-28 08:16:31,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {42436#true} call ULTIMATE.init(); {42442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:31,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {42442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {42436#true} is VALID [2022-04-28 08:16:31,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {42436#true} assume true; {42436#true} is VALID [2022-04-28 08:16:31,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42436#true} {42436#true} #268#return; {42436#true} is VALID [2022-04-28 08:16:31,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {42436#true} call #t~ret19 := main(); {42436#true} is VALID [2022-04-28 08:16:31,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {42436#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;havoc ~cond~0; {42436#true} is VALID [2022-04-28 08:16:31,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {42436#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {42436#true} is VALID [2022-04-28 08:16:31,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {42436#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; {42436#true} is VALID [2022-04-28 08:16:31,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {42436#true} assume !(0 != ~p1~0); {42436#true} is VALID [2022-04-28 08:16:31,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {42436#true} assume !(0 != ~p2~0); {42436#true} is VALID [2022-04-28 08:16:31,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {42436#true} assume !(0 != ~p3~0); {42436#true} is VALID [2022-04-28 08:16:31,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {42436#true} assume !(0 != ~p4~0); {42436#true} is VALID [2022-04-28 08:16:31,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {42436#true} assume 0 != ~p5~0;~lk5~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:31,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:31,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:31,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:31,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:31,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {42441#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:31,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:31,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:31,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:31,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:31,986 INFO L290 TraceCheckUtils]: 22: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {42441#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:31,986 INFO L290 TraceCheckUtils]: 23: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {42441#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:31,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {42441#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:31,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {42441#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:31,987 INFO L290 TraceCheckUtils]: 26: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {42437#false} is VALID [2022-04-28 08:16:31,987 INFO L290 TraceCheckUtils]: 27: Hoare triple {42437#false} assume 0 != ~p6~0; {42437#false} is VALID [2022-04-28 08:16:31,987 INFO L290 TraceCheckUtils]: 28: Hoare triple {42437#false} assume 1 != ~lk6~0; {42437#false} is VALID [2022-04-28 08:16:31,987 INFO L290 TraceCheckUtils]: 29: Hoare triple {42437#false} assume !false; {42437#false} is VALID [2022-04-28 08:16:31,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:31,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:31,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822893129] [2022-04-28 08:16:31,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822893129] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:31,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:31,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:31,988 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:31,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1083334458] [2022-04-28 08:16:31,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1083334458] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:31,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:31,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:31,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118679490] [2022-04-28 08:16:31,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:31,988 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-28 08:16:31,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:31,988 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-28 08:16:32,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:32,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:32,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:32,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:32,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:32,004 INFO L87 Difference]: Start difference. First operand 1353 states and 2295 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-28 08:16:32,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:32,432 INFO L93 Difference]: Finished difference Result 2029 states and 3433 transitions. [2022-04-28 08:16:32,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:32,432 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-28 08:16:32,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:32,432 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-28 08:16:32,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 247 transitions. [2022-04-28 08:16:32,433 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-28 08:16:32,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 247 transitions. [2022-04-28 08:16:32,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 247 transitions. [2022-04-28 08:16:32,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:32,638 INFO L225 Difference]: With dead ends: 2029 [2022-04-28 08:16:32,638 INFO L226 Difference]: Without dead ends: 1371 [2022-04-28 08:16:32,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:32,639 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 179 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:32,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 141 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:32,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2022-04-28 08:16:32,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1369. [2022-04-28 08:16:32,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:32,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1371 states. Second operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:32,735 INFO L74 IsIncluded]: Start isIncluded. First operand 1371 states. Second operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:32,736 INFO L87 Difference]: Start difference. First operand 1371 states. Second operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:32,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:32,787 INFO L93 Difference]: Finished difference Result 1371 states and 2296 transitions. [2022-04-28 08:16:32,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 2296 transitions. [2022-04-28 08:16:32,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:32,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:32,791 INFO L74 IsIncluded]: Start isIncluded. First operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1371 states. [2022-04-28 08:16:32,792 INFO L87 Difference]: Start difference. First operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1371 states. [2022-04-28 08:16:32,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:32,838 INFO L93 Difference]: Finished difference Result 1371 states and 2296 transitions. [2022-04-28 08:16:32,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 2296 transitions. [2022-04-28 08:16:32,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:32,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:32,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:32,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:32,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:32,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2295 transitions. [2022-04-28 08:16:32,921 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2295 transitions. Word has length 30 [2022-04-28 08:16:32,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:32,922 INFO L495 AbstractCegarLoop]: Abstraction has 1369 states and 2295 transitions. [2022-04-28 08:16:32,922 INFO L496 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-28 08:16:32,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1369 states and 2295 transitions. [2022-04-28 08:16:34,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2295 edges. 2295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:34,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2295 transitions. [2022-04-28 08:16:34,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 08:16:34,951 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:34,951 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:34,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 08:16:34,952 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:34,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:34,952 INFO L85 PathProgramCache]: Analyzing trace with hash -10297882, now seen corresponding path program 1 times [2022-04-28 08:16:34,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:34,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [92820467] [2022-04-28 08:16:34,952 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:34,952 INFO L85 PathProgramCache]: Analyzing trace with hash -10297882, now seen corresponding path program 2 times [2022-04-28 08:16:34,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:34,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409840761] [2022-04-28 08:16:34,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:34,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:34,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:34,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {51992#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {51986#true} is VALID [2022-04-28 08:16:34,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {51986#true} assume true; {51986#true} is VALID [2022-04-28 08:16:34,987 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51986#true} {51986#true} #268#return; {51986#true} is VALID [2022-04-28 08:16:34,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {51986#true} call ULTIMATE.init(); {51992#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:34,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {51992#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {51986#true} is VALID [2022-04-28 08:16:34,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {51986#true} assume true; {51986#true} is VALID [2022-04-28 08:16:34,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51986#true} {51986#true} #268#return; {51986#true} is VALID [2022-04-28 08:16:34,989 INFO L272 TraceCheckUtils]: 4: Hoare triple {51986#true} call #t~ret19 := main(); {51986#true} is VALID [2022-04-28 08:16:34,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {51986#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;havoc ~cond~0; {51986#true} is VALID [2022-04-28 08:16:34,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {51986#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {51986#true} is VALID [2022-04-28 08:16:34,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {51986#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; {51986#true} is VALID [2022-04-28 08:16:34,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {51986#true} assume !(0 != ~p1~0); {51986#true} is VALID [2022-04-28 08:16:34,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {51986#true} assume !(0 != ~p2~0); {51986#true} is VALID [2022-04-28 08:16:34,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {51986#true} assume !(0 != ~p3~0); {51986#true} is VALID [2022-04-28 08:16:34,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {51986#true} assume !(0 != ~p4~0); {51986#true} is VALID [2022-04-28 08:16:34,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {51986#true} assume !(0 != ~p5~0); {51986#true} is VALID [2022-04-28 08:16:34,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {51986#true} assume 0 != ~p6~0;~lk6~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:34,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:34,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:34,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:34,990 INFO L290 TraceCheckUtils]: 17: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:34,991 INFO L290 TraceCheckUtils]: 18: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:34,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:34,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:34,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:34,992 INFO L290 TraceCheckUtils]: 22: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:34,992 INFO L290 TraceCheckUtils]: 23: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:34,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:34,992 INFO L290 TraceCheckUtils]: 25: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:34,993 INFO L290 TraceCheckUtils]: 26: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:34,993 INFO L290 TraceCheckUtils]: 27: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p6~0; {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:34,993 INFO L290 TraceCheckUtils]: 28: Hoare triple {51991#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {51987#false} is VALID [2022-04-28 08:16:34,993 INFO L290 TraceCheckUtils]: 29: Hoare triple {51987#false} assume !false; {51987#false} is VALID [2022-04-28 08:16:34,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:34,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:34,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409840761] [2022-04-28 08:16:34,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409840761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:34,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:34,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:34,994 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:34,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [92820467] [2022-04-28 08:16:34,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [92820467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:34,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:34,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:34,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20233101] [2022-04-28 08:16:34,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:34,994 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-28 08:16:34,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:34,995 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-28 08:16:35,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:35,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:35,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:35,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:35,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:35,010 INFO L87 Difference]: Start difference. First operand 1369 states and 2295 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-28 08:16:35,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:35,569 INFO L93 Difference]: Finished difference Result 2509 states and 4281 transitions. [2022-04-28 08:16:35,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:35,569 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-28 08:16:35,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:35,569 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-28 08:16:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-28 08:16:35,570 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-28 08:16:35,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-28 08:16:35,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-04-28 08:16:35,663 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-28 08:16:35,908 INFO L225 Difference]: With dead ends: 2509 [2022-04-28 08:16:35,908 INFO L226 Difference]: Without dead ends: 2507 [2022-04-28 08:16:35,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:35,909 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 201 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 97 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:35,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 97 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:16:35,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-04-28 08:16:36,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 1929. [2022-04-28 08:16:36,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:36,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2507 states. Second operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:36,061 INFO L74 IsIncluded]: Start isIncluded. First operand 2507 states. Second operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:36,063 INFO L87 Difference]: Start difference. First operand 2507 states. Second operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:36,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:36,215 INFO L93 Difference]: Finished difference Result 2507 states and 4248 transitions. [2022-04-28 08:16:36,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 4248 transitions. [2022-04-28 08:16:36,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:36,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:36,221 INFO L74 IsIncluded]: Start isIncluded. First operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2507 states. [2022-04-28 08:16:36,223 INFO L87 Difference]: Start difference. First operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2507 states. [2022-04-28 08:16:36,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:36,373 INFO L93 Difference]: Finished difference Result 2507 states and 4248 transitions. [2022-04-28 08:16:36,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 4248 transitions. [2022-04-28 08:16:36,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:36,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:36,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:36,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:36,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:36,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 3159 transitions. [2022-04-28 08:16:36,538 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 3159 transitions. Word has length 30 [2022-04-28 08:16:36,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:36,538 INFO L495 AbstractCegarLoop]: Abstraction has 1929 states and 3159 transitions. [2022-04-28 08:16:36,538 INFO L496 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-28 08:16:36,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1929 states and 3159 transitions. [2022-04-28 08:16:39,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3159 edges. 3159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:39,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 3159 transitions. [2022-04-28 08:16:39,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 08:16:39,330 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:39,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:39,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 08:16:39,330 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:39,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:39,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1598645784, now seen corresponding path program 1 times [2022-04-28 08:16:39,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:39,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1343136676] [2022-04-28 08:16:39,331 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:39,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1598645784, now seen corresponding path program 2 times [2022-04-28 08:16:39,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:39,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086788972] [2022-04-28 08:16:39,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:39,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:39,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:39,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {65894#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {65888#true} is VALID [2022-04-28 08:16:39,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {65888#true} assume true; {65888#true} is VALID [2022-04-28 08:16:39,388 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65888#true} {65888#true} #268#return; {65888#true} is VALID [2022-04-28 08:16:39,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {65888#true} call ULTIMATE.init(); {65894#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:39,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {65894#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {65888#true} is VALID [2022-04-28 08:16:39,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {65888#true} assume true; {65888#true} is VALID [2022-04-28 08:16:39,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65888#true} {65888#true} #268#return; {65888#true} is VALID [2022-04-28 08:16:39,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {65888#true} call #t~ret19 := main(); {65888#true} is VALID [2022-04-28 08:16:39,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {65888#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;havoc ~cond~0; {65888#true} is VALID [2022-04-28 08:16:39,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {65888#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {65888#true} is VALID [2022-04-28 08:16:39,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {65888#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; {65888#true} is VALID [2022-04-28 08:16:39,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {65888#true} assume !(0 != ~p1~0); {65888#true} is VALID [2022-04-28 08:16:39,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {65888#true} assume !(0 != ~p2~0); {65888#true} is VALID [2022-04-28 08:16:39,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {65888#true} assume !(0 != ~p3~0); {65888#true} is VALID [2022-04-28 08:16:39,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {65888#true} assume !(0 != ~p4~0); {65888#true} is VALID [2022-04-28 08:16:39,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {65888#true} assume !(0 != ~p5~0); {65888#true} is VALID [2022-04-28 08:16:39,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {65888#true} assume !(0 != ~p6~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:39,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:39,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:39,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:39,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p10~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:39,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:39,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:39,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:39,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:39,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p1~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:39,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p2~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:39,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p3~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:39,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p4~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:39,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p5~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:39,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p6~0; {65889#false} is VALID [2022-04-28 08:16:39,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {65889#false} assume 1 != ~lk6~0; {65889#false} is VALID [2022-04-28 08:16:39,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {65889#false} assume !false; {65889#false} is VALID [2022-04-28 08:16:39,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:39,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:39,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086788972] [2022-04-28 08:16:39,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086788972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:39,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:39,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:39,395 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:39,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1343136676] [2022-04-28 08:16:39,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1343136676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:39,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:39,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:39,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917692242] [2022-04-28 08:16:39,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:39,396 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-28 08:16:39,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:39,396 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-28 08:16:39,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:39,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:39,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:39,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:39,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:39,411 INFO L87 Difference]: Start difference. First operand 1929 states and 3159 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-28 08:16:40,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:40,816 INFO L93 Difference]: Finished difference Result 4557 states and 7513 transitions. [2022-04-28 08:16:40,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:40,817 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-28 08:16:40,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:40,817 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-28 08:16:40,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 249 transitions. [2022-04-28 08:16:40,818 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-28 08:16:40,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 249 transitions. [2022-04-28 08:16:40,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 249 transitions. [2022-04-28 08:16:40,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:41,228 INFO L225 Difference]: With dead ends: 4557 [2022-04-28 08:16:41,228 INFO L226 Difference]: Without dead ends: 2667 [2022-04-28 08:16:41,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:41,231 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 178 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:41,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 137 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:16:41,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2022-04-28 08:16:41,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 2665. [2022-04-28 08:16:41,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:41,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2667 states. Second operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:41,411 INFO L74 IsIncluded]: Start isIncluded. First operand 2667 states. Second operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:41,413 INFO L87 Difference]: Start difference. First operand 2667 states. Second operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:41,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:41,588 INFO L93 Difference]: Finished difference Result 2667 states and 4360 transitions. [2022-04-28 08:16:41,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 4360 transitions. [2022-04-28 08:16:41,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:41,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:41,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2667 states. [2022-04-28 08:16:41,595 INFO L87 Difference]: Start difference. First operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2667 states. [2022-04-28 08:16:41,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:41,765 INFO L93 Difference]: Finished difference Result 2667 states and 4360 transitions. [2022-04-28 08:16:41,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 4360 transitions. [2022-04-28 08:16:41,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:41,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:41,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:41,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:42,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2665 states to 2665 states and 4359 transitions. [2022-04-28 08:16:42,078 INFO L78 Accepts]: Start accepts. Automaton has 2665 states and 4359 transitions. Word has length 30 [2022-04-28 08:16:42,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:42,078 INFO L495 AbstractCegarLoop]: Abstraction has 2665 states and 4359 transitions. [2022-04-28 08:16:42,078 INFO L496 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-28 08:16:42,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2665 states and 4359 transitions. [2022-04-28 08:16:46,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4359 edges. 4359 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:46,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2665 states and 4359 transitions. [2022-04-28 08:16:46,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 08:16:46,221 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:46,221 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:46,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 08:16:46,221 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:46,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:46,221 INFO L85 PathProgramCache]: Analyzing trace with hash -319020550, now seen corresponding path program 1 times [2022-04-28 08:16:46,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:46,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [47440186] [2022-04-28 08:16:46,221 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:46,222 INFO L85 PathProgramCache]: Analyzing trace with hash -319020550, now seen corresponding path program 2 times [2022-04-28 08:16:46,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:46,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538463904] [2022-04-28 08:16:46,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:46,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:46,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:46,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {85684#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {85678#true} is VALID [2022-04-28 08:16:46,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {85678#true} assume true; {85678#true} is VALID [2022-04-28 08:16:46,260 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {85678#true} {85678#true} #268#return; {85678#true} is VALID [2022-04-28 08:16:46,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {85678#true} call ULTIMATE.init(); {85684#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:46,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {85684#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {85678#true} is VALID [2022-04-28 08:16:46,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {85678#true} assume true; {85678#true} is VALID [2022-04-28 08:16:46,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85678#true} {85678#true} #268#return; {85678#true} is VALID [2022-04-28 08:16:46,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {85678#true} call #t~ret19 := main(); {85678#true} is VALID [2022-04-28 08:16:46,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {85678#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;havoc ~cond~0; {85678#true} is VALID [2022-04-28 08:16:46,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {85678#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {85678#true} is VALID [2022-04-28 08:16:46,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {85678#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; {85678#true} is VALID [2022-04-28 08:16:46,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {85678#true} assume !(0 != ~p1~0); {85678#true} is VALID [2022-04-28 08:16:46,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {85678#true} assume !(0 != ~p2~0); {85678#true} is VALID [2022-04-28 08:16:46,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {85678#true} assume !(0 != ~p3~0); {85678#true} is VALID [2022-04-28 08:16:46,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {85678#true} assume !(0 != ~p4~0); {85678#true} is VALID [2022-04-28 08:16:46,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {85678#true} assume !(0 != ~p5~0); {85678#true} is VALID [2022-04-28 08:16:46,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {85678#true} assume 0 != ~p6~0;~lk6~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:46,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:46,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:46,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:46,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:46,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:46,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:46,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:46,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:46,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:46,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:46,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:46,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:46,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:46,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {85679#false} is VALID [2022-04-28 08:16:46,265 INFO L290 TraceCheckUtils]: 28: Hoare triple {85679#false} assume 0 != ~p7~0; {85679#false} is VALID [2022-04-28 08:16:46,265 INFO L290 TraceCheckUtils]: 29: Hoare triple {85679#false} assume 1 != ~lk7~0; {85679#false} is VALID [2022-04-28 08:16:46,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {85679#false} assume !false; {85679#false} is VALID [2022-04-28 08:16:46,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:46,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:46,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538463904] [2022-04-28 08:16:46,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538463904] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:46,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:46,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:46,266 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:46,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [47440186] [2022-04-28 08:16:46,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [47440186] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:46,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:46,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:46,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292569161] [2022-04-28 08:16:46,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:46,266 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-28 08:16:46,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:46,266 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-28 08:16:46,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:46,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:46,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:46,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:46,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:46,283 INFO L87 Difference]: Start difference. First operand 2665 states and 4359 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-28 08:16:47,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:47,288 INFO L93 Difference]: Finished difference Result 3997 states and 6521 transitions. [2022-04-28 08:16:47,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:47,288 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-28 08:16:47,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:47,288 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-28 08:16:47,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2022-04-28 08:16:47,289 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-28 08:16:47,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2022-04-28 08:16:47,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 244 transitions. [2022-04-28 08:16:47,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:47,715 INFO L225 Difference]: With dead ends: 3997 [2022-04-28 08:16:47,715 INFO L226 Difference]: Without dead ends: 2699 [2022-04-28 08:16:47,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:47,717 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 178 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:47,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 138 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:47,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2022-04-28 08:16:47,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2697. [2022-04-28 08:16:47,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:47,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2699 states. Second operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:47,901 INFO L74 IsIncluded]: Start isIncluded. First operand 2699 states. Second operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:47,902 INFO L87 Difference]: Start difference. First operand 2699 states. Second operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:48,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:48,071 INFO L93 Difference]: Finished difference Result 2699 states and 4360 transitions. [2022-04-28 08:16:48,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4360 transitions. [2022-04-28 08:16:48,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:48,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:48,076 INFO L74 IsIncluded]: Start isIncluded. First operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states 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-28 08:16:48,078 INFO L87 Difference]: Start difference. First operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states 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-28 08:16:48,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:48,254 INFO L93 Difference]: Finished difference Result 2699 states and 4360 transitions. [2022-04-28 08:16:48,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4360 transitions. [2022-04-28 08:16:48,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:48,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:48,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:48,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:48,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:48,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2697 states and 4359 transitions. [2022-04-28 08:16:48,573 INFO L78 Accepts]: Start accepts. Automaton has 2697 states and 4359 transitions. Word has length 31 [2022-04-28 08:16:48,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:48,573 INFO L495 AbstractCegarLoop]: Abstraction has 2697 states and 4359 transitions. [2022-04-28 08:16:48,573 INFO L496 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-28 08:16:48,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2697 states and 4359 transitions. [2022-04-28 08:16:52,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4359 edges. 4359 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:52,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 4359 transitions. [2022-04-28 08:16:52,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 08:16:52,653 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:52,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:52,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 08:16:52,653 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:52,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:52,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1981802040, now seen corresponding path program 1 times [2022-04-28 08:16:52,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:52,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1698856199] [2022-04-28 08:16:52,654 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:52,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1981802040, now seen corresponding path program 2 times [2022-04-28 08:16:52,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:52,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31916406] [2022-04-28 08:16:52,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:52,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:52,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:52,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {104482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {104476#true} is VALID [2022-04-28 08:16:52,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {104476#true} assume true; {104476#true} is VALID [2022-04-28 08:16:52,691 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {104476#true} {104476#true} #268#return; {104476#true} is VALID [2022-04-28 08:16:52,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {104476#true} call ULTIMATE.init(); {104482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:52,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {104482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {104476#true} is VALID [2022-04-28 08:16:52,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {104476#true} assume true; {104476#true} is VALID [2022-04-28 08:16:52,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104476#true} {104476#true} #268#return; {104476#true} is VALID [2022-04-28 08:16:52,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {104476#true} call #t~ret19 := main(); {104476#true} is VALID [2022-04-28 08:16:52,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {104476#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;havoc ~cond~0; {104476#true} is VALID [2022-04-28 08:16:52,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {104476#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {104476#true} is VALID [2022-04-28 08:16:52,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {104476#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; {104476#true} is VALID [2022-04-28 08:16:52,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {104476#true} assume !(0 != ~p1~0); {104476#true} is VALID [2022-04-28 08:16:52,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {104476#true} assume !(0 != ~p2~0); {104476#true} is VALID [2022-04-28 08:16:52,692 INFO L290 TraceCheckUtils]: 10: Hoare triple {104476#true} assume !(0 != ~p3~0); {104476#true} is VALID [2022-04-28 08:16:52,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {104476#true} assume !(0 != ~p4~0); {104476#true} is VALID [2022-04-28 08:16:52,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {104476#true} assume !(0 != ~p5~0); {104476#true} is VALID [2022-04-28 08:16:52,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {104476#true} assume !(0 != ~p6~0); {104476#true} is VALID [2022-04-28 08:16:52,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {104476#true} assume 0 != ~p7~0;~lk7~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:52,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:52,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:52,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:52,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:52,694 INFO L290 TraceCheckUtils]: 19: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:52,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:52,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:52,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:52,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:52,695 INFO L290 TraceCheckUtils]: 24: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:52,695 INFO L290 TraceCheckUtils]: 25: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:52,695 INFO L290 TraceCheckUtils]: 26: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:52,696 INFO L290 TraceCheckUtils]: 27: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:52,696 INFO L290 TraceCheckUtils]: 28: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p7~0; {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:52,696 INFO L290 TraceCheckUtils]: 29: Hoare triple {104481#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {104477#false} is VALID [2022-04-28 08:16:52,696 INFO L290 TraceCheckUtils]: 30: Hoare triple {104477#false} assume !false; {104477#false} is VALID [2022-04-28 08:16:52,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:52,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:52,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31916406] [2022-04-28 08:16:52,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31916406] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:52,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:52,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:52,697 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:52,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1698856199] [2022-04-28 08:16:52,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1698856199] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:52,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:52,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:52,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421718199] [2022-04-28 08:16:52,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:52,697 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-28 08:16:52,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:52,698 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-28 08:16:52,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:52,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:52,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:52,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:52,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:52,715 INFO L87 Difference]: Start difference. First operand 2697 states and 4359 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-28 08:16:54,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:54,153 INFO L93 Difference]: Finished difference Result 4877 states and 8041 transitions. [2022-04-28 08:16:54,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:54,154 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-28 08:16:54,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:54,154 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-28 08:16:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-04-28 08:16:54,155 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-28 08:16:54,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-04-28 08:16:54,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 155 transitions. [2022-04-28 08:16:54,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:55,184 INFO L225 Difference]: With dead ends: 4877 [2022-04-28 08:16:55,184 INFO L226 Difference]: Without dead ends: 4875 [2022-04-28 08:16:55,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:55,185 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 194 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:55,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 96 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:55,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2022-04-28 08:16:55,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 3849. [2022-04-28 08:16:55,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:55,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4875 states. Second operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:55,450 INFO L74 IsIncluded]: Start isIncluded. First operand 4875 states. Second operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:55,452 INFO L87 Difference]: Start difference. First operand 4875 states. Second operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:56,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:56,061 INFO L93 Difference]: Finished difference Result 4875 states and 7976 transitions. [2022-04-28 08:16:56,061 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 7976 transitions. [2022-04-28 08:16:56,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:56,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:56,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4875 states. [2022-04-28 08:16:56,072 INFO L87 Difference]: Start difference. First operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4875 states. [2022-04-28 08:16:56,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:56,695 INFO L93 Difference]: Finished difference Result 4875 states and 7976 transitions. [2022-04-28 08:16:56,696 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 7976 transitions. [2022-04-28 08:16:56,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:56,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:56,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:56,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:56,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:57,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 6055 transitions. [2022-04-28 08:16:57,359 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 6055 transitions. Word has length 31 [2022-04-28 08:16:57,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:57,359 INFO L495 AbstractCegarLoop]: Abstraction has 3849 states and 6055 transitions. [2022-04-28 08:16:57,359 INFO L496 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-28 08:16:57,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3849 states and 6055 transitions. [2022-04-28 08:17:02,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6055 edges. 6055 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:02,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 6055 transitions. [2022-04-28 08:17:02,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 08:17:02,977 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:17:02,978 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:17:02,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 08:17:02,978 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:17:02,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:17:02,978 INFO L85 PathProgramCache]: Analyzing trace with hash 393454138, now seen corresponding path program 1 times [2022-04-28 08:17:02,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:02,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1850659330] [2022-04-28 08:17:02,978 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:17:02,979 INFO L85 PathProgramCache]: Analyzing trace with hash 393454138, now seen corresponding path program 2 times [2022-04-28 08:17:02,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:17:02,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804022420] [2022-04-28 08:17:02,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:17:02,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:17:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:03,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:17:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:03,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {131696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {131690#true} is VALID [2022-04-28 08:17:03,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {131690#true} assume true; {131690#true} is VALID [2022-04-28 08:17:03,008 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {131690#true} {131690#true} #268#return; {131690#true} is VALID [2022-04-28 08:17:03,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {131690#true} call ULTIMATE.init(); {131696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:17:03,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {131696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {131690#true} is VALID [2022-04-28 08:17:03,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {131690#true} assume true; {131690#true} is VALID [2022-04-28 08:17:03,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131690#true} {131690#true} #268#return; {131690#true} is VALID [2022-04-28 08:17:03,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {131690#true} call #t~ret19 := main(); {131690#true} is VALID [2022-04-28 08:17:03,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {131690#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;havoc ~cond~0; {131690#true} is VALID [2022-04-28 08:17:03,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {131690#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {131690#true} is VALID [2022-04-28 08:17:03,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {131690#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; {131690#true} is VALID [2022-04-28 08:17:03,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {131690#true} assume !(0 != ~p1~0); {131690#true} is VALID [2022-04-28 08:17:03,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {131690#true} assume !(0 != ~p2~0); {131690#true} is VALID [2022-04-28 08:17:03,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {131690#true} assume !(0 != ~p3~0); {131690#true} is VALID [2022-04-28 08:17:03,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {131690#true} assume !(0 != ~p4~0); {131690#true} is VALID [2022-04-28 08:17:03,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {131690#true} assume !(0 != ~p5~0); {131690#true} is VALID [2022-04-28 08:17:03,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {131690#true} assume !(0 != ~p6~0); {131690#true} is VALID [2022-04-28 08:17:03,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {131690#true} assume !(0 != ~p7~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-28 08:17:03,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-28 08:17:03,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-28 08:17:03,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p10~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-28 08:17:03,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-28 08:17:03,011 INFO L290 TraceCheckUtils]: 19: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-28 08:17:03,011 INFO L290 TraceCheckUtils]: 20: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-28 08:17:03,011 INFO L290 TraceCheckUtils]: 21: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-28 08:17:03,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p1~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-28 08:17:03,012 INFO L290 TraceCheckUtils]: 23: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p2~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-28 08:17:03,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p3~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-28 08:17:03,012 INFO L290 TraceCheckUtils]: 25: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p4~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-28 08:17:03,012 INFO L290 TraceCheckUtils]: 26: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p5~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-28 08:17:03,012 INFO L290 TraceCheckUtils]: 27: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p6~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-28 08:17:03,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p7~0; {131691#false} is VALID [2022-04-28 08:17:03,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {131691#false} assume 1 != ~lk7~0; {131691#false} is VALID [2022-04-28 08:17:03,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {131691#false} assume !false; {131691#false} is VALID [2022-04-28 08:17:03,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:17:03,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:17:03,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804022420] [2022-04-28 08:17:03,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804022420] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:03,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:03,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:03,014 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:17:03,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1850659330] [2022-04-28 08:17:03,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1850659330] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:03,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:03,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:03,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377101255] [2022-04-28 08:17:03,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:17:03,014 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-28 08:17:03,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:17:03,014 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-28 08:17:03,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:03,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:17:03,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:03,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:17:03,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:17:03,030 INFO L87 Difference]: Start difference. First operand 3849 states and 6055 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-28 08:17:06,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:06,833 INFO L93 Difference]: Finished difference Result 9037 states and 14313 transitions. [2022-04-28 08:17:06,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:17:06,833 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-28 08:17:06,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:17:06,833 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-28 08:17:06,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2022-04-28 08:17:06,835 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-28 08:17:06,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2022-04-28 08:17:06,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 246 transitions. [2022-04-28 08:17:06,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:08,033 INFO L225 Difference]: With dead ends: 9037 [2022-04-28 08:17:08,033 INFO L226 Difference]: Without dead ends: 5259 [2022-04-28 08:17:08,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:17:08,038 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 172 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:17:08,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 139 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:17:08,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2022-04-28 08:17:08,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 5257. [2022-04-28 08:17:08,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:17:08,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5259 states. Second operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:08,463 INFO L74 IsIncluded]: Start isIncluded. First operand 5259 states. Second operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:08,466 INFO L87 Difference]: Start difference. First operand 5259 states. Second operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:09,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:09,156 INFO L93 Difference]: Finished difference Result 5259 states and 8264 transitions. [2022-04-28 08:17:09,156 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 8264 transitions. [2022-04-28 08:17:09,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:17:09,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:17:09,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states 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-28 08:17:09,171 INFO L87 Difference]: Start difference. First operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states 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-28 08:17:09,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:09,854 INFO L93 Difference]: Finished difference Result 5259 states and 8264 transitions. [2022-04-28 08:17:09,854 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 8264 transitions. [2022-04-28 08:17:09,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:17:09,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:17:09,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:17:09,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:17:09,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:10,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5257 states to 5257 states and 8263 transitions. [2022-04-28 08:17:10,981 INFO L78 Accepts]: Start accepts. Automaton has 5257 states and 8263 transitions. Word has length 31 [2022-04-28 08:17:10,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:17:10,982 INFO L495 AbstractCegarLoop]: Abstraction has 5257 states and 8263 transitions. [2022-04-28 08:17:10,982 INFO L496 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-28 08:17:10,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5257 states and 8263 transitions. [2022-04-28 08:17:19,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8263 edges. 8263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:19,160 INFO L276 IsEmpty]: Start isEmpty. Operand 5257 states and 8263 transitions. [2022-04-28 08:17:19,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 08:17:19,164 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:17:19,164 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:17:19,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 08:17:19,165 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:17:19,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:17:19,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1306535229, now seen corresponding path program 1 times [2022-04-28 08:17:19,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:19,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1292820942] [2022-04-28 08:17:19,165 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:17:19,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1306535229, now seen corresponding path program 2 times [2022-04-28 08:17:19,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:17:19,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474867336] [2022-04-28 08:17:19,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:17:19,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:17:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:19,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:17:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:19,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {170814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {170808#true} is VALID [2022-04-28 08:17:19,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {170808#true} assume true; {170808#true} is VALID [2022-04-28 08:17:19,200 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {170808#true} {170808#true} #268#return; {170808#true} is VALID [2022-04-28 08:17:19,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {170808#true} call ULTIMATE.init(); {170814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:17:19,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {170814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {170808#true} is VALID [2022-04-28 08:17:19,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {170808#true} assume true; {170808#true} is VALID [2022-04-28 08:17:19,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {170808#true} {170808#true} #268#return; {170808#true} is VALID [2022-04-28 08:17:19,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {170808#true} call #t~ret19 := main(); {170808#true} is VALID [2022-04-28 08:17:19,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {170808#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;havoc ~cond~0; {170808#true} is VALID [2022-04-28 08:17:19,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {170808#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {170808#true} is VALID [2022-04-28 08:17:19,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {170808#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; {170808#true} is VALID [2022-04-28 08:17:19,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {170808#true} assume !(0 != ~p1~0); {170808#true} is VALID [2022-04-28 08:17:19,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {170808#true} assume !(0 != ~p2~0); {170808#true} is VALID [2022-04-28 08:17:19,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {170808#true} assume !(0 != ~p3~0); {170808#true} is VALID [2022-04-28 08:17:19,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {170808#true} assume !(0 != ~p4~0); {170808#true} is VALID [2022-04-28 08:17:19,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {170808#true} assume !(0 != ~p5~0); {170808#true} is VALID [2022-04-28 08:17:19,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {170808#true} assume !(0 != ~p6~0); {170808#true} is VALID [2022-04-28 08:17:19,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {170808#true} assume 0 != ~p7~0;~lk7~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:19,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:19,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:19,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:19,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:19,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:19,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:19,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:19,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:19,204 INFO L290 TraceCheckUtils]: 23: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:19,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:19,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:19,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:19,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:19,205 INFO L290 TraceCheckUtils]: 28: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {170809#false} is VALID [2022-04-28 08:17:19,205 INFO L290 TraceCheckUtils]: 29: Hoare triple {170809#false} assume 0 != ~p8~0; {170809#false} is VALID [2022-04-28 08:17:19,205 INFO L290 TraceCheckUtils]: 30: Hoare triple {170809#false} assume 1 != ~lk8~0; {170809#false} is VALID [2022-04-28 08:17:19,205 INFO L290 TraceCheckUtils]: 31: Hoare triple {170809#false} assume !false; {170809#false} is VALID [2022-04-28 08:17:19,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:17:19,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:17:19,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474867336] [2022-04-28 08:17:19,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474867336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:19,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:19,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:19,206 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:17:19,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1292820942] [2022-04-28 08:17:19,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1292820942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:19,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:19,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:19,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425835052] [2022-04-28 08:17:19,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:17:19,207 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-28 08:17:19,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:17:19,207 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-28 08:17:19,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:19,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:17:19,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:19,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:17:19,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:17:19,224 INFO L87 Difference]: Start difference. First operand 5257 states and 8263 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-28 08:17:22,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:22,306 INFO L93 Difference]: Finished difference Result 7885 states and 12361 transitions. [2022-04-28 08:17:22,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:17:22,307 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-28 08:17:22,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:17:22,307 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-28 08:17:22,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2022-04-28 08:17:22,308 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-28 08:17:22,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2022-04-28 08:17:22,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 241 transitions. [2022-04-28 08:17:22,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:23,559 INFO L225 Difference]: With dead ends: 7885 [2022-04-28 08:17:23,560 INFO L226 Difference]: Without dead ends: 5323 [2022-04-28 08:17:23,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:17:23,563 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 177 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:17:23,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 135 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:17:23,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5323 states. [2022-04-28 08:17:23,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5323 to 5321. [2022-04-28 08:17:23,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:17:23,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5323 states. Second operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:23,944 INFO L74 IsIncluded]: Start isIncluded. First operand 5323 states. Second operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:23,948 INFO L87 Difference]: Start difference. First operand 5323 states. Second operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:24,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:24,639 INFO L93 Difference]: Finished difference Result 5323 states and 8264 transitions. [2022-04-28 08:17:24,639 INFO L276 IsEmpty]: Start isEmpty. Operand 5323 states and 8264 transitions. [2022-04-28 08:17:24,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:17:24,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:17:24,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5323 states. [2022-04-28 08:17:24,653 INFO L87 Difference]: Start difference. First operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5323 states. [2022-04-28 08:17:25,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:25,378 INFO L93 Difference]: Finished difference Result 5323 states and 8264 transitions. [2022-04-28 08:17:25,378 INFO L276 IsEmpty]: Start isEmpty. Operand 5323 states and 8264 transitions. [2022-04-28 08:17:25,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:17:25,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:17:25,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:17:25,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:17:25,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:26,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5321 states to 5321 states and 8263 transitions. [2022-04-28 08:17:26,511 INFO L78 Accepts]: Start accepts. Automaton has 5321 states and 8263 transitions. Word has length 32 [2022-04-28 08:17:26,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:17:26,511 INFO L495 AbstractCegarLoop]: Abstraction has 5321 states and 8263 transitions. [2022-04-28 08:17:26,511 INFO L496 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-28 08:17:26,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5321 states and 8263 transitions. [2022-04-28 08:17:34,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8263 edges. 8263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:34,714 INFO L276 IsEmpty]: Start isEmpty. Operand 5321 states and 8263 transitions. [2022-04-28 08:17:34,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 08:17:34,717 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:17:34,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:17:34,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 08:17:34,717 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:17:34,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:17:34,718 INFO L85 PathProgramCache]: Analyzing trace with hash -687609477, now seen corresponding path program 1 times [2022-04-28 08:17:34,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:34,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1800041775] [2022-04-28 08:17:34,718 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:17:34,718 INFO L85 PathProgramCache]: Analyzing trace with hash -687609477, now seen corresponding path program 2 times [2022-04-28 08:17:34,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:17:34,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129632477] [2022-04-28 08:17:34,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:17:34,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:17:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:34,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:17:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:34,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {207884#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {207878#true} is VALID [2022-04-28 08:17:34,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {207878#true} assume true; {207878#true} is VALID [2022-04-28 08:17:34,746 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {207878#true} {207878#true} #268#return; {207878#true} is VALID [2022-04-28 08:17:34,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {207878#true} call ULTIMATE.init(); {207884#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:17:34,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {207884#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {207878#true} is VALID [2022-04-28 08:17:34,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {207878#true} assume true; {207878#true} is VALID [2022-04-28 08:17:34,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {207878#true} {207878#true} #268#return; {207878#true} is VALID [2022-04-28 08:17:34,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {207878#true} call #t~ret19 := main(); {207878#true} is VALID [2022-04-28 08:17:34,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {207878#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;havoc ~cond~0; {207878#true} is VALID [2022-04-28 08:17:34,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {207878#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {207878#true} is VALID [2022-04-28 08:17:34,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {207878#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; {207878#true} is VALID [2022-04-28 08:17:34,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {207878#true} assume !(0 != ~p1~0); {207878#true} is VALID [2022-04-28 08:17:34,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {207878#true} assume !(0 != ~p2~0); {207878#true} is VALID [2022-04-28 08:17:34,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {207878#true} assume !(0 != ~p3~0); {207878#true} is VALID [2022-04-28 08:17:34,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {207878#true} assume !(0 != ~p4~0); {207878#true} is VALID [2022-04-28 08:17:34,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {207878#true} assume !(0 != ~p5~0); {207878#true} is VALID [2022-04-28 08:17:34,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {207878#true} assume !(0 != ~p6~0); {207878#true} is VALID [2022-04-28 08:17:34,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {207878#true} assume !(0 != ~p7~0); {207878#true} is VALID [2022-04-28 08:17:34,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {207878#true} assume 0 != ~p8~0;~lk8~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:34,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:34,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:34,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:34,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:34,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:34,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:34,749 INFO L290 TraceCheckUtils]: 22: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:34,749 INFO L290 TraceCheckUtils]: 23: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:34,749 INFO L290 TraceCheckUtils]: 24: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:34,750 INFO L290 TraceCheckUtils]: 25: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:34,750 INFO L290 TraceCheckUtils]: 26: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:34,750 INFO L290 TraceCheckUtils]: 27: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:34,750 INFO L290 TraceCheckUtils]: 28: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:34,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p8~0; {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:34,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {207883#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {207879#false} is VALID [2022-04-28 08:17:34,751 INFO L290 TraceCheckUtils]: 31: Hoare triple {207879#false} assume !false; {207879#false} is VALID [2022-04-28 08:17:34,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:17:34,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:17:34,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129632477] [2022-04-28 08:17:34,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129632477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:34,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:34,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:34,752 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:17:34,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1800041775] [2022-04-28 08:17:34,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1800041775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:34,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:34,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:34,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457226923] [2022-04-28 08:17:34,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:17:34,752 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-28 08:17:34,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:17:34,752 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-28 08:17:34,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:34,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:17:34,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:34,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:17:34,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:17:34,767 INFO L87 Difference]: Start difference. First operand 5321 states and 8263 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-28 08:17:39,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:39,237 INFO L93 Difference]: Finished difference Result 9485 states and 15049 transitions. [2022-04-28 08:17:39,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:17:39,237 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-28 08:17:39,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:17:39,237 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-28 08:17:39,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-28 08:17:39,238 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-28 08:17:39,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-28 08:17:39,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-28 08:17:39,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:42,984 INFO L225 Difference]: With dead ends: 9485 [2022-04-28 08:17:42,985 INFO L226 Difference]: Without dead ends: 9483 [2022-04-28 08:17:42,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:17:42,987 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 187 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:17:42,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 95 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:17:42,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9483 states. [2022-04-28 08:17:43,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9483 to 7689. [2022-04-28 08:17:43,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:17:43,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9483 states. Second operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:43,573 INFO L74 IsIncluded]: Start isIncluded. First operand 9483 states. Second operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:43,581 INFO L87 Difference]: Start difference. First operand 9483 states. Second operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:45,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:45,897 INFO L93 Difference]: Finished difference Result 9483 states and 14920 transitions. [2022-04-28 08:17:45,897 INFO L276 IsEmpty]: Start isEmpty. Operand 9483 states and 14920 transitions. [2022-04-28 08:17:45,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:17:45,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:17:45,913 INFO L74 IsIncluded]: Start isIncluded. First operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 9483 states. [2022-04-28 08:17:45,920 INFO L87 Difference]: Start difference. First operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 9483 states. [2022-04-28 08:17:48,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:48,233 INFO L93 Difference]: Finished difference Result 9483 states and 14920 transitions. [2022-04-28 08:17:48,233 INFO L276 IsEmpty]: Start isEmpty. Operand 9483 states and 14920 transitions. [2022-04-28 08:17:48,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:17:48,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:17:48,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:17:48,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:17:48,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:50,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7689 states to 7689 states and 11591 transitions. [2022-04-28 08:17:50,837 INFO L78 Accepts]: Start accepts. Automaton has 7689 states and 11591 transitions. Word has length 32 [2022-04-28 08:17:50,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:17:50,838 INFO L495 AbstractCegarLoop]: Abstraction has 7689 states and 11591 transitions. [2022-04-28 08:17:50,838 INFO L496 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-28 08:17:50,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7689 states and 11591 transitions. [2022-04-28 08:18:02,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11591 edges. 11591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:02,228 INFO L276 IsEmpty]: Start isEmpty. Operand 7689 states and 11591 transitions. [2022-04-28 08:18:02,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 08:18:02,233 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:18:02,233 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:18:02,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 08:18:02,233 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:18:02,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:18:02,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2019009917, now seen corresponding path program 1 times [2022-04-28 08:18:02,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:02,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [357196828] [2022-04-28 08:18:02,233 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:18:02,234 INFO L85 PathProgramCache]: Analyzing trace with hash 2019009917, now seen corresponding path program 2 times [2022-04-28 08:18:02,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:18:02,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008403937] [2022-04-28 08:18:02,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:18:02,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:18:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:02,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:18:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:02,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {261210#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {261204#true} is VALID [2022-04-28 08:18:02,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {261204#true} assume true; {261204#true} is VALID [2022-04-28 08:18:02,299 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {261204#true} {261204#true} #268#return; {261204#true} is VALID [2022-04-28 08:18:02,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {261204#true} call ULTIMATE.init(); {261210#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:18:02,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {261210#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {261204#true} is VALID [2022-04-28 08:18:02,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {261204#true} assume true; {261204#true} is VALID [2022-04-28 08:18:02,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {261204#true} {261204#true} #268#return; {261204#true} is VALID [2022-04-28 08:18:02,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {261204#true} call #t~ret19 := main(); {261204#true} is VALID [2022-04-28 08:18:02,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {261204#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;havoc ~cond~0; {261204#true} is VALID [2022-04-28 08:18:02,300 INFO L290 TraceCheckUtils]: 6: Hoare triple {261204#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {261204#true} is VALID [2022-04-28 08:18:02,300 INFO L290 TraceCheckUtils]: 7: Hoare triple {261204#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; {261204#true} is VALID [2022-04-28 08:18:02,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {261204#true} assume !(0 != ~p1~0); {261204#true} is VALID [2022-04-28 08:18:02,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {261204#true} assume !(0 != ~p2~0); {261204#true} is VALID [2022-04-28 08:18:02,300 INFO L290 TraceCheckUtils]: 10: Hoare triple {261204#true} assume !(0 != ~p3~0); {261204#true} is VALID [2022-04-28 08:18:02,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {261204#true} assume !(0 != ~p4~0); {261204#true} is VALID [2022-04-28 08:18:02,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {261204#true} assume !(0 != ~p5~0); {261204#true} is VALID [2022-04-28 08:18:02,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {261204#true} assume !(0 != ~p6~0); {261204#true} is VALID [2022-04-28 08:18:02,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {261204#true} assume !(0 != ~p7~0); {261204#true} is VALID [2022-04-28 08:18:02,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {261204#true} assume !(0 != ~p8~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-28 08:18:02,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {261209#(= main_~p8~0 0)} is VALID [2022-04-28 08:18:02,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p10~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-28 08:18:02,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {261209#(= main_~p8~0 0)} is VALID [2022-04-28 08:18:02,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {261209#(= main_~p8~0 0)} is VALID [2022-04-28 08:18:02,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {261209#(= main_~p8~0 0)} is VALID [2022-04-28 08:18:02,302 INFO L290 TraceCheckUtils]: 21: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {261209#(= main_~p8~0 0)} is VALID [2022-04-28 08:18:02,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p1~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-28 08:18:02,303 INFO L290 TraceCheckUtils]: 23: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p2~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-28 08:18:02,303 INFO L290 TraceCheckUtils]: 24: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p3~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-28 08:18:02,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p4~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-28 08:18:02,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p5~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-28 08:18:02,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p6~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-28 08:18:02,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p7~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-28 08:18:02,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p8~0; {261205#false} is VALID [2022-04-28 08:18:02,304 INFO L290 TraceCheckUtils]: 30: Hoare triple {261205#false} assume 1 != ~lk8~0; {261205#false} is VALID [2022-04-28 08:18:02,304 INFO L290 TraceCheckUtils]: 31: Hoare triple {261205#false} assume !false; {261205#false} is VALID [2022-04-28 08:18:02,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:18:02,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:18:02,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008403937] [2022-04-28 08:18:02,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008403937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:02,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:02,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:02,305 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:18:02,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [357196828] [2022-04-28 08:18:02,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [357196828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:02,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:02,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:02,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979088826] [2022-04-28 08:18:02,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:18:02,305 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-28 08:18:02,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:18:02,306 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-28 08:18:02,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:02,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:18:02,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:02,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:18:02,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:18:02,322 INFO L87 Difference]: Start difference. First operand 7689 states and 11591 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-28 08:18:16,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:16,745 INFO L93 Difference]: Finished difference Result 17933 states and 27209 transitions. [2022-04-28 08:18:16,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:18:16,745 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-28 08:18:16,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:18:16,745 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-28 08:18:16,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2022-04-28 08:18:16,746 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-28 08:18:16,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2022-04-28 08:18:16,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 243 transitions. [2022-04-28 08:18:16,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:21,183 INFO L225 Difference]: With dead ends: 17933 [2022-04-28 08:18:21,184 INFO L226 Difference]: Without dead ends: 10379 [2022-04-28 08:18:21,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:18:21,191 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 166 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:18:21,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 141 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:18:21,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10379 states. [2022-04-28 08:18:21,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10379 to 10377. [2022-04-28 08:18:21,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:18:21,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10379 states. Second operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:21,998 INFO L74 IsIncluded]: Start isIncluded. First operand 10379 states. Second operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:22,008 INFO L87 Difference]: Start difference. First operand 10379 states. Second operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:24,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:24,635 INFO L93 Difference]: Finished difference Result 10379 states and 15624 transitions. [2022-04-28 08:18:24,635 INFO L276 IsEmpty]: Start isEmpty. Operand 10379 states and 15624 transitions. [2022-04-28 08:18:24,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:24,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:24,665 INFO L74 IsIncluded]: Start isIncluded. First operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 10379 states. [2022-04-28 08:18:24,677 INFO L87 Difference]: Start difference. First operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 10379 states. [2022-04-28 08:18:27,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:27,537 INFO L93 Difference]: Finished difference Result 10379 states and 15624 transitions. [2022-04-28 08:18:27,537 INFO L276 IsEmpty]: Start isEmpty. Operand 10379 states and 15624 transitions. [2022-04-28 08:18:27,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:27,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:27,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:18:27,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:18:27,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:31,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10377 states to 10377 states and 15623 transitions. [2022-04-28 08:18:31,960 INFO L78 Accepts]: Start accepts. Automaton has 10377 states and 15623 transitions. Word has length 32 [2022-04-28 08:18:31,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:18:31,960 INFO L495 AbstractCegarLoop]: Abstraction has 10377 states and 15623 transitions. [2022-04-28 08:18:31,961 INFO L496 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-28 08:18:31,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10377 states and 15623 transitions. [2022-04-28 08:18:48,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15623 edges. 15623 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:48,372 INFO L276 IsEmpty]: Start isEmpty. Operand 10377 states and 15623 transitions. [2022-04-28 08:18:48,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 08:18:48,377 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:18:48,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:18:48,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 08:18:48,377 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:18:48,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:18:48,378 INFO L85 PathProgramCache]: Analyzing trace with hash 159157167, now seen corresponding path program 1 times [2022-04-28 08:18:48,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:48,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [763549439] [2022-04-28 08:18:48,378 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:18:48,378 INFO L85 PathProgramCache]: Analyzing trace with hash 159157167, now seen corresponding path program 2 times [2022-04-28 08:18:48,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:18:48,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347469249] [2022-04-28 08:18:48,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:18:48,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:18:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:48,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:18:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:48,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {338600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {338594#true} is VALID [2022-04-28 08:18:48,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {338594#true} assume true; {338594#true} is VALID [2022-04-28 08:18:48,410 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {338594#true} {338594#true} #268#return; {338594#true} is VALID [2022-04-28 08:18:48,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {338594#true} call ULTIMATE.init(); {338600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:18:48,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {338600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {338594#true} is VALID [2022-04-28 08:18:48,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {338594#true} assume true; {338594#true} is VALID [2022-04-28 08:18:48,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {338594#true} {338594#true} #268#return; {338594#true} is VALID [2022-04-28 08:18:48,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {338594#true} call #t~ret19 := main(); {338594#true} is VALID [2022-04-28 08:18:48,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {338594#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;havoc ~cond~0; {338594#true} is VALID [2022-04-28 08:18:48,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {338594#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {338594#true} is VALID [2022-04-28 08:18:48,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {338594#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; {338594#true} is VALID [2022-04-28 08:18:48,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {338594#true} assume !(0 != ~p1~0); {338594#true} is VALID [2022-04-28 08:18:48,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {338594#true} assume !(0 != ~p2~0); {338594#true} is VALID [2022-04-28 08:18:48,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {338594#true} assume !(0 != ~p3~0); {338594#true} is VALID [2022-04-28 08:18:48,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {338594#true} assume !(0 != ~p4~0); {338594#true} is VALID [2022-04-28 08:18:48,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {338594#true} assume !(0 != ~p5~0); {338594#true} is VALID [2022-04-28 08:18:48,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {338594#true} assume !(0 != ~p6~0); {338594#true} is VALID [2022-04-28 08:18:48,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {338594#true} assume !(0 != ~p7~0); {338594#true} is VALID [2022-04-28 08:18:48,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {338594#true} assume 0 != ~p8~0;~lk8~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:48,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {338599#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:48,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:48,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {338599#(not (= main_~p8~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:48,424 INFO L290 TraceCheckUtils]: 19: Hoare triple {338599#(not (= main_~p8~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:48,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {338599#(not (= main_~p8~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:48,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {338599#(not (= main_~p8~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:48,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:48,425 INFO L290 TraceCheckUtils]: 23: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:48,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:48,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:48,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:48,426 INFO L290 TraceCheckUtils]: 27: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:48,426 INFO L290 TraceCheckUtils]: 28: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:48,426 INFO L290 TraceCheckUtils]: 29: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {338595#false} is VALID [2022-04-28 08:18:48,426 INFO L290 TraceCheckUtils]: 30: Hoare triple {338595#false} assume 0 != ~p9~0; {338595#false} is VALID [2022-04-28 08:18:48,426 INFO L290 TraceCheckUtils]: 31: Hoare triple {338595#false} assume 1 != ~lk9~0; {338595#false} is VALID [2022-04-28 08:18:48,426 INFO L290 TraceCheckUtils]: 32: Hoare triple {338595#false} assume !false; {338595#false} is VALID [2022-04-28 08:18:48,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:18:48,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:18:48,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347469249] [2022-04-28 08:18:48,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347469249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:48,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:48,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:48,427 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:18:48,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [763549439] [2022-04-28 08:18:48,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [763549439] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:48,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:48,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:48,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698530557] [2022-04-28 08:18:48,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:18:48,428 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-28 08:18:48,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:18:48,428 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-28 08:18:48,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:48,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:18:48,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:48,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:18:48,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:18:48,448 INFO L87 Difference]: Start difference. First operand 10377 states and 15623 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-28 08:18:59,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:59,922 INFO L93 Difference]: Finished difference Result 15565 states and 23369 transitions. [2022-04-28 08:18:59,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:18:59,923 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-28 08:18:59,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:18:59,923 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-28 08:18:59,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 238 transitions. [2022-04-28 08:18:59,924 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-28 08:18:59,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 238 transitions. [2022-04-28 08:18:59,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 238 transitions. [2022-04-28 08:19:00,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 238 edges. 238 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:04,421 INFO L225 Difference]: With dead ends: 15565 [2022-04-28 08:19:04,421 INFO L226 Difference]: Without dead ends: 10507 [2022-04-28 08:19:04,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:19:04,430 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 176 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:04,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 132 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:04,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10507 states. [2022-04-28 08:19:05,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10507 to 10505. [2022-04-28 08:19:05,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:05,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10507 states. Second operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:05,249 INFO L74 IsIncluded]: Start isIncluded. First operand 10507 states. Second operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:05,260 INFO L87 Difference]: Start difference. First operand 10507 states. Second operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:08,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:08,150 INFO L93 Difference]: Finished difference Result 10507 states and 15624 transitions. [2022-04-28 08:19:08,150 INFO L276 IsEmpty]: Start isEmpty. Operand 10507 states and 15624 transitions. [2022-04-28 08:19:08,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:08,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:08,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 10507 states. [2022-04-28 08:19:08,182 INFO L87 Difference]: Start difference. First operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 10507 states. [2022-04-28 08:19:10,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:10,722 INFO L93 Difference]: Finished difference Result 10507 states and 15624 transitions. [2022-04-28 08:19:10,722 INFO L276 IsEmpty]: Start isEmpty. Operand 10507 states and 15624 transitions. [2022-04-28 08:19:10,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:10,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:10,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:10,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:10,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:15,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10505 states to 10505 states and 15623 transitions. [2022-04-28 08:19:15,259 INFO L78 Accepts]: Start accepts. Automaton has 10505 states and 15623 transitions. Word has length 33 [2022-04-28 08:19:15,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:15,259 INFO L495 AbstractCegarLoop]: Abstraction has 10505 states and 15623 transitions. [2022-04-28 08:19:15,259 INFO L496 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-28 08:19:15,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10505 states and 15623 transitions. [2022-04-28 08:19:31,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15623 edges. 15623 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:31,569 INFO L276 IsEmpty]: Start isEmpty. Operand 10505 states and 15623 transitions. [2022-04-28 08:19:31,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 08:19:31,574 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:31,574 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:19:31,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 08:19:31,574 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:31,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:31,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1834987539, now seen corresponding path program 1 times [2022-04-28 08:19:31,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:31,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1269480563] [2022-04-28 08:19:31,575 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:31,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1834987539, now seen corresponding path program 2 times [2022-04-28 08:19:31,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:31,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196837773] [2022-04-28 08:19:31,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:31,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:31,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:31,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {411766#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {411760#true} is VALID [2022-04-28 08:19:31,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {411760#true} assume true; {411760#true} is VALID [2022-04-28 08:19:31,621 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {411760#true} {411760#true} #268#return; {411760#true} is VALID [2022-04-28 08:19:31,622 INFO L272 TraceCheckUtils]: 0: Hoare triple {411760#true} call ULTIMATE.init(); {411766#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:31,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {411766#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {411760#true} is VALID [2022-04-28 08:19:31,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {411760#true} assume true; {411760#true} is VALID [2022-04-28 08:19:31,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {411760#true} {411760#true} #268#return; {411760#true} is VALID [2022-04-28 08:19:31,622 INFO L272 TraceCheckUtils]: 4: Hoare triple {411760#true} call #t~ret19 := main(); {411760#true} is VALID [2022-04-28 08:19:31,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {411760#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;havoc ~cond~0; {411760#true} is VALID [2022-04-28 08:19:31,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {411760#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {411760#true} is VALID [2022-04-28 08:19:31,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {411760#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; {411760#true} is VALID [2022-04-28 08:19:31,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {411760#true} assume !(0 != ~p1~0); {411760#true} is VALID [2022-04-28 08:19:31,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {411760#true} assume !(0 != ~p2~0); {411760#true} is VALID [2022-04-28 08:19:31,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {411760#true} assume !(0 != ~p3~0); {411760#true} is VALID [2022-04-28 08:19:31,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {411760#true} assume !(0 != ~p4~0); {411760#true} is VALID [2022-04-28 08:19:31,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {411760#true} assume !(0 != ~p5~0); {411760#true} is VALID [2022-04-28 08:19:31,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {411760#true} assume !(0 != ~p6~0); {411760#true} is VALID [2022-04-28 08:19:31,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {411760#true} assume !(0 != ~p7~0); {411760#true} is VALID [2022-04-28 08:19:31,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {411760#true} assume !(0 != ~p8~0); {411760#true} is VALID [2022-04-28 08:19:31,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {411760#true} assume 0 != ~p9~0;~lk9~0 := 1; {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 08:19:31,623 INFO L290 TraceCheckUtils]: 17: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 08:19:31,624 INFO L290 TraceCheckUtils]: 18: Hoare triple {411765#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 08:19:31,624 INFO L290 TraceCheckUtils]: 19: Hoare triple {411765#(= main_~lk9~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 08:19:31,624 INFO L290 TraceCheckUtils]: 20: Hoare triple {411765#(= main_~lk9~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 08:19:31,624 INFO L290 TraceCheckUtils]: 21: Hoare triple {411765#(= main_~lk9~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 08:19:31,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 08:19:31,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 08:19:31,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 08:19:31,625 INFO L290 TraceCheckUtils]: 25: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 08:19:31,626 INFO L290 TraceCheckUtils]: 26: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 08:19:31,626 INFO L290 TraceCheckUtils]: 27: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 08:19:31,626 INFO L290 TraceCheckUtils]: 28: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 08:19:31,626 INFO L290 TraceCheckUtils]: 29: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 08:19:31,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {411765#(= main_~lk9~0 1)} assume 0 != ~p9~0; {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 08:19:31,627 INFO L290 TraceCheckUtils]: 31: Hoare triple {411765#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {411761#false} is VALID [2022-04-28 08:19:31,627 INFO L290 TraceCheckUtils]: 32: Hoare triple {411761#false} assume !false; {411761#false} is VALID [2022-04-28 08:19:31,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:19:31,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:31,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196837773] [2022-04-28 08:19:31,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196837773] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:31,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:31,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:31,628 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:31,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1269480563] [2022-04-28 08:19:31,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1269480563] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:31,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:31,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:31,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298896749] [2022-04-28 08:19:31,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:31,629 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-28 08:19:31,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:31,629 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-28 08:19:31,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:31,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:31,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:31,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:31,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:31,644 INFO L87 Difference]: Start difference. First operand 10505 states and 15623 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-28 08:19:47,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:47,727 INFO L93 Difference]: Finished difference Result 18445 states and 28041 transitions. [2022-04-28 08:19:47,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:47,728 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-28 08:19:47,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:47,728 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-28 08:19:47,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-28 08:19:47,729 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-28 08:19:47,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-28 08:19:47,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-28 08:19:47,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:01,694 INFO L225 Difference]: With dead ends: 18445 [2022-04-28 08:20:01,694 INFO L226 Difference]: Without dead ends: 18443 [2022-04-28 08:20:01,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:20:01,698 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 180 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:20:01,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 94 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:20:01,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18443 states. [2022-04-28 08:20:02,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18443 to 15369. [2022-04-28 08:20:02,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:20:02,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18443 states. Second operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:02,937 INFO L74 IsIncluded]: Start isIncluded. First operand 18443 states. Second operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:02,954 INFO L87 Difference]: Start difference. First operand 18443 states. Second operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:10,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:10,900 INFO L93 Difference]: Finished difference Result 18443 states and 27784 transitions. [2022-04-28 08:20:10,900 INFO L276 IsEmpty]: Start isEmpty. Operand 18443 states and 27784 transitions. [2022-04-28 08:20:10,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:10,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:10,925 INFO L74 IsIncluded]: Start isIncluded. First operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18443 states. [2022-04-28 08:20:10,937 INFO L87 Difference]: Start difference. First operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18443 states. [2022-04-28 08:20:19,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:19,571 INFO L93 Difference]: Finished difference Result 18443 states and 27784 transitions. [2022-04-28 08:20:19,571 INFO L276 IsEmpty]: Start isEmpty. Operand 18443 states and 27784 transitions. [2022-04-28 08:20:19,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:19,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:19,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:20:19,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:20:19,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:30,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15369 states to 15369 states and 22151 transitions. [2022-04-28 08:20:30,046 INFO L78 Accepts]: Start accepts. Automaton has 15369 states and 22151 transitions. Word has length 33 [2022-04-28 08:20:30,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:20:30,046 INFO L495 AbstractCegarLoop]: Abstraction has 15369 states and 22151 transitions. [2022-04-28 08:20:30,046 INFO L496 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-28 08:20:30,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15369 states and 22151 transitions. [2022-04-28 08:20:53,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22151 edges. 22151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:53,153 INFO L276 IsEmpty]: Start isEmpty. Operand 15369 states and 22151 transitions. [2022-04-28 08:20:53,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 08:20:53,162 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:20:53,162 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:20:53,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 08:20:53,163 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:20:53,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:20:53,163 INFO L85 PathProgramCache]: Analyzing trace with hash 871631855, now seen corresponding path program 1 times [2022-04-28 08:20:53,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:53,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [480725963] [2022-04-28 08:20:53,163 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:20:53,163 INFO L85 PathProgramCache]: Analyzing trace with hash 871631855, now seen corresponding path program 2 times [2022-04-28 08:20:53,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:20:53,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446622397] [2022-04-28 08:20:53,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:20:53,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:20:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:53,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:20:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:53,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {516292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {516286#true} is VALID [2022-04-28 08:20:53,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {516286#true} assume true; {516286#true} is VALID [2022-04-28 08:20:53,201 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {516286#true} {516286#true} #268#return; {516286#true} is VALID [2022-04-28 08:20:53,202 INFO L272 TraceCheckUtils]: 0: Hoare triple {516286#true} call ULTIMATE.init(); {516292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:20:53,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {516292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {516286#true} is VALID [2022-04-28 08:20:53,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {516286#true} assume true; {516286#true} is VALID [2022-04-28 08:20:53,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {516286#true} {516286#true} #268#return; {516286#true} is VALID [2022-04-28 08:20:53,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {516286#true} call #t~ret19 := main(); {516286#true} is VALID [2022-04-28 08:20:53,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {516286#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;havoc ~cond~0; {516286#true} is VALID [2022-04-28 08:20:53,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {516286#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {516286#true} is VALID [2022-04-28 08:20:53,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {516286#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; {516286#true} is VALID [2022-04-28 08:20:53,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {516286#true} assume !(0 != ~p1~0); {516286#true} is VALID [2022-04-28 08:20:53,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {516286#true} assume !(0 != ~p2~0); {516286#true} is VALID [2022-04-28 08:20:53,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {516286#true} assume !(0 != ~p3~0); {516286#true} is VALID [2022-04-28 08:20:53,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {516286#true} assume !(0 != ~p4~0); {516286#true} is VALID [2022-04-28 08:20:53,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {516286#true} assume !(0 != ~p5~0); {516286#true} is VALID [2022-04-28 08:20:53,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {516286#true} assume !(0 != ~p6~0); {516286#true} is VALID [2022-04-28 08:20:53,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {516286#true} assume !(0 != ~p7~0); {516286#true} is VALID [2022-04-28 08:20:53,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {516286#true} assume !(0 != ~p8~0); {516286#true} is VALID [2022-04-28 08:20:53,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {516286#true} assume !(0 != ~p9~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:53,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p10~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:53,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {516291#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {516291#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:53,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {516291#(= main_~p9~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {516291#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:53,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {516291#(= main_~p9~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {516291#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:53,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {516291#(= main_~p9~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {516291#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:53,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p1~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:53,205 INFO L290 TraceCheckUtils]: 23: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p2~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:53,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p3~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:53,205 INFO L290 TraceCheckUtils]: 25: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p4~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:53,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p5~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:53,206 INFO L290 TraceCheckUtils]: 27: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p6~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:53,206 INFO L290 TraceCheckUtils]: 28: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p7~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:53,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p8~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:53,206 INFO L290 TraceCheckUtils]: 30: Hoare triple {516291#(= main_~p9~0 0)} assume 0 != ~p9~0; {516287#false} is VALID [2022-04-28 08:20:53,206 INFO L290 TraceCheckUtils]: 31: Hoare triple {516287#false} assume 1 != ~lk9~0; {516287#false} is VALID [2022-04-28 08:20:53,206 INFO L290 TraceCheckUtils]: 32: Hoare triple {516287#false} assume !false; {516287#false} is VALID [2022-04-28 08:20:53,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:20:53,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:20:53,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446622397] [2022-04-28 08:20:53,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446622397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:53,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:53,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:53,207 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:20:53,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [480725963] [2022-04-28 08:20:53,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [480725963] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:53,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:53,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:53,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77305050] [2022-04-28 08:20:53,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:20:53,208 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-28 08:20:53,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:20:53,208 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-28 08:20:53,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:53,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:20:53,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:53,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:20:53,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:20:53,225 INFO L87 Difference]: Start difference. First operand 15369 states and 22151 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-28 08:22:04,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:04,095 INFO L93 Difference]: Finished difference Result 35597 states and 51593 transitions. [2022-04-28 08:22:04,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:22:04,095 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-28 08:22:04,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:22:04,096 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-28 08:22:04,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2022-04-28 08:22:04,097 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-28 08:22:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2022-04-28 08:22:04,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 240 transitions. [2022-04-28 08:22:04,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:22:21,219 INFO L225 Difference]: With dead ends: 35597 [2022-04-28 08:22:21,219 INFO L226 Difference]: Without dead ends: 20491 [2022-04-28 08:22:21,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:22:21,236 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:22:21,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 143 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:22:21,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20491 states. [2022-04-28 08:22:22,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20491 to 20489. [2022-04-28 08:22:22,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:22:22,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20491 states. Second operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:22:22,992 INFO L74 IsIncluded]: Start isIncluded. First operand 20491 states. Second operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:22:23,014 INFO L87 Difference]: Start difference. First operand 20491 states. Second operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:22:33,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:33,750 INFO L93 Difference]: Finished difference Result 20491 states and 29448 transitions. [2022-04-28 08:22:33,750 INFO L276 IsEmpty]: Start isEmpty. Operand 20491 states and 29448 transitions. [2022-04-28 08:22:33,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:33,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:33,785 INFO L74 IsIncluded]: Start isIncluded. First operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20491 states. [2022-04-28 08:22:33,807 INFO L87 Difference]: Start difference. First operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20491 states. [2022-04-28 08:22:44,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:44,842 INFO L93 Difference]: Finished difference Result 20491 states and 29448 transitions. [2022-04-28 08:22:44,842 INFO L276 IsEmpty]: Start isEmpty. Operand 20491 states and 29448 transitions. [2022-04-28 08:22:44,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:44,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:44,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:22:44,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:22:44,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:23:02,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20489 states to 20489 states and 29447 transitions. [2022-04-28 08:23:02,717 INFO L78 Accepts]: Start accepts. Automaton has 20489 states and 29447 transitions. Word has length 33 [2022-04-28 08:23:02,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:23:02,717 INFO L495 AbstractCegarLoop]: Abstraction has 20489 states and 29447 transitions. [2022-04-28 08:23:02,717 INFO L496 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-28 08:23:02,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20489 states and 29447 transitions. [2022-04-28 08:23:34,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29447 edges. 29447 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:23:34,645 INFO L276 IsEmpty]: Start isEmpty. Operand 20489 states and 29447 transitions. [2022-04-28 08:23:34,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 08:23:34,656 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:23:34,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:23:34,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 08:23:34,656 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:23:34,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:23:34,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1049824046, now seen corresponding path program 1 times [2022-04-28 08:23:34,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:23:34,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1218827713] [2022-04-28 08:23:34,657 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:23:34,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1049824046, now seen corresponding path program 2 times [2022-04-28 08:23:34,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:23:34,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28230870] [2022-04-28 08:23:34,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:23:34,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:23:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:23:34,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:23:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:23:34,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {669458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {669452#true} is VALID [2022-04-28 08:23:34,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {669452#true} assume true; {669452#true} is VALID [2022-04-28 08:23:34,695 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {669452#true} {669452#true} #268#return; {669452#true} is VALID [2022-04-28 08:23:34,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {669452#true} call ULTIMATE.init(); {669458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:23:34,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {669458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {669452#true} is VALID [2022-04-28 08:23:34,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {669452#true} assume true; {669452#true} is VALID [2022-04-28 08:23:34,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {669452#true} {669452#true} #268#return; {669452#true} is VALID [2022-04-28 08:23:34,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {669452#true} call #t~ret19 := main(); {669452#true} is VALID [2022-04-28 08:23:34,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {669452#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;havoc ~cond~0; {669452#true} is VALID [2022-04-28 08:23:34,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {669452#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {669452#true} is VALID [2022-04-28 08:23:34,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {669452#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; {669452#true} is VALID [2022-04-28 08:23:34,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {669452#true} assume !(0 != ~p1~0); {669452#true} is VALID [2022-04-28 08:23:34,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {669452#true} assume !(0 != ~p2~0); {669452#true} is VALID [2022-04-28 08:23:34,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {669452#true} assume !(0 != ~p3~0); {669452#true} is VALID [2022-04-28 08:23:34,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {669452#true} assume !(0 != ~p4~0); {669452#true} is VALID [2022-04-28 08:23:34,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {669452#true} assume !(0 != ~p5~0); {669452#true} is VALID [2022-04-28 08:23:34,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {669452#true} assume !(0 != ~p6~0); {669452#true} is VALID [2022-04-28 08:23:34,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {669452#true} assume !(0 != ~p7~0); {669452#true} is VALID [2022-04-28 08:23:34,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {669452#true} assume !(0 != ~p8~0); {669452#true} is VALID [2022-04-28 08:23:34,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {669452#true} assume 0 != ~p9~0;~lk9~0 := 1; {669457#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:23:34,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:23:34,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {669457#(not (= main_~p9~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {669457#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:23:34,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {669457#(not (= main_~p9~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {669457#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:23:34,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {669457#(not (= main_~p9~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {669457#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:23:34,699 INFO L290 TraceCheckUtils]: 21: Hoare triple {669457#(not (= main_~p9~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {669457#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:23:34,699 INFO L290 TraceCheckUtils]: 22: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:23:34,699 INFO L290 TraceCheckUtils]: 23: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:23:34,699 INFO L290 TraceCheckUtils]: 24: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:23:34,700 INFO L290 TraceCheckUtils]: 25: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:23:34,700 INFO L290 TraceCheckUtils]: 26: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:23:34,700 INFO L290 TraceCheckUtils]: 27: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:23:34,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:23:34,701 INFO L290 TraceCheckUtils]: 29: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:23:34,701 INFO L290 TraceCheckUtils]: 30: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {669453#false} is VALID [2022-04-28 08:23:34,701 INFO L290 TraceCheckUtils]: 31: Hoare triple {669453#false} assume 0 != ~p10~0; {669453#false} is VALID [2022-04-28 08:23:34,701 INFO L290 TraceCheckUtils]: 32: Hoare triple {669453#false} assume 1 != ~lk10~0; {669453#false} is VALID [2022-04-28 08:23:34,701 INFO L290 TraceCheckUtils]: 33: Hoare triple {669453#false} assume !false; {669453#false} is VALID [2022-04-28 08:23:34,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:23:34,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:23:34,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28230870] [2022-04-28 08:23:34,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28230870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:23:34,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:23:34,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:23:34,702 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:23:34,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1218827713] [2022-04-28 08:23:34,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1218827713] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:23:34,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:23:34,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:23:34,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480046151] [2022-04-28 08:23:34,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:23:34,702 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-28 08:23:34,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:23:34,703 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-28 08:23:34,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-28 08:23:34,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:23:34,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:23:34,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:23:34,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:23:34,721 INFO L87 Difference]: Start difference. First operand 20489 states and 29447 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-28 08:24:23,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:24:23,911 INFO L93 Difference]: Finished difference Result 30733 states and 44041 transitions. [2022-04-28 08:24:23,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:24:23,911 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-28 08:24:23,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:24:23,911 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-28 08:24:23,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 235 transitions. [2022-04-28 08:24:23,912 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-28 08:24:23,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 235 transitions. [2022-04-28 08:24:23,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 235 transitions. [2022-04-28 08:24:24,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:24:41,409 INFO L225 Difference]: With dead ends: 30733 [2022-04-28 08:24:41,409 INFO L226 Difference]: Without dead ends: 20747 [2022-04-28 08:24:41,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:24:41,421 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 175 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:24:41,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 129 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:24:41,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20747 states. [2022-04-28 08:24:43,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20747 to 20745. [2022-04-28 08:24:43,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:24:43,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20747 states. Second operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:24:43,241 INFO L74 IsIncluded]: Start isIncluded. First operand 20747 states. Second operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:24:43,262 INFO L87 Difference]: Start difference. First operand 20747 states. Second operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:24:54,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:24:54,037 INFO L93 Difference]: Finished difference Result 20747 states and 29448 transitions. [2022-04-28 08:24:54,037 INFO L276 IsEmpty]: Start isEmpty. Operand 20747 states and 29448 transitions. [2022-04-28 08:24:54,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:24:54,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:24:54,070 INFO L74 IsIncluded]: Start isIncluded. First operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20747 states. [2022-04-28 08:24:54,088 INFO L87 Difference]: Start difference. First operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20747 states. [2022-04-28 08:25:04,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:25:04,728 INFO L93 Difference]: Finished difference Result 20747 states and 29448 transitions. [2022-04-28 08:25:04,728 INFO L276 IsEmpty]: Start isEmpty. Operand 20747 states and 29448 transitions. [2022-04-28 08:25:04,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:25:04,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:25:04,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:25:04,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:25:04,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:25:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20745 states to 20745 states and 29447 transitions. [2022-04-28 08:25:22,356 INFO L78 Accepts]: Start accepts. Automaton has 20745 states and 29447 transitions. Word has length 34 [2022-04-28 08:25:22,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:25:22,356 INFO L495 AbstractCegarLoop]: Abstraction has 20745 states and 29447 transitions. [2022-04-28 08:25:22,356 INFO L496 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-28 08:25:22,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20745 states and 29447 transitions. [2022-04-28 08:25:54,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29447 edges. 29447 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:25:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 20745 states and 29447 transitions. [2022-04-28 08:25:54,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 08:25:54,441 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:25:54,441 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:25:54,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 08:25:54,441 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:25:54,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:25:54,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1250998544, now seen corresponding path program 1 times [2022-04-28 08:25:54,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:25:54,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1408371125] [2022-04-28 08:25:54,442 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:25:54,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1250998544, now seen corresponding path program 2 times [2022-04-28 08:25:54,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:25:54,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290805870] [2022-04-28 08:25:54,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:25:54,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:25:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:25:54,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:25:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:25:54,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {813920#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {813914#true} is VALID [2022-04-28 08:25:54,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {813914#true} assume true; {813914#true} is VALID [2022-04-28 08:25:54,481 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {813914#true} {813914#true} #268#return; {813914#true} is VALID [2022-04-28 08:25:54,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {813914#true} call ULTIMATE.init(); {813920#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:25:54,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {813920#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {813914#true} is VALID [2022-04-28 08:25:54,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {813914#true} assume true; {813914#true} is VALID [2022-04-28 08:25:54,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {813914#true} {813914#true} #268#return; {813914#true} is VALID [2022-04-28 08:25:54,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {813914#true} call #t~ret19 := main(); {813914#true} is VALID [2022-04-28 08:25:54,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {813914#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;havoc ~cond~0; {813914#true} is VALID [2022-04-28 08:25:54,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {813914#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {813914#true} is VALID [2022-04-28 08:25:54,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {813914#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; {813914#true} is VALID [2022-04-28 08:25:54,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {813914#true} assume !(0 != ~p1~0); {813914#true} is VALID [2022-04-28 08:25:54,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {813914#true} assume !(0 != ~p2~0); {813914#true} is VALID [2022-04-28 08:25:54,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {813914#true} assume !(0 != ~p3~0); {813914#true} is VALID [2022-04-28 08:25:54,482 INFO L290 TraceCheckUtils]: 11: Hoare triple {813914#true} assume !(0 != ~p4~0); {813914#true} is VALID [2022-04-28 08:25:54,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {813914#true} assume !(0 != ~p5~0); {813914#true} is VALID [2022-04-28 08:25:54,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {813914#true} assume !(0 != ~p6~0); {813914#true} is VALID [2022-04-28 08:25:54,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {813914#true} assume !(0 != ~p7~0); {813914#true} is VALID [2022-04-28 08:25:54,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {813914#true} assume !(0 != ~p8~0); {813914#true} is VALID [2022-04-28 08:25:54,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {813914#true} assume !(0 != ~p9~0); {813914#true} is VALID [2022-04-28 08:25:54,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {813914#true} assume !(0 != ~p10~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-28 08:25:54,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {813919#(= main_~p10~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {813919#(= main_~p10~0 0)} is VALID [2022-04-28 08:25:54,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {813919#(= main_~p10~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {813919#(= main_~p10~0 0)} is VALID [2022-04-28 08:25:54,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {813919#(= main_~p10~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {813919#(= main_~p10~0 0)} is VALID [2022-04-28 08:25:54,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {813919#(= main_~p10~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {813919#(= main_~p10~0 0)} is VALID [2022-04-28 08:25:54,484 INFO L290 TraceCheckUtils]: 22: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p1~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-28 08:25:54,484 INFO L290 TraceCheckUtils]: 23: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p2~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-28 08:25:54,485 INFO L290 TraceCheckUtils]: 24: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p3~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-28 08:25:54,485 INFO L290 TraceCheckUtils]: 25: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p4~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-28 08:25:54,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p5~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-28 08:25:54,486 INFO L290 TraceCheckUtils]: 27: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p6~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-28 08:25:54,486 INFO L290 TraceCheckUtils]: 28: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p7~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-28 08:25:54,487 INFO L290 TraceCheckUtils]: 29: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p8~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-28 08:25:54,487 INFO L290 TraceCheckUtils]: 30: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p9~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-28 08:25:54,487 INFO L290 TraceCheckUtils]: 31: Hoare triple {813919#(= main_~p10~0 0)} assume 0 != ~p10~0; {813915#false} is VALID [2022-04-28 08:25:54,487 INFO L290 TraceCheckUtils]: 32: Hoare triple {813915#false} assume 1 != ~lk10~0; {813915#false} is VALID [2022-04-28 08:25:54,487 INFO L290 TraceCheckUtils]: 33: Hoare triple {813915#false} assume !false; {813915#false} is VALID [2022-04-28 08:25:54,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:25:54,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:25:54,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290805870] [2022-04-28 08:25:54,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290805870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:25:54,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:25:54,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:25:54,488 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:25:54,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1408371125] [2022-04-28 08:25:54,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1408371125] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:25:54,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:25:54,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:25:54,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770718256] [2022-04-28 08:25:54,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:25:54,489 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-28 08:25:54,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:25:54,489 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-28 08:25:54,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:25:54,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:25:54,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:25:54,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:25:54,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:25:54,509 INFO L87 Difference]: Start difference. First operand 20745 states and 29447 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)