/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_15-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 08:17:56,900 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:17:56,913 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:17:56,960 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:17:56,961 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:17:56,962 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:17:56,965 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:17:56,969 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:17:56,971 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:17:56,975 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:17:56,976 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:17:56,977 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:17:56,977 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:17:56,979 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:17:56,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:17:56,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:17:56,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:17:56,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:17:56,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:17:56,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:17:56,992 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:17:56,993 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:17:56,994 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:17:56,995 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:17:56,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:17:57,002 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:17:57,002 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:17:57,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:17:57,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:17:57,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:17:57,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:17:57,005 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:17:57,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:17:57,007 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:17:57,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:17:57,008 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:17:57,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:17:57,009 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:17:57,009 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:17:57,009 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:17:57,010 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:17:57,011 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:17:57,012 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:17:57,021 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:17:57,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:17:57,022 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:17:57,022 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:17:57,022 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:17:57,022 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:17:57,023 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:17:57,023 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:17:57,023 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:17:57,024 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:17:57,024 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:17:57,024 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:17:57,024 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:17:57,024 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:17:57,024 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:17:57,024 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:17:57,025 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:17:57,025 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:17:57,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:17:57,025 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:17:57,025 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:17:57,025 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:17:57,025 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:17:57,026 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:17:57,026 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:17:57,026 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:17:57,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:17:57,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:17:57,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:17:57,255 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:17:57,256 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:17:57,257 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_15-2.c [2022-04-28 08:17:57,318 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c8e4e218/90ca434b52254d0b8597b2d7bbedee98/FLAG47e0c75c9 [2022-04-28 08:17:57,697 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:17:57,697 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-2.c [2022-04-28 08:17:57,704 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c8e4e218/90ca434b52254d0b8597b2d7bbedee98/FLAG47e0c75c9 [2022-04-28 08:17:58,123 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c8e4e218/90ca434b52254d0b8597b2d7bbedee98 [2022-04-28 08:17:58,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:17:58,126 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:17:58,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:17:58,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:17:58,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:17:58,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:17:58" (1/1) ... [2022-04-28 08:17:58,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10a83302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:17:58, skipping insertion in model container [2022-04-28 08:17:58,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:17:58" (1/1) ... [2022-04-28 08:17:58,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:17:58,169 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:17:58,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-2.c[5628,5641] [2022-04-28 08:17:58,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:17:58,320 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:17:58,347 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-2.c[5628,5641] [2022-04-28 08:17:58,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:17:58,373 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:17:58,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:17:58 WrapperNode [2022-04-28 08:17:58,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:17:58,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:17:58,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:17:58,374 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:17:58,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:17:58" (1/1) ... [2022-04-28 08:17:58,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:17:58" (1/1) ... [2022-04-28 08:17:58,405 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:17:58" (1/1) ... [2022-04-28 08:17:58,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:17:58" (1/1) ... [2022-04-28 08:17:58,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:17:58" (1/1) ... [2022-04-28 08:17:58,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:17:58" (1/1) ... [2022-04-28 08:17:58,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:17:58" (1/1) ... [2022-04-28 08:17:58,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:17:58,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:17:58,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:17:58,429 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:17:58,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:17:58" (1/1) ... [2022-04-28 08:17:58,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:17:58,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:17:58,473 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:17:58,494 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:17:58,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:17:58,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:17:58,516 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:17:58,516 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:17:58,516 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:17:58,516 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:17:58,516 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:17:58,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:17:58,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:17:58,517 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:17:58,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:17:58,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:17:58,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:17:58,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:17:58,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:17:58,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:17:58,591 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:17:58,592 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:17:58,894 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:17:58,901 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:17:58,902 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 08:17:58,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:17:58 BoogieIcfgContainer [2022-04-28 08:17:58,903 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:17:58,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:17:58,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:17:58,909 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:17:58,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:17:58" (1/3) ... [2022-04-28 08:17:58,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37edb03f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:17:58, skipping insertion in model container [2022-04-28 08:17:58,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:17:58" (2/3) ... [2022-04-28 08:17:58,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37edb03f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:17:58, skipping insertion in model container [2022-04-28 08:17:58,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:17:58" (3/3) ... [2022-04-28 08:17:58,912 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.c [2022-04-28 08:17:58,922 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:17:58,923 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:17:58,958 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:17:58,963 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@177f4545, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@e200d63 [2022-04-28 08:17:58,963 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:17:58,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 08:17:58,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 08:17:58,977 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:17:58,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] [2022-04-28 08:17:58,978 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:17:58,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:17:58,982 INFO L85 PathProgramCache]: Analyzing trace with hash 208658311, now seen corresponding path program 1 times [2022-04-28 08:17:58,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:58,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1338456180] [2022-04-28 08:17:58,997 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:17:58,998 INFO L85 PathProgramCache]: Analyzing trace with hash 208658311, now seen corresponding path program 2 times [2022-04-28 08:17:59,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:17:59,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88752209] [2022-04-28 08:17:59,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:17:59,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:17:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:59,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:17:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:59,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {69#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {63#true} is VALID [2022-04-28 08:17:59,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#true} assume true; {63#true} is VALID [2022-04-28 08:17:59,249 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63#true} {63#true} #285#return; {63#true} is VALID [2022-04-28 08:17:59,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {63#true} call ULTIMATE.init(); {69#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:17:59,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {69#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {63#true} is VALID [2022-04-28 08:17:59,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {63#true} assume true; {63#true} is VALID [2022-04-28 08:17:59,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63#true} {63#true} #285#return; {63#true} is VALID [2022-04-28 08:17:59,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {63#true} call #t~ret20 := main(); {63#true} is VALID [2022-04-28 08:17:59,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {63#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {63#true} is VALID [2022-04-28 08:17:59,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {63#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {63#true} is VALID [2022-04-28 08:17:59,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {63#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {63#true} is VALID [2022-04-28 08:17:59,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {63#true} assume 0 != ~p1~0;~lk1~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:59,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {68#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:59,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:59,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:59,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:59,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:59,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:59,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:59,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:59,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {68#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:59,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:59,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:59,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:59,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:59,274 INFO L290 TraceCheckUtils]: 22: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:59,274 INFO L290 TraceCheckUtils]: 23: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p1~0; {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:59,275 INFO L290 TraceCheckUtils]: 24: Hoare triple {68#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {64#false} is VALID [2022-04-28 08:17:59,275 INFO L290 TraceCheckUtils]: 25: Hoare triple {64#false} assume !false; {64#false} is VALID [2022-04-28 08:17:59,276 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:59,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:17:59,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88752209] [2022-04-28 08:17:59,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88752209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:59,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:59,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:59,280 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:17:59,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1338456180] [2022-04-28 08:17:59,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1338456180] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:59,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:59,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:59,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637156924] [2022-04-28 08:17:59,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:17:59,286 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:17:59,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:17:59,290 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:17:59,325 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:17:59,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:17:59,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:59,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:17:59,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:17:59,350 INFO L87 Difference]: Start difference. First operand has 60 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:59,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:59,817 INFO L93 Difference]: Finished difference Result 118 states and 211 transitions. [2022-04-28 08:17:59,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:17:59,818 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:17:59,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:17:59,819 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:17:59,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-28 08:17:59,830 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:17:59,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-28 08:17:59,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 211 transitions. [2022-04-28 08:18:00,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:00,041 INFO L225 Difference]: With dead ends: 118 [2022-04-28 08:18:00,042 INFO L226 Difference]: Without dead ends: 103 [2022-04-28 08:18:00,045 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:00,051 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 259 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:18:00,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 119 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:18:00,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-28 08:18:00,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2022-04-28 08:18:00,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:18:00,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:00,104 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:00,104 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:00,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:00,111 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2022-04-28 08:18:00,111 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 189 transitions. [2022-04-28 08:18:00,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:00,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:00,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 103 states. [2022-04-28 08:18:00,113 INFO L87 Difference]: Start difference. First operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 103 states. [2022-04-28 08:18:00,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:00,130 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2022-04-28 08:18:00,130 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 189 transitions. [2022-04-28 08:18:00,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:00,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:00,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:18:00,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:18:00,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:00,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 130 transitions. [2022-04-28 08:18:00,136 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 130 transitions. Word has length 26 [2022-04-28 08:18:00,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:18:00,137 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 130 transitions. [2022-04-28 08:18:00,137 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:18:00,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 130 transitions. [2022-04-28 08:18:00,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:00,282 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 130 transitions. [2022-04-28 08:18:00,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 08:18:00,283 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:18:00,283 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:18:00,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:18:00,284 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:18:00,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:18:00,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1785486395, now seen corresponding path program 1 times [2022-04-28 08:18:00,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:00,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2086218941] [2022-04-28 08:18:00,292 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:18:00,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1785486395, now seen corresponding path program 2 times [2022-04-28 08:18:00,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:18:00,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404985180] [2022-04-28 08:18:00,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:18:00,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:18:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:00,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:18:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:00,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {659#true} is VALID [2022-04-28 08:18:00,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-28 08:18:00,386 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {659#true} {659#true} #285#return; {659#true} is VALID [2022-04-28 08:18:00,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:18:00,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {659#true} is VALID [2022-04-28 08:18:00,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-28 08:18:00,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #285#return; {659#true} is VALID [2022-04-28 08:18:00,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret20 := main(); {659#true} is VALID [2022-04-28 08:18:00,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {659#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {659#true} is VALID [2022-04-28 08:18:00,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {659#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {659#true} is VALID [2022-04-28 08:18:00,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {659#true} is VALID [2022-04-28 08:18:00,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#true} assume !(0 != ~p1~0); {664#(= main_~p1~0 0)} is VALID [2022-04-28 08:18:00,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {664#(= main_~p1~0 0)} assume !(0 != ~p2~0); {664#(= main_~p1~0 0)} is VALID [2022-04-28 08:18:00,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-28 08:18:00,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-28 08:18:00,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-28 08:18:00,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-28 08:18:00,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-28 08:18:00,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-28 08:18:00,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-28 08:18:00,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {664#(= main_~p1~0 0)} assume !(0 != ~p10~0); {664#(= main_~p1~0 0)} is VALID [2022-04-28 08:18:00,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-28 08:18:00,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-28 08:18:00,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-28 08:18:00,394 INFO L290 TraceCheckUtils]: 21: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-28 08:18:00,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-28 08:18:00,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p1~0; {660#false} is VALID [2022-04-28 08:18:00,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {660#false} assume 1 != ~lk1~0; {660#false} is VALID [2022-04-28 08:18:00,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-04-28 08:18:00,396 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:00,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:18:00,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404985180] [2022-04-28 08:18:00,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404985180] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:00,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:00,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:00,397 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:18:00,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2086218941] [2022-04-28 08:18:00,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2086218941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:00,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:00,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:00,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948045686] [2022-04-28 08:18:00,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:18:00,399 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:18:00,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:18:00,399 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:18:00,418 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:18:00,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:18:00,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:00,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:18:00,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:18:00,420 INFO L87 Difference]: Start difference. First operand 71 states and 130 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:00,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:00,729 INFO L93 Difference]: Finished difference Result 168 states and 313 transitions. [2022-04-28 08:18:00,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:18:00,729 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:18:00,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:18:00,730 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:18:00,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2022-04-28 08:18:00,736 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:18:00,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2022-04-28 08:18:00,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 282 transitions. [2022-04-28 08:18:00,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:00,969 INFO L225 Difference]: With dead ends: 168 [2022-04-28 08:18:00,969 INFO L226 Difference]: Without dead ends: 103 [2022-04-28 08:18:00,970 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:00,974 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 223 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:18:00,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 135 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:18:00,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-28 08:18:00,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2022-04-28 08:18:00,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:18:00,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:00,995 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:00,996 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:01,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:01,000 INFO L93 Difference]: Finished difference Result 103 states and 187 transitions. [2022-04-28 08:18:01,000 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2022-04-28 08:18:01,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:01,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:01,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 103 states. [2022-04-28 08:18:01,002 INFO L87 Difference]: Start difference. First operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 103 states. [2022-04-28 08:18:01,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:01,006 INFO L93 Difference]: Finished difference Result 103 states and 187 transitions. [2022-04-28 08:18:01,006 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2022-04-28 08:18:01,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:01,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:01,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:18:01,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:18:01,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:01,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 186 transitions. [2022-04-28 08:18:01,012 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 186 transitions. Word has length 26 [2022-04-28 08:18:01,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:18:01,012 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 186 transitions. [2022-04-28 08:18:01,012 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:18:01,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 186 transitions. [2022-04-28 08:18:01,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:01,192 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 186 transitions. [2022-04-28 08:18:01,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 08:18:01,192 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:18:01,193 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:18:01,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:18:01,193 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:18:01,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:18:01,194 INFO L85 PathProgramCache]: Analyzing trace with hash -2121315188, now seen corresponding path program 1 times [2022-04-28 08:18:01,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:01,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1617692028] [2022-04-28 08:18:01,195 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:18:01,195 INFO L85 PathProgramCache]: Analyzing trace with hash -2121315188, now seen corresponding path program 2 times [2022-04-28 08:18:01,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:18:01,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544712948] [2022-04-28 08:18:01,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:18:01,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:18:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:01,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:18:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:01,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {1421#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1415#true} is VALID [2022-04-28 08:18:01,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {1415#true} assume true; {1415#true} is VALID [2022-04-28 08:18:01,258 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1415#true} {1415#true} #285#return; {1415#true} is VALID [2022-04-28 08:18:01,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {1415#true} call ULTIMATE.init(); {1421#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:18:01,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {1421#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1415#true} is VALID [2022-04-28 08:18:01,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {1415#true} assume true; {1415#true} is VALID [2022-04-28 08:18:01,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1415#true} {1415#true} #285#return; {1415#true} is VALID [2022-04-28 08:18:01,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {1415#true} call #t~ret20 := main(); {1415#true} is VALID [2022-04-28 08:18:01,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {1415#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {1415#true} is VALID [2022-04-28 08:18:01,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {1415#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {1415#true} is VALID [2022-04-28 08:18:01,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {1415#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {1415#true} is VALID [2022-04-28 08:18:01,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {1415#true} assume 0 != ~p1~0;~lk1~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:18:01,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {1420#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {1420#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:18:01,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:18:01,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:18:01,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:18:01,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:18:01,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:18:01,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:18:01,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:18:01,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {1420#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {1420#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:18:01,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:18:01,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:18:01,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:18:01,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:18:01,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:18:01,267 INFO L290 TraceCheckUtils]: 23: Hoare triple {1420#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1416#false} is VALID [2022-04-28 08:18:01,267 INFO L290 TraceCheckUtils]: 24: Hoare triple {1416#false} assume 0 != ~p2~0; {1416#false} is VALID [2022-04-28 08:18:01,267 INFO L290 TraceCheckUtils]: 25: Hoare triple {1416#false} assume 1 != ~lk2~0; {1416#false} is VALID [2022-04-28 08:18:01,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {1416#false} assume !false; {1416#false} is VALID [2022-04-28 08:18:01,268 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:01,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:18:01,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544712948] [2022-04-28 08:18:01,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544712948] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:01,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:01,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:01,269 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:18:01,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1617692028] [2022-04-28 08:18:01,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1617692028] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:01,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:01,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:01,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407509880] [2022-04-28 08:18:01,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:18:01,270 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:18:01,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:18:01,271 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:18:01,290 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:18:01,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:18:01,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:01,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:18:01,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:18:01,292 INFO L87 Difference]: Start difference. First operand 101 states and 186 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:01,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:01,581 INFO L93 Difference]: Finished difference Result 154 states and 280 transitions. [2022-04-28 08:18:01,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:18:01,581 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:18:01,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:18:01,582 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:18:01,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 277 transitions. [2022-04-28 08:18:01,586 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:18:01,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 277 transitions. [2022-04-28 08:18:01,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 277 transitions. [2022-04-28 08:18:01,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:01,816 INFO L225 Difference]: With dead ends: 154 [2022-04-28 08:18:01,816 INFO L226 Difference]: Without dead ends: 106 [2022-04-28 08:18:01,816 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:01,817 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 196 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:18:01,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 163 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:18:01,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-28 08:18:01,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2022-04-28 08:18:01,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:18:01,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:01,844 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:01,845 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:01,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:01,850 INFO L93 Difference]: Finished difference Result 106 states and 189 transitions. [2022-04-28 08:18:01,850 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 189 transitions. [2022-04-28 08:18:01,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:01,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:01,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-28 08:18:01,853 INFO L87 Difference]: Start difference. First operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-28 08:18:01,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:01,857 INFO L93 Difference]: Finished difference Result 106 states and 189 transitions. [2022-04-28 08:18:01,857 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 189 transitions. [2022-04-28 08:18:01,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:01,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:01,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:18:01,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:18:01,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:01,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 188 transitions. [2022-04-28 08:18:01,863 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 188 transitions. Word has length 27 [2022-04-28 08:18:01,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:18:01,865 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 188 transitions. [2022-04-28 08:18:01,865 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:18:01,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 188 transitions. [2022-04-28 08:18:02,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:02,022 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 188 transitions. [2022-04-28 08:18:02,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 08:18:02,023 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:18:02,023 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:18:02,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 08:18:02,023 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:18:02,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:18:02,024 INFO L85 PathProgramCache]: Analyzing trace with hash 484708366, now seen corresponding path program 1 times [2022-04-28 08:18:02,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:02,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [66271838] [2022-04-28 08:18:02,027 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:18:02,027 INFO L85 PathProgramCache]: Analyzing trace with hash 484708366, now seen corresponding path program 2 times [2022-04-28 08:18:02,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:18:02,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002488734] [2022-04-28 08:18:02,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:18:02,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:18:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:02,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:18:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:02,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {2161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-28 08:18:02,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-28 08:18:02,137 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2155#true} {2155#true} #285#return; {2155#true} is VALID [2022-04-28 08:18:02,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:18:02,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {2161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-28 08:18:02,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-28 08:18:02,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #285#return; {2155#true} is VALID [2022-04-28 08:18:02,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret20 := main(); {2155#true} is VALID [2022-04-28 08:18:02,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {2155#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {2155#true} is VALID [2022-04-28 08:18:02,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {2155#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {2155#true} is VALID [2022-04-28 08:18:02,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {2155#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {2155#true} is VALID [2022-04-28 08:18:02,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {2155#true} assume !(0 != ~p1~0); {2155#true} is VALID [2022-04-28 08:18:02,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {2155#true} assume !(0 != ~p2~0); {2160#(= main_~p2~0 0)} is VALID [2022-04-28 08:18:02,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-28 08:18:02,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-28 08:18:02,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-28 08:18:02,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-28 08:18:02,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-28 08:18:02,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-28 08:18:02,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-28 08:18:02,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {2160#(= main_~p2~0 0)} assume !(0 != ~p10~0); {2160#(= main_~p2~0 0)} is VALID [2022-04-28 08:18:02,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-28 08:18:02,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-28 08:18:02,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-28 08:18:02,146 INFO L290 TraceCheckUtils]: 21: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-28 08:18:02,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-28 08:18:02,148 INFO L290 TraceCheckUtils]: 23: Hoare triple {2160#(= main_~p2~0 0)} assume !(0 != ~p1~0); {2160#(= main_~p2~0 0)} is VALID [2022-04-28 08:18:02,148 INFO L290 TraceCheckUtils]: 24: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p2~0; {2156#false} is VALID [2022-04-28 08:18:02,149 INFO L290 TraceCheckUtils]: 25: Hoare triple {2156#false} assume 1 != ~lk2~0; {2156#false} is VALID [2022-04-28 08:18:02,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-28 08:18:02,150 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,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:18:02,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002488734] [2022-04-28 08:18:02,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002488734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:02,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:02,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:02,152 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:18:02,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [66271838] [2022-04-28 08:18:02,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [66271838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:02,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:02,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:02,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909948967] [2022-04-28 08:18:02,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:18:02,153 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:18:02,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:18:02,155 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:18:02,173 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:18:02,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:18:02,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:02,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:18:02,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:18:02,174 INFO L87 Difference]: Start difference. First operand 104 states and 188 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:02,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:02,429 INFO L93 Difference]: Finished difference Result 292 states and 540 transitions. [2022-04-28 08:18:02,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:18:02,429 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:18:02,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:18:02,430 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:18:02,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2022-04-28 08:18:02,434 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:18:02,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2022-04-28 08:18:02,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 280 transitions. [2022-04-28 08:18:02,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:02,660 INFO L225 Difference]: With dead ends: 292 [2022-04-28 08:18:02,660 INFO L226 Difference]: Without dead ends: 197 [2022-04-28 08:18:02,661 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:02,662 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 248 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:18:02,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 109 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:18:02,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-28 08:18:02,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2022-04-28 08:18:02,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:18:02,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:02,679 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:02,680 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:02,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:02,686 INFO L93 Difference]: Finished difference Result 197 states and 358 transitions. [2022-04-28 08:18:02,686 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 358 transitions. [2022-04-28 08:18:02,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:02,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:02,687 INFO L74 IsIncluded]: Start isIncluded. First operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 197 states. [2022-04-28 08:18:02,688 INFO L87 Difference]: Start difference. First operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 197 states. [2022-04-28 08:18:02,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:02,694 INFO L93 Difference]: Finished difference Result 197 states and 358 transitions. [2022-04-28 08:18:02,694 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 358 transitions. [2022-04-28 08:18:02,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:02,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:02,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:18:02,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:18:02,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:02,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 357 transitions. [2022-04-28 08:18:02,702 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 357 transitions. Word has length 27 [2022-04-28 08:18:02,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:18:02,702 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 357 transitions. [2022-04-28 08:18:02,703 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:18:02,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 195 states and 357 transitions. [2022-04-28 08:18:03,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 357 edges. 357 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:03,055 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 357 transitions. [2022-04-28 08:18:03,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 08:18:03,056 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:18:03,056 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:18:03,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 08:18:03,056 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:18:03,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:18:03,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1816114224, now seen corresponding path program 1 times [2022-04-28 08:18:03,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:03,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [474275115] [2022-04-28 08:18:03,057 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:18:03,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1816114224, now seen corresponding path program 2 times [2022-04-28 08:18:03,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:18:03,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062506362] [2022-04-28 08:18:03,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:18:03,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:18:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:03,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:18:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:03,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {3541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3535#true} is VALID [2022-04-28 08:18:03,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {3535#true} assume true; {3535#true} is VALID [2022-04-28 08:18:03,144 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3535#true} {3535#true} #285#return; {3535#true} is VALID [2022-04-28 08:18:03,145 INFO L272 TraceCheckUtils]: 0: Hoare triple {3535#true} call ULTIMATE.init(); {3541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:18:03,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {3541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3535#true} is VALID [2022-04-28 08:18:03,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {3535#true} assume true; {3535#true} is VALID [2022-04-28 08:18:03,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3535#true} {3535#true} #285#return; {3535#true} is VALID [2022-04-28 08:18:03,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {3535#true} call #t~ret20 := main(); {3535#true} is VALID [2022-04-28 08:18:03,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {3535#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {3535#true} is VALID [2022-04-28 08:18:03,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {3535#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {3535#true} is VALID [2022-04-28 08:18:03,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {3535#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {3535#true} is VALID [2022-04-28 08:18:03,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {3535#true} assume !(0 != ~p1~0); {3535#true} is VALID [2022-04-28 08:18:03,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {3535#true} assume 0 != ~p2~0;~lk2~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-28 08:18:03,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-28 08:18:03,153 INFO L290 TraceCheckUtils]: 11: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-28 08:18:03,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-28 08:18:03,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-28 08:18:03,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-28 08:18:03,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-28 08:18:03,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-28 08:18:03,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {3540#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {3540#(= main_~lk2~0 1)} is VALID [2022-04-28 08:18:03,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-28 08:18:03,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-28 08:18:03,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-28 08:18:03,157 INFO L290 TraceCheckUtils]: 21: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-28 08:18:03,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-28 08:18:03,158 INFO L290 TraceCheckUtils]: 23: Hoare triple {3540#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {3540#(= main_~lk2~0 1)} is VALID [2022-04-28 08:18:03,158 INFO L290 TraceCheckUtils]: 24: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p2~0; {3540#(= main_~lk2~0 1)} is VALID [2022-04-28 08:18:03,159 INFO L290 TraceCheckUtils]: 25: Hoare triple {3540#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {3536#false} is VALID [2022-04-28 08:18:03,159 INFO L290 TraceCheckUtils]: 26: Hoare triple {3536#false} assume !false; {3536#false} is VALID [2022-04-28 08:18:03,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:18:03,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:18:03,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062506362] [2022-04-28 08:18:03,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062506362] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:03,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:03,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:03,160 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:18:03,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [474275115] [2022-04-28 08:18:03,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [474275115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:03,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:03,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:03,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075085161] [2022-04-28 08:18:03,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:18:03,161 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:18:03,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:18:03,162 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:18:03,179 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:18:03,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:18:03,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:03,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:18:03,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:18:03,180 INFO L87 Difference]: Start difference. First operand 195 states and 357 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:03,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:03,451 INFO L93 Difference]: Finished difference Result 255 states and 467 transitions. [2022-04-28 08:18:03,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:18:03,451 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:18:03,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:18:03,451 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:18:03,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-28 08:18:03,454 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:18:03,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-28 08:18:03,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 184 transitions. [2022-04-28 08:18:03,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:03,604 INFO L225 Difference]: With dead ends: 255 [2022-04-28 08:18:03,605 INFO L226 Difference]: Without dead ends: 253 [2022-04-28 08:18:03,605 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:03,606 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 161 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:18:03,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 188 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:18:03,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-28 08:18:03,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 195. [2022-04-28 08:18:03,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:18:03,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:03,624 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:03,624 INFO L87 Difference]: Start difference. First operand 253 states. Second operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:03,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:03,632 INFO L93 Difference]: Finished difference Result 253 states and 464 transitions. [2022-04-28 08:18:03,632 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 464 transitions. [2022-04-28 08:18:03,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:03,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:03,634 INFO L74 IsIncluded]: Start isIncluded. First operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 253 states. [2022-04-28 08:18:03,634 INFO L87 Difference]: Start difference. First operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 253 states. [2022-04-28 08:18:03,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:03,641 INFO L93 Difference]: Finished difference Result 253 states and 464 transitions. [2022-04-28 08:18:03,642 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 464 transitions. [2022-04-28 08:18:03,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:03,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:03,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:18:03,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:18:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:03,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 355 transitions. [2022-04-28 08:18:03,648 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 355 transitions. Word has length 27 [2022-04-28 08:18:03,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:18:03,648 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 355 transitions. [2022-04-28 08:18:03,648 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:18:03,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 195 states and 355 transitions. [2022-04-28 08:18:03,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 355 edges. 355 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:03,977 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 355 transitions. [2022-04-28 08:18:03,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 08:18:03,977 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:18:03,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] [2022-04-28 08:18:03,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 08:18:03,978 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:18:03,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:18:03,978 INFO L85 PathProgramCache]: Analyzing trace with hash 2141269562, now seen corresponding path program 1 times [2022-04-28 08:18:03,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:03,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2041101106] [2022-04-28 08:18:03,979 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:18:03,979 INFO L85 PathProgramCache]: Analyzing trace with hash 2141269562, now seen corresponding path program 2 times [2022-04-28 08:18:03,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:18:03,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123375038] [2022-04-28 08:18:03,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:18:03,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:18:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:04,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:18:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:04,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {4959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4953#true} is VALID [2022-04-28 08:18:04,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {4953#true} assume true; {4953#true} is VALID [2022-04-28 08:18:04,028 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4953#true} {4953#true} #285#return; {4953#true} is VALID [2022-04-28 08:18:04,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {4953#true} call ULTIMATE.init(); {4959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:18:04,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {4959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4953#true} is VALID [2022-04-28 08:18:04,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {4953#true} assume true; {4953#true} is VALID [2022-04-28 08:18:04,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4953#true} {4953#true} #285#return; {4953#true} is VALID [2022-04-28 08:18:04,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {4953#true} call #t~ret20 := main(); {4953#true} is VALID [2022-04-28 08:18:04,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {4953#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {4953#true} is VALID [2022-04-28 08:18:04,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {4953#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {4953#true} is VALID [2022-04-28 08:18:04,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {4953#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {4953#true} is VALID [2022-04-28 08:18:04,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {4953#true} assume !(0 != ~p1~0); {4953#true} is VALID [2022-04-28 08:18:04,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {4953#true} assume !(0 != ~p2~0); {4953#true} is VALID [2022-04-28 08:18:04,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {4953#true} assume 0 != ~p3~0;~lk3~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-28 08:18:04,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-28 08:18:04,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-28 08:18:04,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-28 08:18:04,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-28 08:18:04,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-28 08:18:04,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-28 08:18:04,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {4958#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {4958#(= main_~lk3~0 1)} is VALID [2022-04-28 08:18:04,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-28 08:18:04,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-28 08:18:04,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-28 08:18:04,034 INFO L290 TraceCheckUtils]: 21: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-28 08:18:04,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-28 08:18:04,035 INFO L290 TraceCheckUtils]: 23: Hoare triple {4958#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {4958#(= main_~lk3~0 1)} is VALID [2022-04-28 08:18:04,041 INFO L290 TraceCheckUtils]: 24: Hoare triple {4958#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {4958#(= main_~lk3~0 1)} is VALID [2022-04-28 08:18:04,041 INFO L290 TraceCheckUtils]: 25: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p3~0; {4958#(= main_~lk3~0 1)} is VALID [2022-04-28 08:18:04,042 INFO L290 TraceCheckUtils]: 26: Hoare triple {4958#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {4954#false} is VALID [2022-04-28 08:18:04,042 INFO L290 TraceCheckUtils]: 27: Hoare triple {4954#false} assume !false; {4954#false} is VALID [2022-04-28 08:18:04,042 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:04,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:18:04,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123375038] [2022-04-28 08:18:04,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123375038] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:04,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:04,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:04,043 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:18:04,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2041101106] [2022-04-28 08:18:04,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2041101106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:04,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:04,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:04,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784150550] [2022-04-28 08:18:04,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:18:04,044 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:18:04,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:18:04,044 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:18:04,063 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:18:04,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:18:04,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:04,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:18:04,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:18:04,064 INFO L87 Difference]: Start difference. First operand 195 states and 355 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:04,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:04,340 INFO L93 Difference]: Finished difference Result 371 states and 683 transitions. [2022-04-28 08:18:04,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:18:04,340 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:18:04,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:18:04,340 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:18:04,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-28 08:18:04,342 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:18:04,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-28 08:18:04,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 183 transitions. [2022-04-28 08:18:04,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:04,499 INFO L225 Difference]: With dead ends: 371 [2022-04-28 08:18:04,499 INFO L226 Difference]: Without dead ends: 369 [2022-04-28 08:18:04,500 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:04,500 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 239 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:18:04,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 106 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:18:04,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-04-28 08:18:04,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 263. [2022-04-28 08:18:04,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:18:04,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 369 states. Second operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:04,522 INFO L74 IsIncluded]: Start isIncluded. First operand 369 states. Second operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:04,522 INFO L87 Difference]: Start difference. First operand 369 states. Second operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:04,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:04,531 INFO L93 Difference]: Finished difference Result 369 states and 678 transitions. [2022-04-28 08:18:04,531 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 678 transitions. [2022-04-28 08:18:04,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:04,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:04,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 369 states. [2022-04-28 08:18:04,534 INFO L87 Difference]: Start difference. First operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 369 states. [2022-04-28 08:18:04,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:04,543 INFO L93 Difference]: Finished difference Result 369 states and 678 transitions. [2022-04-28 08:18:04,543 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 678 transitions. [2022-04-28 08:18:04,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:04,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:04,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:18:04,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:18:04,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:04,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 477 transitions. [2022-04-28 08:18:04,551 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 477 transitions. Word has length 28 [2022-04-28 08:18:04,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:18:04,551 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 477 transitions. [2022-04-28 08:18:04,551 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:18:04,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 263 states and 477 transitions. [2022-04-28 08:18:05,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 477 edges. 477 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:05,007 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 477 transitions. [2022-04-28 08:18:05,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 08:18:05,008 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:18:05,008 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:18:05,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 08:18:05,008 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:18:05,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:18:05,008 INFO L85 PathProgramCache]: Analyzing trace with hash 147124856, now seen corresponding path program 1 times [2022-04-28 08:18:05,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:05,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1494112365] [2022-04-28 08:18:05,009 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:18:05,009 INFO L85 PathProgramCache]: Analyzing trace with hash 147124856, now seen corresponding path program 2 times [2022-04-28 08:18:05,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:18:05,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687063244] [2022-04-28 08:18:05,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:18:05,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:18:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:05,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:18:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:05,053 INFO L290 TraceCheckUtils]: 0: Hoare triple {6977#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {6971#true} is VALID [2022-04-28 08:18:05,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {6971#true} assume true; {6971#true} is VALID [2022-04-28 08:18:05,054 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6971#true} {6971#true} #285#return; {6971#true} is VALID [2022-04-28 08:18:05,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {6971#true} call ULTIMATE.init(); {6977#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:18:05,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {6977#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {6971#true} is VALID [2022-04-28 08:18:05,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {6971#true} assume true; {6971#true} is VALID [2022-04-28 08:18:05,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6971#true} {6971#true} #285#return; {6971#true} is VALID [2022-04-28 08:18:05,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {6971#true} call #t~ret20 := main(); {6971#true} is VALID [2022-04-28 08:18:05,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {6971#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {6971#true} is VALID [2022-04-28 08:18:05,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {6971#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {6971#true} is VALID [2022-04-28 08:18:05,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {6971#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {6971#true} is VALID [2022-04-28 08:18:05,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {6971#true} assume !(0 != ~p1~0); {6971#true} is VALID [2022-04-28 08:18:05,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {6971#true} assume !(0 != ~p2~0); {6971#true} is VALID [2022-04-28 08:18:05,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {6971#true} assume !(0 != ~p3~0); {6976#(= main_~p3~0 0)} is VALID [2022-04-28 08:18:05,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-28 08:18:05,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-28 08:18:05,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-28 08:18:05,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-28 08:18:05,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-28 08:18:05,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-28 08:18:05,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {6976#(= main_~p3~0 0)} assume !(0 != ~p10~0); {6976#(= main_~p3~0 0)} is VALID [2022-04-28 08:18:05,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-28 08:18:05,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-28 08:18:05,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-28 08:18:05,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-28 08:18:05,060 INFO L290 TraceCheckUtils]: 22: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-28 08:18:05,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {6976#(= main_~p3~0 0)} assume !(0 != ~p1~0); {6976#(= main_~p3~0 0)} is VALID [2022-04-28 08:18:05,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {6976#(= main_~p3~0 0)} assume !(0 != ~p2~0); {6976#(= main_~p3~0 0)} is VALID [2022-04-28 08:18:05,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p3~0; {6972#false} is VALID [2022-04-28 08:18:05,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {6972#false} assume 1 != ~lk3~0; {6972#false} is VALID [2022-04-28 08:18:05,061 INFO L290 TraceCheckUtils]: 27: Hoare triple {6972#false} assume !false; {6972#false} is VALID [2022-04-28 08:18:05,061 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:05,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:18:05,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687063244] [2022-04-28 08:18:05,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687063244] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:05,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:05,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:05,062 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:18:05,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1494112365] [2022-04-28 08:18:05,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1494112365] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:05,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:05,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:05,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208097736] [2022-04-28 08:18:05,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:18:05,063 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:18:05,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:18:05,063 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:18:05,083 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:18:05,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:18:05,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:05,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:18:05,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:18:05,084 INFO L87 Difference]: Start difference. First operand 263 states and 477 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:05,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:05,354 INFO L93 Difference]: Finished difference Result 631 states and 1155 transitions. [2022-04-28 08:18:05,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:18:05,354 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:18:05,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:18:05,355 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:18:05,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 276 transitions. [2022-04-28 08:18:05,357 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:18:05,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 276 transitions. [2022-04-28 08:18:05,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 276 transitions. [2022-04-28 08:18:05,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:05,605 INFO L225 Difference]: With dead ends: 631 [2022-04-28 08:18:05,605 INFO L226 Difference]: Without dead ends: 377 [2022-04-28 08:18:05,607 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:05,607 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 211 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:18:05,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 139 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:18:05,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-04-28 08:18:05,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2022-04-28 08:18:05,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:18:05,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 377 states. Second operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:05,637 INFO L74 IsIncluded]: Start isIncluded. First operand 377 states. Second operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:05,638 INFO L87 Difference]: Start difference. First operand 377 states. Second operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:05,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:05,647 INFO L93 Difference]: Finished difference Result 377 states and 680 transitions. [2022-04-28 08:18:05,647 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 680 transitions. [2022-04-28 08:18:05,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:05,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:05,648 INFO L74 IsIncluded]: Start isIncluded. First operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 377 states. [2022-04-28 08:18:05,649 INFO L87 Difference]: Start difference. First operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 377 states. [2022-04-28 08:18:05,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:05,658 INFO L93 Difference]: Finished difference Result 377 states and 680 transitions. [2022-04-28 08:18:05,659 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 680 transitions. [2022-04-28 08:18:05,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:05,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:05,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:18:05,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:18:05,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:05,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 679 transitions. [2022-04-28 08:18:05,671 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 679 transitions. Word has length 28 [2022-04-28 08:18:05,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:18:05,671 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 679 transitions. [2022-04-28 08:18:05,671 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:18:05,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 375 states and 679 transitions. [2022-04-28 08:18:06,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 679 edges. 679 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:06,270 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 679 transitions. [2022-04-28 08:18:06,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 08:18:06,271 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:18:06,271 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:18:06,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 08:18:06,271 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:18:06,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:18:06,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1955059427, now seen corresponding path program 1 times [2022-04-28 08:18:06,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:06,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [483196641] [2022-04-28 08:18:06,272 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:18:06,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1955059427, now seen corresponding path program 2 times [2022-04-28 08:18:06,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:18:06,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530130632] [2022-04-28 08:18:06,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:18:06,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:18:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:06,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:18:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:06,345 INFO L290 TraceCheckUtils]: 0: Hoare triple {9755#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {9749#true} is VALID [2022-04-28 08:18:06,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {9749#true} assume true; {9749#true} is VALID [2022-04-28 08:18:06,346 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9749#true} {9749#true} #285#return; {9749#true} is VALID [2022-04-28 08:18:06,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {9749#true} call ULTIMATE.init(); {9755#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:18:06,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {9755#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {9749#true} is VALID [2022-04-28 08:18:06,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {9749#true} assume true; {9749#true} is VALID [2022-04-28 08:18:06,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9749#true} {9749#true} #285#return; {9749#true} is VALID [2022-04-28 08:18:06,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {9749#true} call #t~ret20 := main(); {9749#true} is VALID [2022-04-28 08:18:06,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {9749#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {9749#true} is VALID [2022-04-28 08:18:06,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {9749#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {9749#true} is VALID [2022-04-28 08:18:06,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {9749#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {9749#true} is VALID [2022-04-28 08:18:06,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {9749#true} assume !(0 != ~p1~0); {9749#true} is VALID [2022-04-28 08:18:06,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {9749#true} assume !(0 != ~p2~0); {9749#true} is VALID [2022-04-28 08:18:06,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {9749#true} assume 0 != ~p3~0;~lk3~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:18:06,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:18:06,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:18:06,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:18:06,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:18:06,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:18:06,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:18:06,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {9754#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {9754#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:18:06,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:18:06,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:18:06,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:18:06,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:18:06,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:18:06,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {9754#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {9754#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:18:06,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {9754#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {9754#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:18:06,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {9754#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {9750#false} is VALID [2022-04-28 08:18:06,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {9750#false} assume 0 != ~p4~0; {9750#false} is VALID [2022-04-28 08:18:06,353 INFO L290 TraceCheckUtils]: 27: Hoare triple {9750#false} assume 1 != ~lk4~0; {9750#false} is VALID [2022-04-28 08:18:06,353 INFO L290 TraceCheckUtils]: 28: Hoare triple {9750#false} assume !false; {9750#false} is VALID [2022-04-28 08:18:06,353 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:06,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:18:06,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530130632] [2022-04-28 08:18:06,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530130632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:06,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:06,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:06,354 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:18:06,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [483196641] [2022-04-28 08:18:06,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [483196641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:06,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:06,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:06,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173149905] [2022-04-28 08:18:06,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:18:06,355 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:18:06,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:18:06,355 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:18:06,373 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:18:06,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:18:06,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:06,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:18:06,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:18:06,374 INFO L87 Difference]: Start difference. First operand 375 states and 679 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:06,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:06,646 INFO L93 Difference]: Finished difference Result 565 states and 1021 transitions. [2022-04-28 08:18:06,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:18:06,647 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:18:06,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:18:06,647 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:18:06,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 271 transitions. [2022-04-28 08:18:06,649 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:18:06,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 271 transitions. [2022-04-28 08:18:06,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 271 transitions. [2022-04-28 08:18:06,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:06,844 INFO L225 Difference]: With dead ends: 565 [2022-04-28 08:18:06,844 INFO L226 Difference]: Without dead ends: 383 [2022-04-28 08:18:06,845 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:06,845 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 194 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:18:06,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 157 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:18:06,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-04-28 08:18:06,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 381. [2022-04-28 08:18:06,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:18:06,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 383 states. Second operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:06,873 INFO L74 IsIncluded]: Start isIncluded. First operand 383 states. Second operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:06,874 INFO L87 Difference]: Start difference. First operand 383 states. Second operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:06,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:06,884 INFO L93 Difference]: Finished difference Result 383 states and 684 transitions. [2022-04-28 08:18:06,884 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 684 transitions. [2022-04-28 08:18:06,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:06,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:06,886 INFO L74 IsIncluded]: Start isIncluded. First operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 383 states. [2022-04-28 08:18:06,887 INFO L87 Difference]: Start difference. First operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 383 states. [2022-04-28 08:18:06,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:06,896 INFO L93 Difference]: Finished difference Result 383 states and 684 transitions. [2022-04-28 08:18:06,896 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 684 transitions. [2022-04-28 08:18:06,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:06,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:06,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:18:06,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:18:06,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:06,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 683 transitions. [2022-04-28 08:18:06,909 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 683 transitions. Word has length 29 [2022-04-28 08:18:06,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:18:06,909 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 683 transitions. [2022-04-28 08:18:06,909 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:18:06,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 381 states and 683 transitions. [2022-04-28 08:18:07,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 683 edges. 683 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:07,619 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 683 transitions. [2022-04-28 08:18:07,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 08:18:07,620 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:18:07,620 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:18:07,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 08:18:07,621 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:18:07,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:18:07,621 INFO L85 PathProgramCache]: Analyzing trace with hash 266115685, now seen corresponding path program 1 times [2022-04-28 08:18:07,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:07,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [538748564] [2022-04-28 08:18:07,622 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:18:07,622 INFO L85 PathProgramCache]: Analyzing trace with hash 266115685, now seen corresponding path program 2 times [2022-04-28 08:18:07,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:18:07,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310413901] [2022-04-28 08:18:07,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:18:07,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:18:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:07,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:18:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:07,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {12425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {12419#true} is VALID [2022-04-28 08:18:07,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {12419#true} assume true; {12419#true} is VALID [2022-04-28 08:18:07,677 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12419#true} {12419#true} #285#return; {12419#true} is VALID [2022-04-28 08:18:07,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {12419#true} call ULTIMATE.init(); {12425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:18:07,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {12425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {12419#true} is VALID [2022-04-28 08:18:07,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {12419#true} assume true; {12419#true} is VALID [2022-04-28 08:18:07,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12419#true} {12419#true} #285#return; {12419#true} is VALID [2022-04-28 08:18:07,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {12419#true} call #t~ret20 := main(); {12419#true} is VALID [2022-04-28 08:18:07,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {12419#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {12419#true} is VALID [2022-04-28 08:18:07,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {12419#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {12419#true} is VALID [2022-04-28 08:18:07,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {12419#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {12419#true} is VALID [2022-04-28 08:18:07,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {12419#true} assume !(0 != ~p1~0); {12419#true} is VALID [2022-04-28 08:18:07,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {12419#true} assume !(0 != ~p2~0); {12419#true} is VALID [2022-04-28 08:18:07,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {12419#true} assume !(0 != ~p3~0); {12419#true} is VALID [2022-04-28 08:18:07,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {12419#true} assume 0 != ~p4~0;~lk4~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-28 08:18:07,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-28 08:18:07,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-28 08:18:07,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-28 08:18:07,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-28 08:18:07,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-28 08:18:07,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {12424#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {12424#(= main_~lk4~0 1)} is VALID [2022-04-28 08:18:07,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-28 08:18:07,682 INFO L290 TraceCheckUtils]: 19: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-28 08:18:07,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-28 08:18:07,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-28 08:18:07,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-28 08:18:07,684 INFO L290 TraceCheckUtils]: 23: Hoare triple {12424#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {12424#(= main_~lk4~0 1)} is VALID [2022-04-28 08:18:07,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {12424#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {12424#(= main_~lk4~0 1)} is VALID [2022-04-28 08:18:07,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {12424#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {12424#(= main_~lk4~0 1)} is VALID [2022-04-28 08:18:07,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p4~0; {12424#(= main_~lk4~0 1)} is VALID [2022-04-28 08:18:07,685 INFO L290 TraceCheckUtils]: 27: Hoare triple {12424#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {12420#false} is VALID [2022-04-28 08:18:07,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {12420#false} assume !false; {12420#false} is VALID [2022-04-28 08:18:07,686 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:07,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:18:07,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310413901] [2022-04-28 08:18:07,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310413901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:07,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:07,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:07,686 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:18:07,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [538748564] [2022-04-28 08:18:07,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [538748564] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:07,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:07,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:07,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606748013] [2022-04-28 08:18:07,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:18:07,687 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:18:07,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:18:07,688 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:18:07,705 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:18:07,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:18:07,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:07,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:18:07,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:18:07,706 INFO L87 Difference]: Start difference. First operand 381 states and 683 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:08,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:08,013 INFO L93 Difference]: Finished difference Result 717 states and 1301 transitions. [2022-04-28 08:18:08,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:18:08,013 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:18:08,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:18:08,014 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:18:08,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2022-04-28 08:18:08,015 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:18:08,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2022-04-28 08:18:08,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 179 transitions. [2022-04-28 08:18:08,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:08,192 INFO L225 Difference]: With dead ends: 717 [2022-04-28 08:18:08,192 INFO L226 Difference]: Without dead ends: 715 [2022-04-28 08:18:08,193 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:08,193 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 232 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:18:08,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 105 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:18:08,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-04-28 08:18:08,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 521. [2022-04-28 08:18:08,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:18:08,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 715 states. Second operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:08,231 INFO L74 IsIncluded]: Start isIncluded. First operand 715 states. Second operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:08,232 INFO L87 Difference]: Start difference. First operand 715 states. Second operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:08,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:08,256 INFO L93 Difference]: Finished difference Result 715 states and 1292 transitions. [2022-04-28 08:18:08,257 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1292 transitions. [2022-04-28 08:18:08,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:08,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:08,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 715 states. [2022-04-28 08:18:08,260 INFO L87 Difference]: Start difference. First operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 715 states. [2022-04-28 08:18:08,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:08,286 INFO L93 Difference]: Finished difference Result 715 states and 1292 transitions. [2022-04-28 08:18:08,286 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1292 transitions. [2022-04-28 08:18:08,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:08,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:08,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:18:08,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:18:08,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:08,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 923 transitions. [2022-04-28 08:18:08,307 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 923 transitions. Word has length 29 [2022-04-28 08:18:08,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:18:08,307 INFO L495 AbstractCegarLoop]: Abstraction has 521 states and 923 transitions. [2022-04-28 08:18:08,307 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:18:08,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 521 states and 923 transitions. [2022-04-28 08:18:09,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 923 edges. 923 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:09,160 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 923 transitions. [2022-04-28 08:18:09,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 08:18:09,161 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:18:09,161 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:18:09,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 08:18:09,161 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:18:09,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:18:09,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1728029021, now seen corresponding path program 1 times [2022-04-28 08:18:09,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:09,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [170965766] [2022-04-28 08:18:09,162 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:18:09,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1728029021, now seen corresponding path program 2 times [2022-04-28 08:18:09,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:18:09,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587434834] [2022-04-28 08:18:09,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:18:09,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:18:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:09,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:18:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:09,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {16343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {16337#true} is VALID [2022-04-28 08:18:09,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {16337#true} assume true; {16337#true} is VALID [2022-04-28 08:18:09,202 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16337#true} {16337#true} #285#return; {16337#true} is VALID [2022-04-28 08:18:09,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {16337#true} call ULTIMATE.init(); {16343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:18:09,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {16343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {16337#true} is VALID [2022-04-28 08:18:09,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {16337#true} assume true; {16337#true} is VALID [2022-04-28 08:18:09,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16337#true} {16337#true} #285#return; {16337#true} is VALID [2022-04-28 08:18:09,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {16337#true} call #t~ret20 := main(); {16337#true} is VALID [2022-04-28 08:18:09,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {16337#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {16337#true} is VALID [2022-04-28 08:18:09,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {16337#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {16337#true} is VALID [2022-04-28 08:18:09,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {16337#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {16337#true} is VALID [2022-04-28 08:18:09,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {16337#true} assume !(0 != ~p1~0); {16337#true} is VALID [2022-04-28 08:18:09,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {16337#true} assume !(0 != ~p2~0); {16337#true} is VALID [2022-04-28 08:18:09,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {16337#true} assume !(0 != ~p3~0); {16337#true} is VALID [2022-04-28 08:18:09,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {16337#true} assume !(0 != ~p4~0); {16342#(= main_~p4~0 0)} is VALID [2022-04-28 08:18:09,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-28 08:18:09,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-28 08:18:09,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-28 08:18:09,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-28 08:18:09,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-28 08:18:09,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {16342#(= main_~p4~0 0)} assume !(0 != ~p10~0); {16342#(= main_~p4~0 0)} is VALID [2022-04-28 08:18:09,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-28 08:18:09,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-28 08:18:09,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-28 08:18:09,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-28 08:18:09,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-28 08:18:09,208 INFO L290 TraceCheckUtils]: 23: Hoare triple {16342#(= main_~p4~0 0)} assume !(0 != ~p1~0); {16342#(= main_~p4~0 0)} is VALID [2022-04-28 08:18:09,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {16342#(= main_~p4~0 0)} assume !(0 != ~p2~0); {16342#(= main_~p4~0 0)} is VALID [2022-04-28 08:18:09,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {16342#(= main_~p4~0 0)} assume !(0 != ~p3~0); {16342#(= main_~p4~0 0)} is VALID [2022-04-28 08:18:09,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p4~0; {16338#false} is VALID [2022-04-28 08:18:09,209 INFO L290 TraceCheckUtils]: 27: Hoare triple {16338#false} assume 1 != ~lk4~0; {16338#false} is VALID [2022-04-28 08:18:09,209 INFO L290 TraceCheckUtils]: 28: Hoare triple {16338#false} assume !false; {16338#false} is VALID [2022-04-28 08:18:09,210 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:09,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:18:09,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587434834] [2022-04-28 08:18:09,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587434834] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:09,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:09,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:09,210 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:18:09,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [170965766] [2022-04-28 08:18:09,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [170965766] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:09,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:09,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:09,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001751188] [2022-04-28 08:18:09,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:18:09,211 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:18:09,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:18:09,212 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:18:09,229 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:18:09,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:18:09,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:09,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:18:09,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:18:09,230 INFO L87 Difference]: Start difference. First operand 521 states and 923 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:09,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:09,607 INFO L93 Difference]: Finished difference Result 1245 states and 2221 transitions. [2022-04-28 08:18:09,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:18:09,607 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:18:09,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:18:09,608 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:18:09,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 273 transitions. [2022-04-28 08:18:09,611 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:18:09,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 273 transitions. [2022-04-28 08:18:09,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 273 transitions. [2022-04-28 08:18:09,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:09,849 INFO L225 Difference]: With dead ends: 1245 [2022-04-28 08:18:09,849 INFO L226 Difference]: Without dead ends: 739 [2022-04-28 08:18:09,850 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:09,851 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 205 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:18:09,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 141 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:18:09,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2022-04-28 08:18:09,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 737. [2022-04-28 08:18:09,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:18:09,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 739 states. Second operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:09,915 INFO L74 IsIncluded]: Start isIncluded. First operand 739 states. Second operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:09,916 INFO L87 Difference]: Start difference. First operand 739 states. Second operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:09,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:09,942 INFO L93 Difference]: Finished difference Result 739 states and 1304 transitions. [2022-04-28 08:18:09,942 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1304 transitions. [2022-04-28 08:18:09,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:09,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:09,946 INFO L74 IsIncluded]: Start isIncluded. First operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 739 states. [2022-04-28 08:18:09,948 INFO L87 Difference]: Start difference. First operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 739 states. [2022-04-28 08:18:09,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:09,973 INFO L93 Difference]: Finished difference Result 739 states and 1304 transitions. [2022-04-28 08:18:09,973 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1304 transitions. [2022-04-28 08:18:09,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:09,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:09,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:18:09,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:18:09,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:10,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1303 transitions. [2022-04-28 08:18:10,011 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1303 transitions. Word has length 29 [2022-04-28 08:18:10,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:18:10,012 INFO L495 AbstractCegarLoop]: Abstraction has 737 states and 1303 transitions. [2022-04-28 08:18:10,012 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:18:10,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 737 states and 1303 transitions. [2022-04-28 08:18:11,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1303 edges. 1303 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:11,229 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1303 transitions. [2022-04-28 08:18:11,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 08:18:11,230 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:18:11,230 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:18:11,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 08:18:11,231 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:18:11,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:18:11,231 INFO L85 PathProgramCache]: Analyzing trace with hash -340135571, now seen corresponding path program 1 times [2022-04-28 08:18:11,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:11,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1622625029] [2022-04-28 08:18:11,232 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:18:11,232 INFO L85 PathProgramCache]: Analyzing trace with hash -340135571, now seen corresponding path program 2 times [2022-04-28 08:18:11,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:18:11,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159576436] [2022-04-28 08:18:11,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:18:11,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:18:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:11,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:18:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:11,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {21797#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {21791#true} is VALID [2022-04-28 08:18:11,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {21791#true} assume true; {21791#true} is VALID [2022-04-28 08:18:11,276 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21791#true} {21791#true} #285#return; {21791#true} is VALID [2022-04-28 08:18:11,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {21791#true} call ULTIMATE.init(); {21797#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:18:11,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {21797#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {21791#true} is VALID [2022-04-28 08:18:11,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {21791#true} assume true; {21791#true} is VALID [2022-04-28 08:18:11,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21791#true} {21791#true} #285#return; {21791#true} is VALID [2022-04-28 08:18:11,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {21791#true} call #t~ret20 := main(); {21791#true} is VALID [2022-04-28 08:18:11,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {21791#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {21791#true} is VALID [2022-04-28 08:18:11,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {21791#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {21791#true} is VALID [2022-04-28 08:18:11,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {21791#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {21791#true} is VALID [2022-04-28 08:18:11,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {21791#true} assume !(0 != ~p1~0); {21791#true} is VALID [2022-04-28 08:18:11,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {21791#true} assume !(0 != ~p2~0); {21791#true} is VALID [2022-04-28 08:18:11,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {21791#true} assume !(0 != ~p3~0); {21791#true} is VALID [2022-04-28 08:18:11,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {21791#true} assume 0 != ~p4~0;~lk4~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:18:11,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:18:11,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:18:11,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:18:11,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:18:11,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:18:11,281 INFO L290 TraceCheckUtils]: 17: Hoare triple {21796#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {21796#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:18:11,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:18:11,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:18:11,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:18:11,282 INFO L290 TraceCheckUtils]: 21: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:18:11,282 INFO L290 TraceCheckUtils]: 22: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:18:11,283 INFO L290 TraceCheckUtils]: 23: Hoare triple {21796#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {21796#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:18:11,283 INFO L290 TraceCheckUtils]: 24: Hoare triple {21796#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {21796#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:18:11,283 INFO L290 TraceCheckUtils]: 25: Hoare triple {21796#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {21796#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:18:11,286 INFO L290 TraceCheckUtils]: 26: Hoare triple {21796#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {21792#false} is VALID [2022-04-28 08:18:11,286 INFO L290 TraceCheckUtils]: 27: Hoare triple {21792#false} assume 0 != ~p5~0; {21792#false} is VALID [2022-04-28 08:18:11,286 INFO L290 TraceCheckUtils]: 28: Hoare triple {21792#false} assume 1 != ~lk5~0; {21792#false} is VALID [2022-04-28 08:18:11,286 INFO L290 TraceCheckUtils]: 29: Hoare triple {21792#false} assume !false; {21792#false} is VALID [2022-04-28 08:18:11,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:18:11,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:18:11,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159576436] [2022-04-28 08:18:11,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159576436] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:11,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:11,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:11,287 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:18:11,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1622625029] [2022-04-28 08:18:11,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1622625029] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:11,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:11,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:11,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023840803] [2022-04-28 08:18:11,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:18:11,288 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:18:11,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:18:11,288 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:18:11,307 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:18:11,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:18:11,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:11,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:18:11,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:18:11,308 INFO L87 Difference]: Start difference. First operand 737 states and 1303 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:11,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:11,659 INFO L93 Difference]: Finished difference Result 1105 states and 1949 transitions. [2022-04-28 08:18:11,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:18:11,659 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:18:11,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:18:11,660 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:18:11,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 268 transitions. [2022-04-28 08:18:11,663 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:18:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 268 transitions. [2022-04-28 08:18:11,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 268 transitions. [2022-04-28 08:18:11,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 268 edges. 268 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:11,885 INFO L225 Difference]: With dead ends: 1105 [2022-04-28 08:18:11,885 INFO L226 Difference]: Without dead ends: 747 [2022-04-28 08:18:11,886 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:11,886 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 193 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:18:11,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 154 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:18:11,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-04-28 08:18:11,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 745. [2022-04-28 08:18:11,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:18:11,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 747 states. Second operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:11,963 INFO L74 IsIncluded]: Start isIncluded. First operand 747 states. Second operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:11,964 INFO L87 Difference]: Start difference. First operand 747 states. Second operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:11,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:11,990 INFO L93 Difference]: Finished difference Result 747 states and 1304 transitions. [2022-04-28 08:18:11,990 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1304 transitions. [2022-04-28 08:18:11,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:11,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:11,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 747 states. [2022-04-28 08:18:11,996 INFO L87 Difference]: Start difference. First operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 747 states. [2022-04-28 08:18:12,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:12,021 INFO L93 Difference]: Finished difference Result 747 states and 1304 transitions. [2022-04-28 08:18:12,021 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1304 transitions. [2022-04-28 08:18:12,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:12,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:12,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:18:12,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:18:12,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:12,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1303 transitions. [2022-04-28 08:18:12,066 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1303 transitions. Word has length 30 [2022-04-28 08:18:12,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:18:12,067 INFO L495 AbstractCegarLoop]: Abstraction has 745 states and 1303 transitions. [2022-04-28 08:18:12,067 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:18:12,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 745 states and 1303 transitions. [2022-04-28 08:18:13,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1303 edges. 1303 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1303 transitions. [2022-04-28 08:18:13,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 08:18:13,309 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:18:13,310 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:18:13,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 08:18:13,310 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:18:13,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:18:13,310 INFO L85 PathProgramCache]: Analyzing trace with hash -2029079313, now seen corresponding path program 1 times [2022-04-28 08:18:13,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:13,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [166616694] [2022-04-28 08:18:13,311 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:18:13,311 INFO L85 PathProgramCache]: Analyzing trace with hash -2029079313, now seen corresponding path program 2 times [2022-04-28 08:18:13,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:18:13,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782378407] [2022-04-28 08:18:13,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:18:13,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:18:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:13,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:18:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:13,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {27003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {26997#true} is VALID [2022-04-28 08:18:13,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {26997#true} assume true; {26997#true} is VALID [2022-04-28 08:18:13,364 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26997#true} {26997#true} #285#return; {26997#true} is VALID [2022-04-28 08:18:13,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {26997#true} call ULTIMATE.init(); {27003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:18:13,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {27003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {26997#true} is VALID [2022-04-28 08:18:13,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {26997#true} assume true; {26997#true} is VALID [2022-04-28 08:18:13,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26997#true} {26997#true} #285#return; {26997#true} is VALID [2022-04-28 08:18:13,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {26997#true} call #t~ret20 := main(); {26997#true} is VALID [2022-04-28 08:18:13,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {26997#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {26997#true} is VALID [2022-04-28 08:18:13,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {26997#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {26997#true} is VALID [2022-04-28 08:18:13,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {26997#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {26997#true} is VALID [2022-04-28 08:18:13,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {26997#true} assume !(0 != ~p1~0); {26997#true} is VALID [2022-04-28 08:18:13,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {26997#true} assume !(0 != ~p2~0); {26997#true} is VALID [2022-04-28 08:18:13,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {26997#true} assume !(0 != ~p3~0); {26997#true} is VALID [2022-04-28 08:18:13,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {26997#true} assume !(0 != ~p4~0); {26997#true} is VALID [2022-04-28 08:18:13,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {26997#true} assume 0 != ~p5~0;~lk5~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-28 08:18:13,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-28 08:18:13,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-28 08:18:13,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-28 08:18:13,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-28 08:18:13,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {27002#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {27002#(= main_~lk5~0 1)} is VALID [2022-04-28 08:18:13,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-28 08:18:13,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-28 08:18:13,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-28 08:18:13,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-28 08:18:13,370 INFO L290 TraceCheckUtils]: 22: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-28 08:18:13,370 INFO L290 TraceCheckUtils]: 23: Hoare triple {27002#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {27002#(= main_~lk5~0 1)} is VALID [2022-04-28 08:18:13,371 INFO L290 TraceCheckUtils]: 24: Hoare triple {27002#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {27002#(= main_~lk5~0 1)} is VALID [2022-04-28 08:18:13,371 INFO L290 TraceCheckUtils]: 25: Hoare triple {27002#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {27002#(= main_~lk5~0 1)} is VALID [2022-04-28 08:18:13,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {27002#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {27002#(= main_~lk5~0 1)} is VALID [2022-04-28 08:18:13,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p5~0; {27002#(= main_~lk5~0 1)} is VALID [2022-04-28 08:18:13,372 INFO L290 TraceCheckUtils]: 28: Hoare triple {27002#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {26998#false} is VALID [2022-04-28 08:18:13,372 INFO L290 TraceCheckUtils]: 29: Hoare triple {26998#false} assume !false; {26998#false} is VALID [2022-04-28 08:18:13,372 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:13,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:18:13,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782378407] [2022-04-28 08:18:13,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782378407] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:13,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:13,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:13,373 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:18:13,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [166616694] [2022-04-28 08:18:13,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [166616694] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:13,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:13,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:13,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682555428] [2022-04-28 08:18:13,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:18:13,374 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:18:13,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:18:13,374 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:18:13,395 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:18:13,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:18:13,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:13,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:18:13,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:18:13,396 INFO L87 Difference]: Start difference. First operand 745 states and 1303 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:13,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:13,822 INFO L93 Difference]: Finished difference Result 1389 states and 2465 transitions. [2022-04-28 08:18:13,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:18:13,822 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:18:13,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:18:13,822 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:18:13,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-28 08:18:13,824 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:18:13,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-28 08:18:13,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 175 transitions. [2022-04-28 08:18:13,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:14,091 INFO L225 Difference]: With dead ends: 1389 [2022-04-28 08:18:14,091 INFO L226 Difference]: Without dead ends: 1387 [2022-04-28 08:18:14,093 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:14,093 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 225 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:18:14,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 104 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:18:14,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2022-04-28 08:18:14,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1033. [2022-04-28 08:18:14,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:18:14,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1387 states. Second operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:14,180 INFO L74 IsIncluded]: Start isIncluded. First operand 1387 states. Second operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:14,182 INFO L87 Difference]: Start difference. First operand 1387 states. Second operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:14,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:14,248 INFO L93 Difference]: Finished difference Result 1387 states and 2448 transitions. [2022-04-28 08:18:14,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 2448 transitions. [2022-04-28 08:18:14,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:14,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:14,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1387 states. [2022-04-28 08:18:14,254 INFO L87 Difference]: Start difference. First operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1387 states. [2022-04-28 08:18:14,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:14,330 INFO L93 Difference]: Finished difference Result 1387 states and 2448 transitions. [2022-04-28 08:18:14,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 2448 transitions. [2022-04-28 08:18:14,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:14,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:14,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:18:14,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:18:14,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:14,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1775 transitions. [2022-04-28 08:18:14,395 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1775 transitions. Word has length 30 [2022-04-28 08:18:14,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:18:14,395 INFO L495 AbstractCegarLoop]: Abstraction has 1033 states and 1775 transitions. [2022-04-28 08:18:14,395 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:18:14,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1033 states and 1775 transitions. [2022-04-28 08:18:15,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1775 edges. 1775 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:15,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1775 transitions. [2022-04-28 08:18:15,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 08:18:15,979 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:18:15,979 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:18:15,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 08:18:15,980 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:18:15,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:18:15,980 INFO L85 PathProgramCache]: Analyzing trace with hash 271743277, now seen corresponding path program 1 times [2022-04-28 08:18:15,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:15,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1780167493] [2022-04-28 08:18:15,980 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:18:15,980 INFO L85 PathProgramCache]: Analyzing trace with hash 271743277, now seen corresponding path program 2 times [2022-04-28 08:18:15,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:18:15,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477815327] [2022-04-28 08:18:15,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:18:15,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:18:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:16,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:18:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:16,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {34633#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {34627#true} is VALID [2022-04-28 08:18:16,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {34627#true} assume true; {34627#true} is VALID [2022-04-28 08:18:16,044 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34627#true} {34627#true} #285#return; {34627#true} is VALID [2022-04-28 08:18:16,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {34627#true} call ULTIMATE.init(); {34633#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:18:16,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {34633#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {34627#true} is VALID [2022-04-28 08:18:16,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {34627#true} assume true; {34627#true} is VALID [2022-04-28 08:18:16,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34627#true} {34627#true} #285#return; {34627#true} is VALID [2022-04-28 08:18:16,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {34627#true} call #t~ret20 := main(); {34627#true} is VALID [2022-04-28 08:18:16,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {34627#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {34627#true} is VALID [2022-04-28 08:18:16,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {34627#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {34627#true} is VALID [2022-04-28 08:18:16,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {34627#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {34627#true} is VALID [2022-04-28 08:18:16,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {34627#true} assume !(0 != ~p1~0); {34627#true} is VALID [2022-04-28 08:18:16,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {34627#true} assume !(0 != ~p2~0); {34627#true} is VALID [2022-04-28 08:18:16,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {34627#true} assume !(0 != ~p3~0); {34627#true} is VALID [2022-04-28 08:18:16,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {34627#true} assume !(0 != ~p4~0); {34627#true} is VALID [2022-04-28 08:18:16,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {34627#true} assume !(0 != ~p5~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-28 08:18:16,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-28 08:18:16,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-28 08:18:16,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-28 08:18:16,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-28 08:18:16,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {34632#(= main_~p5~0 0)} assume !(0 != ~p10~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-28 08:18:16,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-28 08:18:16,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-28 08:18:16,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-28 08:18:16,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-28 08:18:16,060 INFO L290 TraceCheckUtils]: 22: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-28 08:18:16,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {34632#(= main_~p5~0 0)} assume !(0 != ~p1~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-28 08:18:16,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {34632#(= main_~p5~0 0)} assume !(0 != ~p2~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-28 08:18:16,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {34632#(= main_~p5~0 0)} assume !(0 != ~p3~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-28 08:18:16,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {34632#(= main_~p5~0 0)} assume !(0 != ~p4~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-28 08:18:16,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p5~0; {34628#false} is VALID [2022-04-28 08:18:16,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {34628#false} assume 1 != ~lk5~0; {34628#false} is VALID [2022-04-28 08:18:16,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {34628#false} assume !false; {34628#false} is VALID [2022-04-28 08:18:16,062 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:16,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:18:16,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477815327] [2022-04-28 08:18:16,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477815327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:16,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:16,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:16,063 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:18:16,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1780167493] [2022-04-28 08:18:16,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1780167493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:16,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:16,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:16,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851918876] [2022-04-28 08:18:16,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:18:16,064 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:18:16,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:18:16,064 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:18:16,083 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:18:16,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:18:16,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:16,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:18:16,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:18:16,084 INFO L87 Difference]: Start difference. First operand 1033 states and 1775 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:16,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:16,703 INFO L93 Difference]: Finished difference Result 2461 states and 4257 transitions. [2022-04-28 08:18:16,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:18:16,703 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:18:16,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:18:16,703 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:18:16,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 270 transitions. [2022-04-28 08:18:16,705 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:18:16,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 270 transitions. [2022-04-28 08:18:16,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 270 transitions. [2022-04-28 08:18:16,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:16,971 INFO L225 Difference]: With dead ends: 2461 [2022-04-28 08:18:16,972 INFO L226 Difference]: Without dead ends: 1451 [2022-04-28 08:18:16,973 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:16,974 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 199 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:18:16,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 143 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:18:16,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2022-04-28 08:18:17,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1449. [2022-04-28 08:18:17,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:18:17,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1451 states. Second operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:17,106 INFO L74 IsIncluded]: Start isIncluded. First operand 1451 states. Second operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:17,108 INFO L87 Difference]: Start difference. First operand 1451 states. Second operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:17,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:17,181 INFO L93 Difference]: Finished difference Result 1451 states and 2488 transitions. [2022-04-28 08:18:17,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2488 transitions. [2022-04-28 08:18:17,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:17,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:17,186 INFO L74 IsIncluded]: Start isIncluded. First operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1451 states. [2022-04-28 08:18:17,189 INFO L87 Difference]: Start difference. First operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1451 states. [2022-04-28 08:18:17,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:17,269 INFO L93 Difference]: Finished difference Result 1451 states and 2488 transitions. [2022-04-28 08:18:17,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2488 transitions. [2022-04-28 08:18:17,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:17,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:17,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:18:17,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:18:17,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:17,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2487 transitions. [2022-04-28 08:18:17,405 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2487 transitions. Word has length 30 [2022-04-28 08:18:17,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:18:17,405 INFO L495 AbstractCegarLoop]: Abstraction has 1449 states and 2487 transitions. [2022-04-28 08:18:17,405 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:18:17,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1449 states and 2487 transitions. [2022-04-28 08:18:19,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2487 edges. 2487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:19,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2487 transitions. [2022-04-28 08:18:19,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 08:18:19,842 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:18:19,842 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:18:19,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 08:18:19,842 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:18:19,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:18:19,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1523263864, now seen corresponding path program 1 times [2022-04-28 08:18:19,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:19,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [697973070] [2022-04-28 08:18:19,843 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:18:19,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1523263864, now seen corresponding path program 2 times [2022-04-28 08:18:19,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:18:19,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545765713] [2022-04-28 08:18:19,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:18:19,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:18:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:19,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:18:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:19,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {45367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {45361#true} is VALID [2022-04-28 08:18:19,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {45361#true} assume true; {45361#true} is VALID [2022-04-28 08:18:19,895 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45361#true} {45361#true} #285#return; {45361#true} is VALID [2022-04-28 08:18:19,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {45361#true} call ULTIMATE.init(); {45367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:18:19,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {45367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {45361#true} is VALID [2022-04-28 08:18:19,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {45361#true} assume true; {45361#true} is VALID [2022-04-28 08:18:19,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45361#true} {45361#true} #285#return; {45361#true} is VALID [2022-04-28 08:18:19,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {45361#true} call #t~ret20 := main(); {45361#true} is VALID [2022-04-28 08:18:19,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {45361#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {45361#true} is VALID [2022-04-28 08:18:19,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {45361#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {45361#true} is VALID [2022-04-28 08:18:19,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {45361#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {45361#true} is VALID [2022-04-28 08:18:19,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {45361#true} assume !(0 != ~p1~0); {45361#true} is VALID [2022-04-28 08:18:19,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {45361#true} assume !(0 != ~p2~0); {45361#true} is VALID [2022-04-28 08:18:19,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {45361#true} assume !(0 != ~p3~0); {45361#true} is VALID [2022-04-28 08:18:19,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {45361#true} assume !(0 != ~p4~0); {45361#true} is VALID [2022-04-28 08:18:19,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {45361#true} assume 0 != ~p5~0;~lk5~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:18:19,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:18:19,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:18:19,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:18:19,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:18:19,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {45366#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:18:19,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:18:19,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:18:19,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:18:19,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:18:19,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:18:19,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {45366#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:18:19,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {45366#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:18:19,901 INFO L290 TraceCheckUtils]: 25: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {45366#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:18:19,901 INFO L290 TraceCheckUtils]: 26: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {45366#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:18:19,901 INFO L290 TraceCheckUtils]: 27: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {45362#false} is VALID [2022-04-28 08:18:19,901 INFO L290 TraceCheckUtils]: 28: Hoare triple {45362#false} assume 0 != ~p6~0; {45362#false} is VALID [2022-04-28 08:18:19,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {45362#false} assume 1 != ~lk6~0; {45362#false} is VALID [2022-04-28 08:18:19,902 INFO L290 TraceCheckUtils]: 30: Hoare triple {45362#false} assume !false; {45362#false} is VALID [2022-04-28 08:18:19,902 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:19,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:18:19,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545765713] [2022-04-28 08:18:19,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545765713] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:19,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:19,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:19,903 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:18:19,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [697973070] [2022-04-28 08:18:19,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [697973070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:19,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:19,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:19,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460966782] [2022-04-28 08:18:19,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:18:19,903 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:18:19,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:18:19,904 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:18:19,922 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:18:19,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:18:19,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:19,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:18:19,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:18:19,923 INFO L87 Difference]: Start difference. First operand 1449 states and 2487 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:20,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:20,493 INFO L93 Difference]: Finished difference Result 2173 states and 3721 transitions. [2022-04-28 08:18:20,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:18:20,494 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:18:20,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:18:20,494 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:18:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 265 transitions. [2022-04-28 08:18:20,496 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:18:20,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 265 transitions. [2022-04-28 08:18:20,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 265 transitions. [2022-04-28 08:18:20,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:20,735 INFO L225 Difference]: With dead ends: 2173 [2022-04-28 08:18:20,735 INFO L226 Difference]: Without dead ends: 1467 [2022-04-28 08:18:20,737 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:20,737 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 192 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:18:20,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 151 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:18:20,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2022-04-28 08:18:20,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1465. [2022-04-28 08:18:20,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:18:20,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1467 states. Second operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:20,881 INFO L74 IsIncluded]: Start isIncluded. First operand 1467 states. Second operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:20,884 INFO L87 Difference]: Start difference. First operand 1467 states. Second operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:20,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:20,941 INFO L93 Difference]: Finished difference Result 1467 states and 2488 transitions. [2022-04-28 08:18:20,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2488 transitions. [2022-04-28 08:18:20,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:20,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:20,945 INFO L74 IsIncluded]: Start isIncluded. First operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1467 states. [2022-04-28 08:18:20,948 INFO L87 Difference]: Start difference. First operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1467 states. [2022-04-28 08:18:21,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:21,028 INFO L93 Difference]: Finished difference Result 1467 states and 2488 transitions. [2022-04-28 08:18:21,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2488 transitions. [2022-04-28 08:18:21,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:21,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:21,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:18:21,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:18:21,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:21,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 2487 transitions. [2022-04-28 08:18:21,144 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 2487 transitions. Word has length 31 [2022-04-28 08:18:21,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:18:21,144 INFO L495 AbstractCegarLoop]: Abstraction has 1465 states and 2487 transitions. [2022-04-28 08:18:21,145 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:18:21,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1465 states and 2487 transitions. [2022-04-28 08:18:23,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2487 edges. 2487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:23,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 2487 transitions. [2022-04-28 08:18:23,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 08:18:23,528 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:18:23,528 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:18:23,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 08:18:23,528 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:18:23,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:18:23,528 INFO L85 PathProgramCache]: Analyzing trace with hash -165679878, now seen corresponding path program 1 times [2022-04-28 08:18:23,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:23,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2034598506] [2022-04-28 08:18:23,529 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:18:23,529 INFO L85 PathProgramCache]: Analyzing trace with hash -165679878, now seen corresponding path program 2 times [2022-04-28 08:18:23,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:18:23,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452115866] [2022-04-28 08:18:23,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:18:23,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:18:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:23,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:18:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:23,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {55589#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {55583#true} is VALID [2022-04-28 08:18:23,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {55583#true} assume true; {55583#true} is VALID [2022-04-28 08:18:23,577 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55583#true} {55583#true} #285#return; {55583#true} is VALID [2022-04-28 08:18:23,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {55583#true} call ULTIMATE.init(); {55589#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:18:23,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {55589#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {55583#true} is VALID [2022-04-28 08:18:23,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {55583#true} assume true; {55583#true} is VALID [2022-04-28 08:18:23,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55583#true} {55583#true} #285#return; {55583#true} is VALID [2022-04-28 08:18:23,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {55583#true} call #t~ret20 := main(); {55583#true} is VALID [2022-04-28 08:18:23,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {55583#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {55583#true} is VALID [2022-04-28 08:18:23,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {55583#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {55583#true} is VALID [2022-04-28 08:18:23,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {55583#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {55583#true} is VALID [2022-04-28 08:18:23,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {55583#true} assume !(0 != ~p1~0); {55583#true} is VALID [2022-04-28 08:18:23,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {55583#true} assume !(0 != ~p2~0); {55583#true} is VALID [2022-04-28 08:18:23,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {55583#true} assume !(0 != ~p3~0); {55583#true} is VALID [2022-04-28 08:18:23,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {55583#true} assume !(0 != ~p4~0); {55583#true} is VALID [2022-04-28 08:18:23,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {55583#true} assume !(0 != ~p5~0); {55583#true} is VALID [2022-04-28 08:18:23,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {55583#true} assume 0 != ~p6~0;~lk6~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-28 08:18:23,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-28 08:18:23,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-28 08:18:23,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-28 08:18:23,581 INFO L290 TraceCheckUtils]: 17: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-28 08:18:23,581 INFO L290 TraceCheckUtils]: 18: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-28 08:18:23,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-28 08:18:23,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-28 08:18:23,582 INFO L290 TraceCheckUtils]: 21: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-28 08:18:23,582 INFO L290 TraceCheckUtils]: 22: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-28 08:18:23,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-28 08:18:23,583 INFO L290 TraceCheckUtils]: 24: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-28 08:18:23,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-28 08:18:23,583 INFO L290 TraceCheckUtils]: 26: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-28 08:18:23,584 INFO L290 TraceCheckUtils]: 27: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-28 08:18:23,584 INFO L290 TraceCheckUtils]: 28: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p6~0; {55588#(= main_~lk6~0 1)} is VALID [2022-04-28 08:18:23,584 INFO L290 TraceCheckUtils]: 29: Hoare triple {55588#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {55584#false} is VALID [2022-04-28 08:18:23,584 INFO L290 TraceCheckUtils]: 30: Hoare triple {55584#false} assume !false; {55584#false} is VALID [2022-04-28 08:18:23,585 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:23,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:18:23,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452115866] [2022-04-28 08:18:23,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452115866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:23,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:23,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:23,585 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:18:23,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2034598506] [2022-04-28 08:18:23,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2034598506] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:23,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:23,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:23,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838410589] [2022-04-28 08:18:23,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:18:23,586 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:18:23,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:18:23,586 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:18:23,605 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:18:23,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:18:23,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:23,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:18:23,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:18:23,606 INFO L87 Difference]: Start difference. First operand 1465 states and 2487 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:24,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:24,330 INFO L93 Difference]: Finished difference Result 2701 states and 4665 transitions. [2022-04-28 08:18:24,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:18:24,330 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:18:24,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:18:24,331 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:18:24,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-28 08:18:24,332 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:18:24,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-28 08:18:24,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 171 transitions. [2022-04-28 08:18:24,446 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:18:24,733 INFO L225 Difference]: With dead ends: 2701 [2022-04-28 08:18:24,733 INFO L226 Difference]: Without dead ends: 2699 [2022-04-28 08:18:24,733 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:24,734 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 218 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:18:24,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 103 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:18:24,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2022-04-28 08:18:24,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2057. [2022-04-28 08:18:24,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:18:24,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2699 states. Second operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:24,932 INFO L74 IsIncluded]: Start isIncluded. First operand 2699 states. Second operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:24,936 INFO L87 Difference]: Start difference. First operand 2699 states. Second operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:25,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:25,285 INFO L93 Difference]: Finished difference Result 2699 states and 4632 transitions. [2022-04-28 08:18:25,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4632 transitions. [2022-04-28 08:18:25,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:25,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:25,293 INFO L74 IsIncluded]: Start isIncluded. First operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2699 states. [2022-04-28 08:18:25,299 INFO L87 Difference]: Start difference. First operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2699 states. [2022-04-28 08:18:25,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:25,482 INFO L93 Difference]: Finished difference Result 2699 states and 4632 transitions. [2022-04-28 08:18:25,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4632 transitions. [2022-04-28 08:18:25,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:25,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:25,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:18:25,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:18:25,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:25,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 3415 transitions. [2022-04-28 08:18:25,799 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 3415 transitions. Word has length 31 [2022-04-28 08:18:25,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:18:25,800 INFO L495 AbstractCegarLoop]: Abstraction has 2057 states and 3415 transitions. [2022-04-28 08:18:25,802 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:18:25,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2057 states and 3415 transitions. [2022-04-28 08:18:29,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3415 edges. 3415 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:29,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 3415 transitions. [2022-04-28 08:18:29,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 08:18:29,061 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:18:29,062 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:18:29,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 08:18:29,062 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:18:29,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:18:29,062 INFO L85 PathProgramCache]: Analyzing trace with hash 2135142712, now seen corresponding path program 1 times [2022-04-28 08:18:29,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:29,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [121240718] [2022-04-28 08:18:29,063 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:18:29,063 INFO L85 PathProgramCache]: Analyzing trace with hash 2135142712, now seen corresponding path program 2 times [2022-04-28 08:18:29,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:18:29,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924341816] [2022-04-28 08:18:29,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:18:29,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:18:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:29,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:18:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:29,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {70515#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {70509#true} is VALID [2022-04-28 08:18:29,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {70509#true} assume true; {70509#true} is VALID [2022-04-28 08:18:29,133 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70509#true} {70509#true} #285#return; {70509#true} is VALID [2022-04-28 08:18:29,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {70509#true} call ULTIMATE.init(); {70515#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:18:29,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {70515#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {70509#true} is VALID [2022-04-28 08:18:29,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {70509#true} assume true; {70509#true} is VALID [2022-04-28 08:18:29,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70509#true} {70509#true} #285#return; {70509#true} is VALID [2022-04-28 08:18:29,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {70509#true} call #t~ret20 := main(); {70509#true} is VALID [2022-04-28 08:18:29,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {70509#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {70509#true} is VALID [2022-04-28 08:18:29,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {70509#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {70509#true} is VALID [2022-04-28 08:18:29,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {70509#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {70509#true} is VALID [2022-04-28 08:18:29,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {70509#true} assume !(0 != ~p1~0); {70509#true} is VALID [2022-04-28 08:18:29,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {70509#true} assume !(0 != ~p2~0); {70509#true} is VALID [2022-04-28 08:18:29,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {70509#true} assume !(0 != ~p3~0); {70509#true} is VALID [2022-04-28 08:18:29,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {70509#true} assume !(0 != ~p4~0); {70509#true} is VALID [2022-04-28 08:18:29,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {70509#true} assume !(0 != ~p5~0); {70509#true} is VALID [2022-04-28 08:18:29,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {70509#true} assume !(0 != ~p6~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-28 08:18:29,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-28 08:18:29,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-28 08:18:29,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-28 08:18:29,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p10~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-28 08:18:29,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-28 08:18:29,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-28 08:18:29,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-28 08:18:29,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-28 08:18:29,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-28 08:18:29,138 INFO L290 TraceCheckUtils]: 23: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p1~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-28 08:18:29,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p2~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-28 08:18:29,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p3~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-28 08:18:29,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p4~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-28 08:18:29,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p5~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-28 08:18:29,140 INFO L290 TraceCheckUtils]: 28: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p6~0; {70510#false} is VALID [2022-04-28 08:18:29,140 INFO L290 TraceCheckUtils]: 29: Hoare triple {70510#false} assume 1 != ~lk6~0; {70510#false} is VALID [2022-04-28 08:18:29,140 INFO L290 TraceCheckUtils]: 30: Hoare triple {70510#false} assume !false; {70510#false} is VALID [2022-04-28 08:18:29,140 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:29,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:18:29,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924341816] [2022-04-28 08:18:29,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924341816] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:29,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:29,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:29,150 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:18:29,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [121240718] [2022-04-28 08:18:29,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [121240718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:29,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:29,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:29,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304781686] [2022-04-28 08:18:29,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:18:29,151 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:18:29,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:18:29,151 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:18:29,170 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:18:29,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:18:29,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:29,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:18:29,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:18:29,172 INFO L87 Difference]: Start difference. First operand 2057 states and 3415 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:30,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:30,566 INFO L93 Difference]: Finished difference Result 4877 states and 8153 transitions. [2022-04-28 08:18:30,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:18:30,566 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:18:30,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:18:30,566 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:18:30,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 267 transitions. [2022-04-28 08:18:30,567 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:18:30,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 267 transitions. [2022-04-28 08:18:30,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 267 transitions. [2022-04-28 08:18:30,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:31,100 INFO L225 Difference]: With dead ends: 4877 [2022-04-28 08:18:31,100 INFO L226 Difference]: Without dead ends: 2859 [2022-04-28 08:18:31,104 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:31,105 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 193 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:18:31,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 145 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:18:31,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2022-04-28 08:18:31,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2857. [2022-04-28 08:18:31,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:18:31,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2859 states. Second operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:31,377 INFO L74 IsIncluded]: Start isIncluded. First operand 2859 states. Second operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:31,381 INFO L87 Difference]: Start difference. First operand 2859 states. Second operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:31,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:31,589 INFO L93 Difference]: Finished difference Result 2859 states and 4744 transitions. [2022-04-28 08:18:31,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 4744 transitions. [2022-04-28 08:18:31,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:31,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:31,595 INFO L74 IsIncluded]: Start isIncluded. First operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2859 states. [2022-04-28 08:18:31,597 INFO L87 Difference]: Start difference. First operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2859 states. [2022-04-28 08:18:31,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:31,810 INFO L93 Difference]: Finished difference Result 2859 states and 4744 transitions. [2022-04-28 08:18:31,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 4744 transitions. [2022-04-28 08:18:31,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:31,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:31,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:18:31,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:18:31,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:32,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2857 states and 4743 transitions. [2022-04-28 08:18:32,175 INFO L78 Accepts]: Start accepts. Automaton has 2857 states and 4743 transitions. Word has length 31 [2022-04-28 08:18:32,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:18:32,175 INFO L495 AbstractCegarLoop]: Abstraction has 2857 states and 4743 transitions. [2022-04-28 08:18:32,175 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:18:32,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2857 states and 4743 transitions. [2022-04-28 08:18:36,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4743 edges. 4743 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:36,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 4743 transitions. [2022-04-28 08:18:36,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 08:18:36,954 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:18:36,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, 1, 1] [2022-04-28 08:18:36,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 08:18:36,955 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:18:36,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:18:36,955 INFO L85 PathProgramCache]: Analyzing trace with hash -840895454, now seen corresponding path program 1 times [2022-04-28 08:18:36,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:36,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [125974954] [2022-04-28 08:18:36,955 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:18:36,955 INFO L85 PathProgramCache]: Analyzing trace with hash -840895454, now seen corresponding path program 2 times [2022-04-28 08:18:36,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:18:36,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511500378] [2022-04-28 08:18:36,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:18:36,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:18:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:36,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:18:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:36,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {91713#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {91707#true} is VALID [2022-04-28 08:18:36,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {91707#true} assume true; {91707#true} is VALID [2022-04-28 08:18:36,998 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {91707#true} {91707#true} #285#return; {91707#true} is VALID [2022-04-28 08:18:36,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {91707#true} call ULTIMATE.init(); {91713#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:18:36,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {91713#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {91707#true} is VALID [2022-04-28 08:18:36,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {91707#true} assume true; {91707#true} is VALID [2022-04-28 08:18:37,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91707#true} {91707#true} #285#return; {91707#true} is VALID [2022-04-28 08:18:37,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {91707#true} call #t~ret20 := main(); {91707#true} is VALID [2022-04-28 08:18:37,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {91707#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {91707#true} is VALID [2022-04-28 08:18:37,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {91707#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {91707#true} is VALID [2022-04-28 08:18:37,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {91707#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {91707#true} is VALID [2022-04-28 08:18:37,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {91707#true} assume !(0 != ~p1~0); {91707#true} is VALID [2022-04-28 08:18:37,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {91707#true} assume !(0 != ~p2~0); {91707#true} is VALID [2022-04-28 08:18:37,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {91707#true} assume !(0 != ~p3~0); {91707#true} is VALID [2022-04-28 08:18:37,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {91707#true} assume !(0 != ~p4~0); {91707#true} is VALID [2022-04-28 08:18:37,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {91707#true} assume !(0 != ~p5~0); {91707#true} is VALID [2022-04-28 08:18:37,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {91707#true} assume 0 != ~p6~0;~lk6~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:18:37,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:18:37,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:18:37,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:18:37,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:18:37,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:18:37,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:18:37,011 INFO L290 TraceCheckUtils]: 20: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:18:37,011 INFO L290 TraceCheckUtils]: 21: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:18:37,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:18:37,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:18:37,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:18:37,012 INFO L290 TraceCheckUtils]: 25: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:18:37,012 INFO L290 TraceCheckUtils]: 26: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:18:37,013 INFO L290 TraceCheckUtils]: 27: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:18:37,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {91708#false} is VALID [2022-04-28 08:18:37,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {91708#false} assume 0 != ~p7~0; {91708#false} is VALID [2022-04-28 08:18:37,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {91708#false} assume 1 != ~lk7~0; {91708#false} is VALID [2022-04-28 08:18:37,013 INFO L290 TraceCheckUtils]: 31: Hoare triple {91708#false} assume !false; {91708#false} is VALID [2022-04-28 08:18:37,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:18:37,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:18:37,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511500378] [2022-04-28 08:18:37,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511500378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:37,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:37,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:37,014 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:18:37,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [125974954] [2022-04-28 08:18:37,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [125974954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:37,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:37,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:37,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613904649] [2022-04-28 08:18:37,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:18:37,015 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:37,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:18:37,015 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:37,033 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:37,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:18:37,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:37,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:18:37,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:18:37,034 INFO L87 Difference]: Start difference. First operand 2857 states and 4743 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:38,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:38,215 INFO L93 Difference]: Finished difference Result 4285 states and 7097 transitions. [2022-04-28 08:18:38,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:18:38,215 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:38,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:18:38,216 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:38,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2022-04-28 08:18:38,217 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:38,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2022-04-28 08:18:38,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 262 transitions. [2022-04-28 08:18:38,378 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:18:38,705 INFO L225 Difference]: With dead ends: 4285 [2022-04-28 08:18:38,706 INFO L226 Difference]: Without dead ends: 2891 [2022-04-28 08:18:38,708 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:38,708 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 191 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:18:38,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 148 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:18:38,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2022-04-28 08:18:38,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 2889. [2022-04-28 08:18:38,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:18:38,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2891 states. Second operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:38,943 INFO L74 IsIncluded]: Start isIncluded. First operand 2891 states. Second operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:38,946 INFO L87 Difference]: Start difference. First operand 2891 states. Second operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:39,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:39,160 INFO L93 Difference]: Finished difference Result 2891 states and 4744 transitions. [2022-04-28 08:18:39,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 4744 transitions. [2022-04-28 08:18:39,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:39,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:39,187 INFO L74 IsIncluded]: Start isIncluded. First operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2891 states. [2022-04-28 08:18:39,189 INFO L87 Difference]: Start difference. First operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2891 states. [2022-04-28 08:18:39,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:39,387 INFO L93 Difference]: Finished difference Result 2891 states and 4744 transitions. [2022-04-28 08:18:39,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 4744 transitions. [2022-04-28 08:18:39,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:39,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:39,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:18:39,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:18:39,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:39,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 4743 transitions. [2022-04-28 08:18:39,738 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 4743 transitions. Word has length 32 [2022-04-28 08:18:39,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:18:39,738 INFO L495 AbstractCegarLoop]: Abstraction has 2889 states and 4743 transitions. [2022-04-28 08:18:39,738 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:39,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2889 states and 4743 transitions. [2022-04-28 08:18:44,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4743 edges. 4743 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:44,638 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 4743 transitions. [2022-04-28 08:18:44,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 08:18:44,640 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:18:44,640 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:44,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 08:18:44,640 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:18:44,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:18:44,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1765128100, now seen corresponding path program 1 times [2022-04-28 08:18:44,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:44,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [238030664] [2022-04-28 08:18:44,641 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:18:44,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1765128100, now seen corresponding path program 2 times [2022-04-28 08:18:44,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:18:44,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160298253] [2022-04-28 08:18:44,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:18:44,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:18:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:44,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:18:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:44,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {111855#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {111849#true} is VALID [2022-04-28 08:18:44,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {111849#true} assume true; {111849#true} is VALID [2022-04-28 08:18:44,687 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {111849#true} {111849#true} #285#return; {111849#true} is VALID [2022-04-28 08:18:44,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {111849#true} call ULTIMATE.init(); {111855#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:18:44,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {111855#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {111849#true} is VALID [2022-04-28 08:18:44,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {111849#true} assume true; {111849#true} is VALID [2022-04-28 08:18:44,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111849#true} {111849#true} #285#return; {111849#true} is VALID [2022-04-28 08:18:44,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {111849#true} call #t~ret20 := main(); {111849#true} is VALID [2022-04-28 08:18:44,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {111849#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {111849#true} is VALID [2022-04-28 08:18:44,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {111849#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {111849#true} is VALID [2022-04-28 08:18:44,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {111849#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {111849#true} is VALID [2022-04-28 08:18:44,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {111849#true} assume !(0 != ~p1~0); {111849#true} is VALID [2022-04-28 08:18:44,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {111849#true} assume !(0 != ~p2~0); {111849#true} is VALID [2022-04-28 08:18:44,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {111849#true} assume !(0 != ~p3~0); {111849#true} is VALID [2022-04-28 08:18:44,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {111849#true} assume !(0 != ~p4~0); {111849#true} is VALID [2022-04-28 08:18:44,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {111849#true} assume !(0 != ~p5~0); {111849#true} is VALID [2022-04-28 08:18:44,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {111849#true} assume !(0 != ~p6~0); {111849#true} is VALID [2022-04-28 08:18:44,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {111849#true} assume 0 != ~p7~0;~lk7~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-28 08:18:44,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-28 08:18:44,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-28 08:18:44,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-28 08:18:44,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-28 08:18:44,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-28 08:18:44,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-28 08:18:44,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-28 08:18:44,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-28 08:18:44,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-28 08:18:44,692 INFO L290 TraceCheckUtils]: 24: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-28 08:18:44,692 INFO L290 TraceCheckUtils]: 25: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-28 08:18:44,693 INFO L290 TraceCheckUtils]: 26: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-28 08:18:44,693 INFO L290 TraceCheckUtils]: 27: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-28 08:18:44,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-28 08:18:44,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p7~0; {111854#(= main_~lk7~0 1)} is VALID [2022-04-28 08:18:44,694 INFO L290 TraceCheckUtils]: 30: Hoare triple {111854#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {111850#false} is VALID [2022-04-28 08:18:44,694 INFO L290 TraceCheckUtils]: 31: Hoare triple {111850#false} assume !false; {111850#false} is VALID [2022-04-28 08:18:44,694 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:44,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:18:44,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160298253] [2022-04-28 08:18:44,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160298253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:44,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:44,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:44,695 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:18:44,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [238030664] [2022-04-28 08:18:44,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [238030664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:44,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:44,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:44,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843245197] [2022-04-28 08:18:44,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:18:44,696 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:44,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:18:44,696 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:44,715 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:44,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:18:44,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:44,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:18:44,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:18:44,716 INFO L87 Difference]: Start difference. First operand 2889 states and 4743 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:46,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:46,355 INFO L93 Difference]: Finished difference Result 5261 states and 8809 transitions. [2022-04-28 08:18:46,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:18:46,355 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:46,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:18:46,356 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:46,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2022-04-28 08:18:46,356 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:46,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2022-04-28 08:18:46,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 167 transitions. [2022-04-28 08:18:46,473 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:18:47,602 INFO L225 Difference]: With dead ends: 5261 [2022-04-28 08:18:47,602 INFO L226 Difference]: Without dead ends: 5259 [2022-04-28 08:18:47,603 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:47,603 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 211 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:18:47,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 102 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:18:47,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2022-04-28 08:18:48,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 4105. [2022-04-28 08:18:48,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:18:48,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5259 states. Second operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:48,024 INFO L74 IsIncluded]: Start isIncluded. First operand 5259 states. Second operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:48,030 INFO L87 Difference]: Start difference. First operand 5259 states. Second operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:48,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:48,780 INFO L93 Difference]: Finished difference Result 5259 states and 8744 transitions. [2022-04-28 08:18:48,780 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 8744 transitions. [2022-04-28 08:18:48,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:48,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:48,791 INFO L74 IsIncluded]: Start isIncluded. First operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5259 states. [2022-04-28 08:18:48,795 INFO L87 Difference]: Start difference. First operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5259 states. [2022-04-28 08:18:49,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:49,472 INFO L93 Difference]: Finished difference Result 5259 states and 8744 transitions. [2022-04-28 08:18:49,472 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 8744 transitions. [2022-04-28 08:18:49,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:49,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:49,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:18:49,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:18:49,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:50,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4105 states to 4105 states and 6567 transitions. [2022-04-28 08:18:50,220 INFO L78 Accepts]: Start accepts. Automaton has 4105 states and 6567 transitions. Word has length 32 [2022-04-28 08:18:50,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:18:50,220 INFO L495 AbstractCegarLoop]: Abstraction has 4105 states and 6567 transitions. [2022-04-28 08:18:50,220 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:50,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4105 states and 6567 transitions. [2022-04-28 08:18:56,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6567 edges. 6567 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:56,944 INFO L276 IsEmpty]: Start isEmpty. Operand 4105 states and 6567 transitions. [2022-04-28 08:18:56,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 08:18:56,947 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:18:56,948 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:56,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 08:18:56,948 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:18:56,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:18:56,948 INFO L85 PathProgramCache]: Analyzing trace with hash -229016606, now seen corresponding path program 1 times [2022-04-28 08:18:56,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:56,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1537347022] [2022-04-28 08:18:56,948 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:18:56,949 INFO L85 PathProgramCache]: Analyzing trace with hash -229016606, now seen corresponding path program 2 times [2022-04-28 08:18:56,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:18:56,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126911300] [2022-04-28 08:18:56,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:18:56,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:18:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:56,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:18:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:56,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {141117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {141111#true} is VALID [2022-04-28 08:18:56,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {141111#true} assume true; {141111#true} is VALID [2022-04-28 08:18:56,983 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141111#true} {141111#true} #285#return; {141111#true} is VALID [2022-04-28 08:18:56,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {141111#true} call ULTIMATE.init(); {141117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:18:56,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {141117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {141111#true} is VALID [2022-04-28 08:18:56,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {141111#true} assume true; {141111#true} is VALID [2022-04-28 08:18:56,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141111#true} {141111#true} #285#return; {141111#true} is VALID [2022-04-28 08:18:56,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {141111#true} call #t~ret20 := main(); {141111#true} is VALID [2022-04-28 08:18:56,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {141111#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {141111#true} is VALID [2022-04-28 08:18:56,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {141111#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {141111#true} is VALID [2022-04-28 08:18:56,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {141111#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {141111#true} is VALID [2022-04-28 08:18:56,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {141111#true} assume !(0 != ~p1~0); {141111#true} is VALID [2022-04-28 08:18:56,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {141111#true} assume !(0 != ~p2~0); {141111#true} is VALID [2022-04-28 08:18:56,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {141111#true} assume !(0 != ~p3~0); {141111#true} is VALID [2022-04-28 08:18:56,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {141111#true} assume !(0 != ~p4~0); {141111#true} is VALID [2022-04-28 08:18:56,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {141111#true} assume !(0 != ~p5~0); {141111#true} is VALID [2022-04-28 08:18:56,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {141111#true} assume !(0 != ~p6~0); {141111#true} is VALID [2022-04-28 08:18:56,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {141111#true} assume !(0 != ~p7~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-28 08:18:56,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-28 08:18:56,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-28 08:18:56,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p10~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-28 08:18:56,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-28 08:18:56,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-28 08:18:56,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-28 08:18:56,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-28 08:18:56,988 INFO L290 TraceCheckUtils]: 22: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-28 08:18:56,989 INFO L290 TraceCheckUtils]: 23: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p1~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-28 08:18:56,989 INFO L290 TraceCheckUtils]: 24: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p2~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-28 08:18:56,989 INFO L290 TraceCheckUtils]: 25: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p3~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-28 08:18:56,990 INFO L290 TraceCheckUtils]: 26: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p4~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-28 08:18:56,990 INFO L290 TraceCheckUtils]: 27: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p5~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-28 08:18:56,990 INFO L290 TraceCheckUtils]: 28: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p6~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-28 08:18:56,991 INFO L290 TraceCheckUtils]: 29: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p7~0; {141112#false} is VALID [2022-04-28 08:18:56,991 INFO L290 TraceCheckUtils]: 30: Hoare triple {141112#false} assume 1 != ~lk7~0; {141112#false} is VALID [2022-04-28 08:18:56,991 INFO L290 TraceCheckUtils]: 31: Hoare triple {141112#false} assume !false; {141112#false} is VALID [2022-04-28 08:18:56,991 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:56,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:18:56,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126911300] [2022-04-28 08:18:56,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126911300] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:56,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:56,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:56,992 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:18:56,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1537347022] [2022-04-28 08:18:56,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1537347022] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:56,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:56,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:56,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782495692] [2022-04-28 08:18:56,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:18:56,993 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:56,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:18:56,993 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:57,013 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:57,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:18:57,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:57,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:18:57,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:18:57,014 INFO L87 Difference]: Start difference. First operand 4105 states and 6567 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:01,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:01,441 INFO L93 Difference]: Finished difference Result 9677 states and 15593 transitions. [2022-04-28 08:19:01,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:01,441 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:19:01,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:01,442 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:19:01,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2022-04-28 08:19:01,443 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:19:01,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2022-04-28 08:19:01,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 264 transitions. [2022-04-28 08:19:01,612 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:19:02,872 INFO L225 Difference]: With dead ends: 9677 [2022-04-28 08:19:02,872 INFO L226 Difference]: Without dead ends: 5643 [2022-04-28 08:19:02,878 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:02,879 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 187 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:02,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 147 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:19:02,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2022-04-28 08:19:03,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5641. [2022-04-28 08:19:03,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:03,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5643 states. Second operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:03,353 INFO L74 IsIncluded]: Start isIncluded. First operand 5643 states. Second operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:03,360 INFO L87 Difference]: Start difference. First operand 5643 states. Second operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:04,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:04,174 INFO L93 Difference]: Finished difference Result 5643 states and 9032 transitions. [2022-04-28 08:19:04,174 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 9032 transitions. [2022-04-28 08:19:04,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:04,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:04,189 INFO L74 IsIncluded]: Start isIncluded. First operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5643 states. [2022-04-28 08:19:04,198 INFO L87 Difference]: Start difference. First operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5643 states. [2022-04-28 08:19:05,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:05,049 INFO L93 Difference]: Finished difference Result 5643 states and 9032 transitions. [2022-04-28 08:19:05,050 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 9032 transitions. [2022-04-28 08:19:05,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:05,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:05,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:05,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:05,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:06,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5641 states to 5641 states and 9031 transitions. [2022-04-28 08:19:06,474 INFO L78 Accepts]: Start accepts. Automaton has 5641 states and 9031 transitions. Word has length 32 [2022-04-28 08:19:06,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:06,474 INFO L495 AbstractCegarLoop]: Abstraction has 5641 states and 9031 transitions. [2022-04-28 08:19:06,474 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:19:06,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5641 states and 9031 transitions. [2022-04-28 08:19:16,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9031 edges. 9031 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:16,283 INFO L276 IsEmpty]: Start isEmpty. Operand 5641 states and 9031 transitions. [2022-04-28 08:19:16,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 08:19:16,286 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:16,286 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:16,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 08:19:16,286 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:16,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:16,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1115389939, now seen corresponding path program 1 times [2022-04-28 08:19:16,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:16,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1092874247] [2022-04-28 08:19:16,287 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:16,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1115389939, now seen corresponding path program 2 times [2022-04-28 08:19:16,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:16,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856157171] [2022-04-28 08:19:16,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:16,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:16,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:16,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {183051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {183045#true} is VALID [2022-04-28 08:19:16,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {183045#true} assume true; {183045#true} is VALID [2022-04-28 08:19:16,326 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {183045#true} {183045#true} #285#return; {183045#true} is VALID [2022-04-28 08:19:16,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {183045#true} call ULTIMATE.init(); {183051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:16,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {183051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {183045#true} is VALID [2022-04-28 08:19:16,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {183045#true} assume true; {183045#true} is VALID [2022-04-28 08:19:16,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183045#true} {183045#true} #285#return; {183045#true} is VALID [2022-04-28 08:19:16,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {183045#true} call #t~ret20 := main(); {183045#true} is VALID [2022-04-28 08:19:16,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {183045#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {183045#true} is VALID [2022-04-28 08:19:16,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {183045#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {183045#true} is VALID [2022-04-28 08:19:16,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {183045#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {183045#true} is VALID [2022-04-28 08:19:16,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {183045#true} assume !(0 != ~p1~0); {183045#true} is VALID [2022-04-28 08:19:16,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {183045#true} assume !(0 != ~p2~0); {183045#true} is VALID [2022-04-28 08:19:16,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {183045#true} assume !(0 != ~p3~0); {183045#true} is VALID [2022-04-28 08:19:16,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {183045#true} assume !(0 != ~p4~0); {183045#true} is VALID [2022-04-28 08:19:16,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {183045#true} assume !(0 != ~p5~0); {183045#true} is VALID [2022-04-28 08:19:16,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {183045#true} assume !(0 != ~p6~0); {183045#true} is VALID [2022-04-28 08:19:16,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {183045#true} assume 0 != ~p7~0;~lk7~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:19:16,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:19:16,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:19:16,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:19:16,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:19:16,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:19:16,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:19:16,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:19:16,331 INFO L290 TraceCheckUtils]: 22: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:19:16,331 INFO L290 TraceCheckUtils]: 23: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:19:16,331 INFO L290 TraceCheckUtils]: 24: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:19:16,331 INFO L290 TraceCheckUtils]: 25: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:19:16,332 INFO L290 TraceCheckUtils]: 26: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:19:16,332 INFO L290 TraceCheckUtils]: 27: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:19:16,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:19:16,333 INFO L290 TraceCheckUtils]: 29: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {183046#false} is VALID [2022-04-28 08:19:16,333 INFO L290 TraceCheckUtils]: 30: Hoare triple {183046#false} assume 0 != ~p8~0; {183046#false} is VALID [2022-04-28 08:19:16,333 INFO L290 TraceCheckUtils]: 31: Hoare triple {183046#false} assume 1 != ~lk8~0; {183046#false} is VALID [2022-04-28 08:19:16,333 INFO L290 TraceCheckUtils]: 32: Hoare triple {183046#false} assume !false; {183046#false} is VALID [2022-04-28 08:19:16,333 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:16,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:16,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856157171] [2022-04-28 08:19:16,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856157171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:16,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:16,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:16,334 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:16,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1092874247] [2022-04-28 08:19:16,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1092874247] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:16,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:16,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:16,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716686963] [2022-04-28 08:19:16,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:16,335 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:16,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:16,335 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:16,355 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:16,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:16,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:16,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:16,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:16,356 INFO L87 Difference]: Start difference. First operand 5641 states and 9031 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:19,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:19,990 INFO L93 Difference]: Finished difference Result 8461 states and 13513 transitions. [2022-04-28 08:19:19,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:19,991 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:19,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:19,991 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:19,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2022-04-28 08:19:19,992 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:19,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2022-04-28 08:19:19,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 259 transitions. [2022-04-28 08:19:20,154 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:19:21,538 INFO L225 Difference]: With dead ends: 8461 [2022-04-28 08:19:21,538 INFO L226 Difference]: Without dead ends: 5707 [2022-04-28 08:19:21,541 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:21,542 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 190 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:21,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 145 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:19:21,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5707 states. [2022-04-28 08:19:21,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5707 to 5705. [2022-04-28 08:19:21,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:21,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5707 states. Second operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:22,001 INFO L74 IsIncluded]: Start isIncluded. First operand 5707 states. Second operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:22,014 INFO L87 Difference]: Start difference. First operand 5707 states. Second operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:22,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:22,828 INFO L93 Difference]: Finished difference Result 5707 states and 9032 transitions. [2022-04-28 08:19:22,828 INFO L276 IsEmpty]: Start isEmpty. Operand 5707 states and 9032 transitions. [2022-04-28 08:19:22,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:22,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:22,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5707 states. [2022-04-28 08:19:22,855 INFO L87 Difference]: Start difference. First operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5707 states. [2022-04-28 08:19:23,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:23,869 INFO L93 Difference]: Finished difference Result 5707 states and 9032 transitions. [2022-04-28 08:19:23,869 INFO L276 IsEmpty]: Start isEmpty. Operand 5707 states and 9032 transitions. [2022-04-28 08:19:23,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:23,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:23,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:23,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:23,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:25,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5705 states to 5705 states and 9031 transitions. [2022-04-28 08:19:25,527 INFO L78 Accepts]: Start accepts. Automaton has 5705 states and 9031 transitions. Word has length 33 [2022-04-28 08:19:25,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:25,527 INFO L495 AbstractCegarLoop]: Abstraction has 5705 states and 9031 transitions. [2022-04-28 08:19:25,527 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:25,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5705 states and 9031 transitions. [2022-04-28 08:19:35,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9031 edges. 9031 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:35,244 INFO L276 IsEmpty]: Start isEmpty. Operand 5705 states and 9031 transitions. [2022-04-28 08:19:35,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 08:19:35,247 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:35,247 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:35,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 08:19:35,248 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:35,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:35,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1490633615, now seen corresponding path program 1 times [2022-04-28 08:19:35,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:35,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2123955231] [2022-04-28 08:19:35,248 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:35,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1490633615, now seen corresponding path program 2 times [2022-04-28 08:19:35,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:35,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652740319] [2022-04-28 08:19:35,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:35,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:35,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:35,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {222809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {222803#true} is VALID [2022-04-28 08:19:35,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {222803#true} assume true; {222803#true} is VALID [2022-04-28 08:19:35,289 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {222803#true} {222803#true} #285#return; {222803#true} is VALID [2022-04-28 08:19:35,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {222803#true} call ULTIMATE.init(); {222809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:35,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {222809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {222803#true} is VALID [2022-04-28 08:19:35,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {222803#true} assume true; {222803#true} is VALID [2022-04-28 08:19:35,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {222803#true} {222803#true} #285#return; {222803#true} is VALID [2022-04-28 08:19:35,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {222803#true} call #t~ret20 := main(); {222803#true} is VALID [2022-04-28 08:19:35,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {222803#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {222803#true} is VALID [2022-04-28 08:19:35,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {222803#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {222803#true} is VALID [2022-04-28 08:19:35,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {222803#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {222803#true} is VALID [2022-04-28 08:19:35,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {222803#true} assume !(0 != ~p1~0); {222803#true} is VALID [2022-04-28 08:19:35,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {222803#true} assume !(0 != ~p2~0); {222803#true} is VALID [2022-04-28 08:19:35,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {222803#true} assume !(0 != ~p3~0); {222803#true} is VALID [2022-04-28 08:19:35,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {222803#true} assume !(0 != ~p4~0); {222803#true} is VALID [2022-04-28 08:19:35,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {222803#true} assume !(0 != ~p5~0); {222803#true} is VALID [2022-04-28 08:19:35,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {222803#true} assume !(0 != ~p6~0); {222803#true} is VALID [2022-04-28 08:19:35,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {222803#true} assume !(0 != ~p7~0); {222803#true} is VALID [2022-04-28 08:19:35,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {222803#true} assume 0 != ~p8~0;~lk8~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-28 08:19:35,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-28 08:19:35,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-28 08:19:35,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-28 08:19:35,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-28 08:19:35,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-28 08:19:35,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-28 08:19:35,293 INFO L290 TraceCheckUtils]: 22: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-28 08:19:35,293 INFO L290 TraceCheckUtils]: 23: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-28 08:19:35,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-28 08:19:35,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-28 08:19:35,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-28 08:19:35,295 INFO L290 TraceCheckUtils]: 27: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-28 08:19:35,295 INFO L290 TraceCheckUtils]: 28: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-28 08:19:35,295 INFO L290 TraceCheckUtils]: 29: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-28 08:19:35,296 INFO L290 TraceCheckUtils]: 30: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p8~0; {222808#(= main_~lk8~0 1)} is VALID [2022-04-28 08:19:35,296 INFO L290 TraceCheckUtils]: 31: Hoare triple {222808#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {222804#false} is VALID [2022-04-28 08:19:35,296 INFO L290 TraceCheckUtils]: 32: Hoare triple {222804#false} assume !false; {222804#false} is VALID [2022-04-28 08:19:35,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:19:35,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:35,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652740319] [2022-04-28 08:19:35,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652740319] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:35,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:35,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:35,297 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:35,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2123955231] [2022-04-28 08:19:35,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2123955231] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:35,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:35,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:35,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360261440] [2022-04-28 08:19:35,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:35,298 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:35,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:35,298 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:35,320 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:35,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:35,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:35,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:35,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:35,321 INFO L87 Difference]: Start difference. First operand 5705 states and 9031 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:41,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:41,221 INFO L93 Difference]: Finished difference Result 10253 states and 16585 transitions. [2022-04-28 08:19:41,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:41,221 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:41,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:41,221 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:41,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-28 08:19:41,223 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:41,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-28 08:19:41,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-28 08:19:41,337 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:19:45,737 INFO L225 Difference]: With dead ends: 10253 [2022-04-28 08:19:45,737 INFO L226 Difference]: Without dead ends: 10251 [2022-04-28 08:19:45,739 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:45,739 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 204 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:45,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 101 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:19:45,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10251 states. [2022-04-28 08:19:46,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10251 to 8201. [2022-04-28 08:19:46,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:46,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10251 states. Second operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:46,482 INFO L74 IsIncluded]: Start isIncluded. First operand 10251 states. Second operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:46,491 INFO L87 Difference]: Start difference. First operand 10251 states. Second operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:49,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:49,729 INFO L93 Difference]: Finished difference Result 10251 states and 16456 transitions. [2022-04-28 08:19:49,729 INFO L276 IsEmpty]: Start isEmpty. Operand 10251 states and 16456 transitions. [2022-04-28 08:19:49,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:49,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:49,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 10251 states. [2022-04-28 08:19:49,767 INFO L87 Difference]: Start difference. First operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 10251 states. [2022-04-28 08:19:52,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:52,954 INFO L93 Difference]: Finished difference Result 10251 states and 16456 transitions. [2022-04-28 08:19:52,954 INFO L276 IsEmpty]: Start isEmpty. Operand 10251 states and 16456 transitions. [2022-04-28 08:19:52,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:52,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:52,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:52,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:52,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:56,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8201 states to 8201 states and 12615 transitions. [2022-04-28 08:19:56,123 INFO L78 Accepts]: Start accepts. Automaton has 8201 states and 12615 transitions. Word has length 33 [2022-04-28 08:19:56,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:56,123 INFO L495 AbstractCegarLoop]: Abstraction has 8201 states and 12615 transitions. [2022-04-28 08:19:56,123 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:56,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8201 states and 12615 transitions. [2022-04-28 08:20:09,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12615 edges. 12615 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:09,628 INFO L276 IsEmpty]: Start isEmpty. Operand 8201 states and 12615 transitions. [2022-04-28 08:20:09,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 08:20:09,634 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:20:09,634 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:09,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 08:20:09,634 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:20:09,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:20:09,634 INFO L85 PathProgramCache]: Analyzing trace with hash -503511091, now seen corresponding path program 1 times [2022-04-28 08:20:09,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:09,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [14789431] [2022-04-28 08:20:09,635 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:20:09,635 INFO L85 PathProgramCache]: Analyzing trace with hash -503511091, now seen corresponding path program 2 times [2022-04-28 08:20:09,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:20:09,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230692880] [2022-04-28 08:20:09,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:20:09,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:20:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:09,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:20:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:09,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {280231#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {280225#true} is VALID [2022-04-28 08:20:09,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {280225#true} assume true; {280225#true} is VALID [2022-04-28 08:20:09,674 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {280225#true} {280225#true} #285#return; {280225#true} is VALID [2022-04-28 08:20:09,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {280225#true} call ULTIMATE.init(); {280231#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:20:09,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {280231#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {280225#true} is VALID [2022-04-28 08:20:09,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {280225#true} assume true; {280225#true} is VALID [2022-04-28 08:20:09,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {280225#true} {280225#true} #285#return; {280225#true} is VALID [2022-04-28 08:20:09,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {280225#true} call #t~ret20 := main(); {280225#true} is VALID [2022-04-28 08:20:09,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {280225#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {280225#true} is VALID [2022-04-28 08:20:09,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {280225#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {280225#true} is VALID [2022-04-28 08:20:09,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {280225#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {280225#true} is VALID [2022-04-28 08:20:09,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {280225#true} assume !(0 != ~p1~0); {280225#true} is VALID [2022-04-28 08:20:09,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {280225#true} assume !(0 != ~p2~0); {280225#true} is VALID [2022-04-28 08:20:09,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {280225#true} assume !(0 != ~p3~0); {280225#true} is VALID [2022-04-28 08:20:09,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {280225#true} assume !(0 != ~p4~0); {280225#true} is VALID [2022-04-28 08:20:09,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {280225#true} assume !(0 != ~p5~0); {280225#true} is VALID [2022-04-28 08:20:09,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {280225#true} assume !(0 != ~p6~0); {280225#true} is VALID [2022-04-28 08:20:09,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {280225#true} assume !(0 != ~p7~0); {280225#true} is VALID [2022-04-28 08:20:09,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {280225#true} assume !(0 != ~p8~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-28 08:20:09,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-28 08:20:09,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p10~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-28 08:20:09,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-28 08:20:09,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-28 08:20:09,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-28 08:20:09,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-28 08:20:09,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-28 08:20:09,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p1~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-28 08:20:09,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p2~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-28 08:20:09,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p3~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-28 08:20:09,680 INFO L290 TraceCheckUtils]: 26: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p4~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-28 08:20:09,680 INFO L290 TraceCheckUtils]: 27: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p5~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-28 08:20:09,681 INFO L290 TraceCheckUtils]: 28: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p6~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-28 08:20:09,681 INFO L290 TraceCheckUtils]: 29: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p7~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-28 08:20:09,681 INFO L290 TraceCheckUtils]: 30: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p8~0; {280226#false} is VALID [2022-04-28 08:20:09,681 INFO L290 TraceCheckUtils]: 31: Hoare triple {280226#false} assume 1 != ~lk8~0; {280226#false} is VALID [2022-04-28 08:20:09,681 INFO L290 TraceCheckUtils]: 32: Hoare triple {280226#false} assume !false; {280226#false} is VALID [2022-04-28 08:20:09,682 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:09,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:20:09,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230692880] [2022-04-28 08:20:09,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230692880] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:09,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:09,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:09,683 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:20:09,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [14789431] [2022-04-28 08:20:09,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [14789431] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:09,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:09,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:09,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667963711] [2022-04-28 08:20:09,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:20:09,683 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:09,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:20:09,684 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:09,704 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:09,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:20:09,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:09,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:20:09,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:20:09,705 INFO L87 Difference]: Start difference. First operand 8201 states and 12615 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:29,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:29,533 INFO L93 Difference]: Finished difference Result 19213 states and 29769 transitions. [2022-04-28 08:20:29,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:20:29,533 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:29,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:20:29,534 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:20:29,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 261 transitions. [2022-04-28 08:20:29,535 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:20:29,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 261 transitions. [2022-04-28 08:20:29,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 261 transitions. [2022-04-28 08:20:29,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:34,624 INFO L225 Difference]: With dead ends: 19213 [2022-04-28 08:20:34,624 INFO L226 Difference]: Without dead ends: 11147 [2022-04-28 08:20:34,633 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:34,634 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:20:34,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 149 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:20:34,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11147 states. [2022-04-28 08:20:35,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11147 to 11145. [2022-04-28 08:20:35,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:20:35,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11147 states. Second operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:35,583 INFO L74 IsIncluded]: Start isIncluded. First operand 11147 states. Second operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:35,597 INFO L87 Difference]: Start difference. First operand 11147 states. Second operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:39,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:39,185 INFO L93 Difference]: Finished difference Result 11147 states and 17160 transitions. [2022-04-28 08:20:39,185 INFO L276 IsEmpty]: Start isEmpty. Operand 11147 states and 17160 transitions. [2022-04-28 08:20:39,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:39,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:39,216 INFO L74 IsIncluded]: Start isIncluded. First operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 11147 states. [2022-04-28 08:20:39,230 INFO L87 Difference]: Start difference. First operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 11147 states. [2022-04-28 08:20:42,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:42,756 INFO L93 Difference]: Finished difference Result 11147 states and 17160 transitions. [2022-04-28 08:20:42,756 INFO L276 IsEmpty]: Start isEmpty. Operand 11147 states and 17160 transitions. [2022-04-28 08:20:42,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:42,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:42,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:20:42,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:20:42,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:48,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11145 states to 11145 states and 17159 transitions. [2022-04-28 08:20:48,464 INFO L78 Accepts]: Start accepts. Automaton has 11145 states and 17159 transitions. Word has length 33 [2022-04-28 08:20:48,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:20:48,464 INFO L495 AbstractCegarLoop]: Abstraction has 11145 states and 17159 transitions. [2022-04-28 08:20:48,464 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:48,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11145 states and 17159 transitions. [2022-04-28 08:21:08,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17159 edges. 17159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:08,171 INFO L276 IsEmpty]: Start isEmpty. Operand 11145 states and 17159 transitions. [2022-04-28 08:21:08,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 08:21:08,176 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:21:08,176 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:21:08,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 08:21:08,176 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:21:08,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:21:08,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1034784041, now seen corresponding path program 1 times [2022-04-28 08:21:08,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:08,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [144076429] [2022-04-28 08:21:08,177 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:21:08,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1034784041, now seen corresponding path program 2 times [2022-04-28 08:21:08,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:21:08,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997132885] [2022-04-28 08:21:08,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:21:08,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:21:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:08,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:21:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:08,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {363253#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {363247#true} is VALID [2022-04-28 08:21:08,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {363247#true} assume true; {363247#true} is VALID [2022-04-28 08:21:08,218 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {363247#true} {363247#true} #285#return; {363247#true} is VALID [2022-04-28 08:21:08,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {363247#true} call ULTIMATE.init(); {363253#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:21:08,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {363253#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {363247#true} is VALID [2022-04-28 08:21:08,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {363247#true} assume true; {363247#true} is VALID [2022-04-28 08:21:08,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {363247#true} {363247#true} #285#return; {363247#true} is VALID [2022-04-28 08:21:08,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {363247#true} call #t~ret20 := main(); {363247#true} is VALID [2022-04-28 08:21:08,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {363247#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {363247#true} is VALID [2022-04-28 08:21:08,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {363247#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {363247#true} is VALID [2022-04-28 08:21:08,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {363247#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {363247#true} is VALID [2022-04-28 08:21:08,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {363247#true} assume !(0 != ~p1~0); {363247#true} is VALID [2022-04-28 08:21:08,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {363247#true} assume !(0 != ~p2~0); {363247#true} is VALID [2022-04-28 08:21:08,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {363247#true} assume !(0 != ~p3~0); {363247#true} is VALID [2022-04-28 08:21:08,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {363247#true} assume !(0 != ~p4~0); {363247#true} is VALID [2022-04-28 08:21:08,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {363247#true} assume !(0 != ~p5~0); {363247#true} is VALID [2022-04-28 08:21:08,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {363247#true} assume !(0 != ~p6~0); {363247#true} is VALID [2022-04-28 08:21:08,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {363247#true} assume !(0 != ~p7~0); {363247#true} is VALID [2022-04-28 08:21:08,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {363247#true} assume 0 != ~p8~0;~lk8~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:21:08,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:21:08,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:21:08,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:21:08,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:21:08,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:21:08,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:21:08,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:21:08,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:21:08,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:21:08,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:21:08,224 INFO L290 TraceCheckUtils]: 26: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:21:08,224 INFO L290 TraceCheckUtils]: 27: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:21:08,224 INFO L290 TraceCheckUtils]: 28: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:21:08,225 INFO L290 TraceCheckUtils]: 29: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:21:08,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {363248#false} is VALID [2022-04-28 08:21:08,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {363248#false} assume 0 != ~p9~0; {363248#false} is VALID [2022-04-28 08:21:08,225 INFO L290 TraceCheckUtils]: 32: Hoare triple {363248#false} assume 1 != ~lk9~0; {363248#false} is VALID [2022-04-28 08:21:08,225 INFO L290 TraceCheckUtils]: 33: Hoare triple {363248#false} assume !false; {363248#false} is VALID [2022-04-28 08:21:08,226 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:21:08,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:21:08,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997132885] [2022-04-28 08:21:08,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997132885] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:08,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:08,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:08,226 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:21:08,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [144076429] [2022-04-28 08:21:08,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [144076429] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:08,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:08,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:08,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653022165] [2022-04-28 08:21:08,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:21:08,227 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:21:08,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:21:08,228 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:21:08,248 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:21:08,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:21:08,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:08,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:21:08,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:21:08,249 INFO L87 Difference]: Start difference. First operand 11145 states and 17159 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:21:22,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:22,090 INFO L93 Difference]: Finished difference Result 16717 states and 25673 transitions. [2022-04-28 08:21:22,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:21:22,091 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:21:22,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:21:22,091 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:21:22,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 256 transitions. [2022-04-28 08:21:22,092 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:21:22,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 256 transitions. [2022-04-28 08:21:22,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 256 transitions. [2022-04-28 08:21:22,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:27,293 INFO L225 Difference]: With dead ends: 16717 [2022-04-28 08:21:27,293 INFO L226 Difference]: Without dead ends: 11275 [2022-04-28 08:21:27,301 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:21:27,302 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 189 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:21:27,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 142 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:21:27,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11275 states. [2022-04-28 08:21:28,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11275 to 11273. [2022-04-28 08:21:28,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:21:28,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11275 states. Second operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:21:28,264 INFO L74 IsIncluded]: Start isIncluded. First operand 11275 states. Second operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:21:28,280 INFO L87 Difference]: Start difference. First operand 11275 states. Second operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:21:31,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:31,759 INFO L93 Difference]: Finished difference Result 11275 states and 17160 transitions. [2022-04-28 08:21:31,759 INFO L276 IsEmpty]: Start isEmpty. Operand 11275 states and 17160 transitions. [2022-04-28 08:21:31,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:31,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:31,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 11275 states. [2022-04-28 08:21:31,800 INFO L87 Difference]: Start difference. First operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 11275 states. [2022-04-28 08:21:35,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:35,246 INFO L93 Difference]: Finished difference Result 11275 states and 17160 transitions. [2022-04-28 08:21:35,246 INFO L276 IsEmpty]: Start isEmpty. Operand 11275 states and 17160 transitions. [2022-04-28 08:21:35,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:35,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:35,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:21:35,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:21:35,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:21:40,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11273 states to 11273 states and 17159 transitions. [2022-04-28 08:21:40,982 INFO L78 Accepts]: Start accepts. Automaton has 11273 states and 17159 transitions. Word has length 34 [2022-04-28 08:21:40,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:21:40,982 INFO L495 AbstractCegarLoop]: Abstraction has 11273 states and 17159 transitions. [2022-04-28 08:21:40,983 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:21:40,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11273 states and 17159 transitions. [2022-04-28 08:22:00,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17159 edges. 17159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:22:00,577 INFO L276 IsEmpty]: Start isEmpty. Operand 11273 states and 17159 transitions. [2022-04-28 08:22:00,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 08:22:00,584 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:22:00,584 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:22:00,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 08:22:00,585 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:22:00,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:22:00,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1571239513, now seen corresponding path program 1 times [2022-04-28 08:22:00,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:00,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1587550018] [2022-04-28 08:22:00,586 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:22:00,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1571239513, now seen corresponding path program 2 times [2022-04-28 08:22:00,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:22:00,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499050780] [2022-04-28 08:22:00,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:22:00,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:22:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:00,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:22:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:00,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {441795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {441789#true} is VALID [2022-04-28 08:22:00,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {441789#true} assume true; {441789#true} is VALID [2022-04-28 08:22:00,634 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {441789#true} {441789#true} #285#return; {441789#true} is VALID [2022-04-28 08:22:00,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {441789#true} call ULTIMATE.init(); {441795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:22:00,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {441795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {441789#true} is VALID [2022-04-28 08:22:00,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {441789#true} assume true; {441789#true} is VALID [2022-04-28 08:22:00,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {441789#true} {441789#true} #285#return; {441789#true} is VALID [2022-04-28 08:22:00,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {441789#true} call #t~ret20 := main(); {441789#true} is VALID [2022-04-28 08:22:00,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {441789#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {441789#true} is VALID [2022-04-28 08:22:00,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {441789#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {441789#true} is VALID [2022-04-28 08:22:00,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {441789#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {441789#true} is VALID [2022-04-28 08:22:00,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {441789#true} assume !(0 != ~p1~0); {441789#true} is VALID [2022-04-28 08:22:00,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {441789#true} assume !(0 != ~p2~0); {441789#true} is VALID [2022-04-28 08:22:00,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {441789#true} assume !(0 != ~p3~0); {441789#true} is VALID [2022-04-28 08:22:00,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {441789#true} assume !(0 != ~p4~0); {441789#true} is VALID [2022-04-28 08:22:00,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {441789#true} assume !(0 != ~p5~0); {441789#true} is VALID [2022-04-28 08:22:00,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {441789#true} assume !(0 != ~p6~0); {441789#true} is VALID [2022-04-28 08:22:00,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {441789#true} assume !(0 != ~p7~0); {441789#true} is VALID [2022-04-28 08:22:00,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {441789#true} assume !(0 != ~p8~0); {441789#true} is VALID [2022-04-28 08:22:00,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {441789#true} assume 0 != ~p9~0;~lk9~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-28 08:22:00,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-28 08:22:00,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-28 08:22:00,638 INFO L290 TraceCheckUtils]: 19: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-28 08:22:00,638 INFO L290 TraceCheckUtils]: 20: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-28 08:22:00,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-28 08:22:00,639 INFO L290 TraceCheckUtils]: 22: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-28 08:22:00,639 INFO L290 TraceCheckUtils]: 23: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-28 08:22:00,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-28 08:22:00,639 INFO L290 TraceCheckUtils]: 25: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-28 08:22:00,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-28 08:22:00,640 INFO L290 TraceCheckUtils]: 27: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-28 08:22:00,640 INFO L290 TraceCheckUtils]: 28: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-28 08:22:00,640 INFO L290 TraceCheckUtils]: 29: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-28 08:22:00,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-28 08:22:00,641 INFO L290 TraceCheckUtils]: 31: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p9~0; {441794#(= main_~lk9~0 1)} is VALID [2022-04-28 08:22:00,641 INFO L290 TraceCheckUtils]: 32: Hoare triple {441794#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {441790#false} is VALID [2022-04-28 08:22:00,641 INFO L290 TraceCheckUtils]: 33: Hoare triple {441790#false} assume !false; {441790#false} is VALID [2022-04-28 08:22:00,642 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:22:00,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:22:00,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499050780] [2022-04-28 08:22:00,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499050780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:00,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:00,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:00,642 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:22:00,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1587550018] [2022-04-28 08:22:00,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1587550018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:00,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:00,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:00,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606948253] [2022-04-28 08:22:00,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:22:00,643 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:22:00,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:22:00,643 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:22:00,665 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:22:00,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:22:00,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:00,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:22:00,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:22:00,665 INFO L87 Difference]: Start difference. First operand 11273 states and 17159 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:22:21,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:21,276 INFO L93 Difference]: Finished difference Result 19981 states and 31113 transitions. [2022-04-28 08:22:21,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:22:21,276 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:22:21,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:22:21,276 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:22:21,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-28 08:22:21,277 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:22:21,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-28 08:22:21,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-04-28 08:22:21,383 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:22:37,401 INFO L225 Difference]: With dead ends: 19981 [2022-04-28 08:22:37,401 INFO L226 Difference]: Without dead ends: 19979 [2022-04-28 08:22:37,405 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:37,406 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 197 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:22:37,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 100 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:22:37,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19979 states. [2022-04-28 08:22:38,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19979 to 16393. [2022-04-28 08:22:38,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:22:38,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19979 states. Second operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:22:38,783 INFO L74 IsIncluded]: Start isIncluded. First operand 19979 states. Second operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:22:38,804 INFO L87 Difference]: Start difference. First operand 19979 states. Second operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:22:49,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:49,197 INFO L93 Difference]: Finished difference Result 19979 states and 30856 transitions. [2022-04-28 08:22:49,197 INFO L276 IsEmpty]: Start isEmpty. Operand 19979 states and 30856 transitions. [2022-04-28 08:22:49,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:49,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:49,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19979 states. [2022-04-28 08:22:49,252 INFO L87 Difference]: Start difference. First operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19979 states. [2022-04-28 08:22:59,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:59,737 INFO L93 Difference]: Finished difference Result 19979 states and 30856 transitions. [2022-04-28 08:22:59,737 INFO L276 IsEmpty]: Start isEmpty. Operand 19979 states and 30856 transitions. [2022-04-28 08:22:59,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:59,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:59,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:22:59,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:22:59,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:23:12,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16393 states to 16393 states and 24199 transitions. [2022-04-28 08:23:12,523 INFO L78 Accepts]: Start accepts. Automaton has 16393 states and 24199 transitions. Word has length 34 [2022-04-28 08:23:12,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:23:12,523 INFO L495 AbstractCegarLoop]: Abstraction has 16393 states and 24199 transitions. [2022-04-28 08:23:12,523 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:23:12,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16393 states and 24199 transitions. [2022-04-28 08:23:40,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24199 edges. 24199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:23:40,079 INFO L276 IsEmpty]: Start isEmpty. Operand 16393 states and 24199 transitions. [2022-04-28 08:23:40,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 08:23:40,089 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:23:40,089 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:40,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 08:23:40,090 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:23:40,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:23:40,090 INFO L85 PathProgramCache]: Analyzing trace with hash -422905193, now seen corresponding path program 1 times [2022-04-28 08:23:40,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:23:40,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2021443234] [2022-04-28 08:23:40,090 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:23:40,090 INFO L85 PathProgramCache]: Analyzing trace with hash -422905193, now seen corresponding path program 2 times [2022-04-28 08:23:40,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:23:40,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644557168] [2022-04-28 08:23:40,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:23:40,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:23:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:23:40,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:23:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:23:40,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {554513#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {554507#true} is VALID [2022-04-28 08:23:40,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {554507#true} assume true; {554507#true} is VALID [2022-04-28 08:23:40,144 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {554507#true} {554507#true} #285#return; {554507#true} is VALID [2022-04-28 08:23:40,145 INFO L272 TraceCheckUtils]: 0: Hoare triple {554507#true} call ULTIMATE.init(); {554513#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:23:40,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {554513#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {554507#true} is VALID [2022-04-28 08:23:40,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {554507#true} assume true; {554507#true} is VALID [2022-04-28 08:23:40,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554507#true} {554507#true} #285#return; {554507#true} is VALID [2022-04-28 08:23:40,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {554507#true} call #t~ret20 := main(); {554507#true} is VALID [2022-04-28 08:23:40,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {554507#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {554507#true} is VALID [2022-04-28 08:23:40,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {554507#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {554507#true} is VALID [2022-04-28 08:23:40,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {554507#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {554507#true} is VALID [2022-04-28 08:23:40,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {554507#true} assume !(0 != ~p1~0); {554507#true} is VALID [2022-04-28 08:23:40,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {554507#true} assume !(0 != ~p2~0); {554507#true} is VALID [2022-04-28 08:23:40,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {554507#true} assume !(0 != ~p3~0); {554507#true} is VALID [2022-04-28 08:23:40,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {554507#true} assume !(0 != ~p4~0); {554507#true} is VALID [2022-04-28 08:23:40,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {554507#true} assume !(0 != ~p5~0); {554507#true} is VALID [2022-04-28 08:23:40,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {554507#true} assume !(0 != ~p6~0); {554507#true} is VALID [2022-04-28 08:23:40,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {554507#true} assume !(0 != ~p7~0); {554507#true} is VALID [2022-04-28 08:23:40,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {554507#true} assume !(0 != ~p8~0); {554507#true} is VALID [2022-04-28 08:23:40,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {554507#true} assume !(0 != ~p9~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-28 08:23:40,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p10~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-28 08:23:40,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {554512#(= main_~p9~0 0)} is VALID [2022-04-28 08:23:40,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {554512#(= main_~p9~0 0)} is VALID [2022-04-28 08:23:40,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {554512#(= main_~p9~0 0)} is VALID [2022-04-28 08:23:40,148 INFO L290 TraceCheckUtils]: 21: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {554512#(= main_~p9~0 0)} is VALID [2022-04-28 08:23:40,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {554512#(= main_~p9~0 0)} is VALID [2022-04-28 08:23:40,149 INFO L290 TraceCheckUtils]: 23: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p1~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-28 08:23:40,149 INFO L290 TraceCheckUtils]: 24: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p2~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-28 08:23:40,149 INFO L290 TraceCheckUtils]: 25: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p3~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-28 08:23:40,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p4~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-28 08:23:40,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p5~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-28 08:23:40,150 INFO L290 TraceCheckUtils]: 28: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p6~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-28 08:23:40,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p7~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-28 08:23:40,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p8~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-28 08:23:40,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p9~0; {554508#false} is VALID [2022-04-28 08:23:40,151 INFO L290 TraceCheckUtils]: 32: Hoare triple {554508#false} assume 1 != ~lk9~0; {554508#false} is VALID [2022-04-28 08:23:40,152 INFO L290 TraceCheckUtils]: 33: Hoare triple {554508#false} assume !false; {554508#false} is VALID [2022-04-28 08:23:40,152 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:40,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:23:40,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644557168] [2022-04-28 08:23:40,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644557168] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:23:40,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:23:40,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:23:40,153 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:23:40,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2021443234] [2022-04-28 08:23:40,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2021443234] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:23:40,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:23:40,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:23:40,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600252494] [2022-04-28 08:23:40,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:23:40,153 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:40,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:23:40,154 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:40,176 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:40,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:23:40,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:23:40,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:23:40,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:23:40,177 INFO L87 Difference]: Start difference. First operand 16393 states and 24199 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:27:24,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:27:24,411 INFO L93 Difference]: Finished difference Result 38157 states and 56713 transitions. [2022-04-28 08:27:24,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:27:24,411 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:27:24,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:27:24,411 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:27:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2022-04-28 08:27:24,412 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:27:24,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2022-04-28 08:27:24,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 258 transitions. [2022-04-28 08:27:24,575 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:27:45,321 INFO L225 Difference]: With dead ends: 38157 [2022-04-28 08:27:45,321 INFO L226 Difference]: Without dead ends: 22027 [2022-04-28 08:27:45,341 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:27:45,343 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 175 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:27:45,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 151 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:27:45,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22027 states. [2022-04-28 08:27:47,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22027 to 22025. [2022-04-28 08:27:47,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:27:47,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22027 states. Second operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:27:47,463 INFO L74 IsIncluded]: Start isIncluded. First operand 22027 states. Second operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:27:47,490 INFO L87 Difference]: Start difference. First operand 22027 states. Second operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:28:01,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:28:01,361 INFO L93 Difference]: Finished difference Result 22027 states and 32520 transitions. [2022-04-28 08:28:01,361 INFO L276 IsEmpty]: Start isEmpty. Operand 22027 states and 32520 transitions. [2022-04-28 08:28:01,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:28:01,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:28:01,403 INFO L74 IsIncluded]: Start isIncluded. First operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22027 states. [2022-04-28 08:28:01,429 INFO L87 Difference]: Start difference. First operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22027 states. [2022-04-28 08:28:14,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:28:14,800 INFO L93 Difference]: Finished difference Result 22027 states and 32520 transitions. [2022-04-28 08:28:14,800 INFO L276 IsEmpty]: Start isEmpty. Operand 22027 states and 32520 transitions. [2022-04-28 08:28:14,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:28:14,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:28:14,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:28:14,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:28:14,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:28:36,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22025 states to 22025 states and 32519 transitions. [2022-04-28 08:28:36,411 INFO L78 Accepts]: Start accepts. Automaton has 22025 states and 32519 transitions. Word has length 34 [2022-04-28 08:28:36,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:28:36,411 INFO L495 AbstractCegarLoop]: Abstraction has 22025 states and 32519 transitions. [2022-04-28 08:28:36,411 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:28:36,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22025 states and 32519 transitions. [2022-04-28 08:29:14,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32519 edges. 32519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:29:14,723 INFO L276 IsEmpty]: Start isEmpty. Operand 22025 states and 32519 transitions. [2022-04-28 08:29:14,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 08:29:14,734 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:29:14,734 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, 1] [2022-04-28 08:29:14,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 08:29:14,734 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:29:14,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:29:14,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1463999138, now seen corresponding path program 1 times [2022-04-28 08:29:14,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:29:14,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [374067558] [2022-04-28 08:29:14,735 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:29:14,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1463999138, now seen corresponding path program 2 times [2022-04-28 08:29:14,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:29:14,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321656522] [2022-04-28 08:29:14,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:29:14,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:29:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:29:14,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:29:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:29:14,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {718943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {718937#true} is VALID [2022-04-28 08:29:14,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {718937#true} assume true; {718937#true} is VALID [2022-04-28 08:29:14,769 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {718937#true} {718937#true} #285#return; {718937#true} is VALID [2022-04-28 08:29:14,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {718937#true} call ULTIMATE.init(); {718943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:29:14,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {718943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {718937#true} is VALID [2022-04-28 08:29:14,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {718937#true} assume true; {718937#true} is VALID [2022-04-28 08:29:14,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {718937#true} {718937#true} #285#return; {718937#true} is VALID [2022-04-28 08:29:14,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {718937#true} call #t~ret20 := main(); {718937#true} is VALID [2022-04-28 08:29:14,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {718937#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {718937#true} is VALID [2022-04-28 08:29:14,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {718937#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {718937#true} is VALID [2022-04-28 08:29:14,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {718937#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {718937#true} is VALID [2022-04-28 08:29:14,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {718937#true} assume !(0 != ~p1~0); {718937#true} is VALID [2022-04-28 08:29:14,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {718937#true} assume !(0 != ~p2~0); {718937#true} is VALID [2022-04-28 08:29:14,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {718937#true} assume !(0 != ~p3~0); {718937#true} is VALID [2022-04-28 08:29:14,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {718937#true} assume !(0 != ~p4~0); {718937#true} is VALID [2022-04-28 08:29:14,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {718937#true} assume !(0 != ~p5~0); {718937#true} is VALID [2022-04-28 08:29:14,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {718937#true} assume !(0 != ~p6~0); {718937#true} is VALID [2022-04-28 08:29:14,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {718937#true} assume !(0 != ~p7~0); {718937#true} is VALID [2022-04-28 08:29:14,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {718937#true} assume !(0 != ~p8~0); {718937#true} is VALID [2022-04-28 08:29:14,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {718937#true} assume 0 != ~p9~0;~lk9~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:29:14,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:29:14,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {718942#(not (= main_~p9~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:29:14,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {718942#(not (= main_~p9~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:29:14,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {718942#(not (= main_~p9~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:29:14,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {718942#(not (= main_~p9~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:29:14,774 INFO L290 TraceCheckUtils]: 22: Hoare triple {718942#(not (= main_~p9~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:29:14,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:29:14,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:29:14,775 INFO L290 TraceCheckUtils]: 25: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:29:14,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:29:14,775 INFO L290 TraceCheckUtils]: 27: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:29:14,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:29:14,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:29:14,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:29:14,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {718938#false} is VALID [2022-04-28 08:29:14,777 INFO L290 TraceCheckUtils]: 32: Hoare triple {718938#false} assume 0 != ~p10~0; {718938#false} is VALID [2022-04-28 08:29:14,777 INFO L290 TraceCheckUtils]: 33: Hoare triple {718938#false} assume 1 != ~lk10~0; {718938#false} is VALID [2022-04-28 08:29:14,777 INFO L290 TraceCheckUtils]: 34: Hoare triple {718938#false} assume !false; {718938#false} is VALID [2022-04-28 08:29:14,777 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:29:14,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:29:14,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321656522] [2022-04-28 08:29:14,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321656522] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:29:14,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:29:14,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:29:14,778 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:29:14,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [374067558] [2022-04-28 08:29:14,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [374067558] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:29:14,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:29:14,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:29:14,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698129543] [2022-04-28 08:29:14,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:29:14,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-28 08:29:14,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:29:14,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:29:14,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:29:14,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:29:14,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:29:14,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:29:14,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:29:14,805 INFO L87 Difference]: Start difference. First operand 22025 states and 32519 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:30:51,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:30:51,287 INFO L93 Difference]: Finished difference Result 33037 states and 48649 transitions. [2022-04-28 08:30:51,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:30:51,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-28 08:30:51,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:30:51,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:30:51,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2022-04-28 08:30:51,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:30:51,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2022-04-28 08:30:51,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 253 transitions. [2022-04-28 08:30:51,444 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:31:14,659 INFO L225 Difference]: With dead ends: 33037 [2022-04-28 08:31:14,659 INFO L226 Difference]: Without dead ends: 22283 [2022-04-28 08:31:14,676 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:31:14,676 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 188 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:31:14,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 139 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:31:14,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22283 states. [2022-04-28 08:31:16,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22283 to 22281. [2022-04-28 08:31:16,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:31:16,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22283 states. Second operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:31:16,827 INFO L74 IsIncluded]: Start isIncluded. First operand 22283 states. Second operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:31:16,859 INFO L87 Difference]: Start difference. First operand 22283 states. Second operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:31:30,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:31:30,290 INFO L93 Difference]: Finished difference Result 22283 states and 32520 transitions. [2022-04-28 08:31:30,290 INFO L276 IsEmpty]: Start isEmpty. Operand 22283 states and 32520 transitions. [2022-04-28 08:31:30,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:31:30,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:31:30,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22283 states. [2022-04-28 08:31:30,365 INFO L87 Difference]: Start difference. First operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22283 states. [2022-04-28 08:31:42,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:31:42,327 INFO L93 Difference]: Finished difference Result 22283 states and 32520 transitions. [2022-04-28 08:31:42,327 INFO L276 IsEmpty]: Start isEmpty. Operand 22283 states and 32520 transitions. [2022-04-28 08:31:42,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:31:42,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:31:42,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:31:42,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:31:42,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)