/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_11.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 11:17:08,867 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:17:08,869 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:17:08,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:17:08,899 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:17:08,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:17:08,900 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:17:08,902 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:17:08,903 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:17:08,904 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:17:08,905 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:17:08,906 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:17:08,906 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:17:08,907 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:17:08,908 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:17:08,909 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:17:08,909 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:17:08,910 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:17:08,912 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:17:08,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:17:08,915 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:17:08,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:17:08,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:17:08,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:17:08,918 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:17:08,921 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:17:08,921 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:17:08,921 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:17:08,922 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:17:08,922 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:17:08,923 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:17:08,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:17:08,924 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:17:08,924 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:17:08,925 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:17:08,926 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:17:08,926 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:17:08,926 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:17:08,927 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:17:08,927 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:17:08,927 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:17:08,928 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:17:08,929 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 11:17:08,936 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:17:08,937 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:17:08,938 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:17:08,938 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:17:08,938 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:17:08,938 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:17:08,938 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:17:08,938 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:17:08,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:17:08,939 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:17:08,939 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:17:08,939 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:17:08,939 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:17:08,939 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:17:08,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:17:08,939 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:17:08,940 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:17:08,940 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:17:08,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:17:08,940 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:17:08,940 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:17:08,940 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:17:08,940 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:17:08,940 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:17:08,941 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:17:08,941 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 11:17:09,177 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:17:09,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:17:09,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:17:09,204 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:17:09,205 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:17:09,206 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_11.c [2022-04-15 11:17:09,256 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fda27ab4e/95becd255c194909b31db603f8b4f552/FLAGea3cac4ce [2022-04-15 11:17:09,629 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:17:09,630 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11.c [2022-04-15 11:17:09,637 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fda27ab4e/95becd255c194909b31db603f8b4f552/FLAGea3cac4ce [2022-04-15 11:17:09,649 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fda27ab4e/95becd255c194909b31db603f8b4f552 [2022-04-15 11:17:09,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:17:09,654 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:17:09,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:17:09,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:17:09,659 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:17:09,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:17:09" (1/1) ... [2022-04-15 11:17:09,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f52ca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:09, skipping insertion in model container [2022-04-15 11:17:09,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:17:09" (1/1) ... [2022-04-15 11:17:09,672 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:17:09,687 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:17:09,869 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_11.c[4246,4259] [2022-04-15 11:17:09,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:17:09,889 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:17:09,943 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_11.c[4246,4259] [2022-04-15 11:17:09,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:17:09,955 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:17:09,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:09 WrapperNode [2022-04-15 11:17:09,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:17:09,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:17:09,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:17:09,956 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:17:09,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:09" (1/1) ... [2022-04-15 11:17:09,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:09" (1/1) ... [2022-04-15 11:17:09,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:09" (1/1) ... [2022-04-15 11:17:09,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:09" (1/1) ... [2022-04-15 11:17:09,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:09" (1/1) ... [2022-04-15 11:17:09,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:09" (1/1) ... [2022-04-15 11:17:09,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:09" (1/1) ... [2022-04-15 11:17:09,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:17:09,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:17:09,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:17:09,991 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:17:09,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:09" (1/1) ... [2022-04-15 11:17:10,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:17:10,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:17:10,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 11:17:10,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 11:17:10,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:17:10,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:17:10,071 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:17:10,071 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:17:10,071 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:17:10,071 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:17:10,071 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:17:10,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:17:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:17:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:17:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:17:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:17:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:17:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:17:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:17:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:17:10,130 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:17:10,131 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:17:10,378 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:17:10,386 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:17:10,386 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:17:10,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:17:10 BoogieIcfgContainer [2022-04-15 11:17:10,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:17:10,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:17:10,389 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:17:10,392 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:17:10,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:17:09" (1/3) ... [2022-04-15 11:17:10,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d53e8a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:17:10, skipping insertion in model container [2022-04-15 11:17:10,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:09" (2/3) ... [2022-04-15 11:17:10,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d53e8a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:17:10, skipping insertion in model container [2022-04-15 11:17:10,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:17:10" (3/3) ... [2022-04-15 11:17:10,396 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2022-04-15 11:17:10,401 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:17:10,401 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:17:10,436 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:17:10,441 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 11:17:10,442 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:17:10,458 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 42 states have (on average 1.880952380952381) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 11:17:10,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 11:17:10,465 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:10,466 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:10,466 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:10,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:10,475 INFO L85 PathProgramCache]: Analyzing trace with hash 284629267, now seen corresponding path program 1 times [2022-04-15 11:17:10,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:10,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1070756978] [2022-04-15 11:17:10,490 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:10,491 INFO L85 PathProgramCache]: Analyzing trace with hash 284629267, now seen corresponding path program 2 times [2022-04-15 11:17:10,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:10,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690741508] [2022-04-15 11:17:10,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:10,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:10,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:10,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {57#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {51#true} is VALID [2022-04-15 11:17:10,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#true} assume true; {51#true} is VALID [2022-04-15 11:17:10,788 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51#true} {51#true} #217#return; {51#true} is VALID [2022-04-15 11:17:10,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {51#true} call ULTIMATE.init(); {57#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:10,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {57#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {51#true} is VALID [2022-04-15 11:17:10,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {51#true} assume true; {51#true} is VALID [2022-04-15 11:17:10,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51#true} {51#true} #217#return; {51#true} is VALID [2022-04-15 11:17:10,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {51#true} call #t~ret16 := main(); {51#true} is VALID [2022-04-15 11:17:10,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {51#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;havoc ~cond~0; {51#true} is VALID [2022-04-15 11:17:10,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {51#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {51#true} is VALID [2022-04-15 11:17:10,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {51#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; {51#true} is VALID [2022-04-15 11:17:10,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {51#true} assume 0 != ~p1~0;~lk1~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:10,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {56#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {56#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:10,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:10,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:10,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:10,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:10,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:10,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:10,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:10,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {56#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {56#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:10,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:10,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p1~0; {56#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:10,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {56#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {52#false} is VALID [2022-04-15 11:17:10,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {52#false} assume !false; {52#false} is VALID [2022-04-15 11:17:10,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:10,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:10,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690741508] [2022-04-15 11:17:10,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690741508] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:10,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:10,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:10,810 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:10,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1070756978] [2022-04-15 11:17:10,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1070756978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:10,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:10,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:10,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468946597] [2022-04-15 11:17:10,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:10,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 11:17:10,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:10,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:10,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:10,859 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:10,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:10,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:10,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:10,887 INFO L87 Difference]: Start difference. First operand has 48 states, 42 states have (on average 1.880952380952381) internal successors, (79), 43 states have internal predecessors, (79), 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 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:11,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:11,324 INFO L93 Difference]: Finished difference Result 94 states and 163 transitions. [2022-04-15 11:17:11,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:11,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 11:17:11,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:11,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:11,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-15 11:17:11,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:11,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-15 11:17:11,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-15 11:17:11,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:11,514 INFO L225 Difference]: With dead ends: 94 [2022-04-15 11:17:11,514 INFO L226 Difference]: Without dead ends: 79 [2022-04-15 11:17:11,517 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:11,520 INFO L913 BasicCegarLoop]: 86 mSDtfsCounter, 191 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:11,521 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 95 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:17:11,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-15 11:17:11,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 55. [2022-04-15 11:17:11,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:11,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:11,558 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:11,559 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:11,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:11,565 INFO L93 Difference]: Finished difference Result 79 states and 141 transitions. [2022-04-15 11:17:11,565 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 141 transitions. [2022-04-15 11:17:11,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:11,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:11,567 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-15 11:17:11,568 INFO L87 Difference]: Start difference. First operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-15 11:17:11,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:11,573 INFO L93 Difference]: Finished difference Result 79 states and 141 transitions. [2022-04-15 11:17:11,573 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 141 transitions. [2022-04-15 11:17:11,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:11,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:11,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:11,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:11,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 98 transitions. [2022-04-15 11:17:11,580 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 98 transitions. Word has length 22 [2022-04-15 11:17:11,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:11,580 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 98 transitions. [2022-04-15 11:17:11,580 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:11,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 98 transitions. [2022-04-15 11:17:11,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:11,673 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 98 transitions. [2022-04-15 11:17:11,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 11:17:11,674 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:11,674 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:11,675 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:17:11,675 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:11,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:11,676 INFO L85 PathProgramCache]: Analyzing trace with hash -726487983, now seen corresponding path program 1 times [2022-04-15 11:17:11,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:11,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [635874749] [2022-04-15 11:17:11,677 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:11,677 INFO L85 PathProgramCache]: Analyzing trace with hash -726487983, now seen corresponding path program 2 times [2022-04-15 11:17:11,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:11,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444742649] [2022-04-15 11:17:11,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:11,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:11,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:11,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {525#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {519#true} is VALID [2022-04-15 11:17:11,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {519#true} assume true; {519#true} is VALID [2022-04-15 11:17:11,744 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {519#true} {519#true} #217#return; {519#true} is VALID [2022-04-15 11:17:11,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {519#true} call ULTIMATE.init(); {525#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:11,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {525#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {519#true} is VALID [2022-04-15 11:17:11,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {519#true} assume true; {519#true} is VALID [2022-04-15 11:17:11,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {519#true} {519#true} #217#return; {519#true} is VALID [2022-04-15 11:17:11,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {519#true} call #t~ret16 := main(); {519#true} is VALID [2022-04-15 11:17:11,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {519#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;havoc ~cond~0; {519#true} is VALID [2022-04-15 11:17:11,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {519#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {519#true} is VALID [2022-04-15 11:17:11,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {519#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; {519#true} is VALID [2022-04-15 11:17:11,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {519#true} assume !(0 != ~p1~0); {524#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:11,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {524#(= main_~p1~0 0)} assume !(0 != ~p2~0); {524#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:11,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:11,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:11,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:11,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:11,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:11,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:11,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:11,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {524#(= main_~p1~0 0)} assume !(0 != ~p10~0); {524#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:11,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:11,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p1~0; {520#false} is VALID [2022-04-15 11:17:11,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {520#false} assume 1 != ~lk1~0; {520#false} is VALID [2022-04-15 11:17:11,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {520#false} assume !false; {520#false} is VALID [2022-04-15 11:17:11,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:11,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:11,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444742649] [2022-04-15 11:17:11,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444742649] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:11,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:11,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:11,754 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:11,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [635874749] [2022-04-15 11:17:11,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [635874749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:11,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:11,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:11,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222824475] [2022-04-15 11:17:11,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:11,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 11:17:11,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:11,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:11,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:11,773 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:11,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:11,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:11,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:11,774 INFO L87 Difference]: Start difference. First operand 55 states and 98 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:11,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:11,986 INFO L93 Difference]: Finished difference Result 128 states and 233 transitions. [2022-04-15 11:17:11,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:11,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 11:17:11,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:11,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:11,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2022-04-15 11:17:11,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:11,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2022-04-15 11:17:11,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 210 transitions. [2022-04-15 11:17:12,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:12,166 INFO L225 Difference]: With dead ends: 128 [2022-04-15 11:17:12,166 INFO L226 Difference]: Without dead ends: 79 [2022-04-15 11:17:12,167 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:12,170 INFO L913 BasicCegarLoop]: 96 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:12,171 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 103 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:17:12,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-15 11:17:12,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2022-04-15 11:17:12,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:12,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,195 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,197 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:12,201 INFO L93 Difference]: Finished difference Result 79 states and 139 transitions. [2022-04-15 11:17:12,201 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2022-04-15 11:17:12,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:12,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:12,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-15 11:17:12,209 INFO L87 Difference]: Start difference. First operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-15 11:17:12,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:12,214 INFO L93 Difference]: Finished difference Result 79 states and 139 transitions. [2022-04-15 11:17:12,215 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2022-04-15 11:17:12,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:12,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:12,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:12,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:12,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 138 transitions. [2022-04-15 11:17:12,223 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 138 transitions. Word has length 22 [2022-04-15 11:17:12,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:12,224 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 138 transitions. [2022-04-15 11:17:12,224 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 138 transitions. [2022-04-15 11:17:12,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:12,347 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 138 transitions. [2022-04-15 11:17:12,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 11:17:12,349 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:12,349 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:12,349 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:17:12,349 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:12,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:12,350 INFO L85 PathProgramCache]: Analyzing trace with hash 233785744, now seen corresponding path program 1 times [2022-04-15 11:17:12,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:12,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1926018555] [2022-04-15 11:17:12,356 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:12,356 INFO L85 PathProgramCache]: Analyzing trace with hash 233785744, now seen corresponding path program 2 times [2022-04-15 11:17:12,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:12,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568515541] [2022-04-15 11:17:12,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:12,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:12,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:12,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {1105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1099#true} is VALID [2022-04-15 11:17:12,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {1099#true} assume true; {1099#true} is VALID [2022-04-15 11:17:12,467 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1099#true} {1099#true} #217#return; {1099#true} is VALID [2022-04-15 11:17:12,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {1099#true} call ULTIMATE.init(); {1105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:12,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {1105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1099#true} is VALID [2022-04-15 11:17:12,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {1099#true} assume true; {1099#true} is VALID [2022-04-15 11:17:12,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1099#true} {1099#true} #217#return; {1099#true} is VALID [2022-04-15 11:17:12,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {1099#true} call #t~ret16 := main(); {1099#true} is VALID [2022-04-15 11:17:12,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {1099#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;havoc ~cond~0; {1099#true} is VALID [2022-04-15 11:17:12,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {1099#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {1099#true} is VALID [2022-04-15 11:17:12,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {1099#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; {1099#true} is VALID [2022-04-15 11:17:12,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {1099#true} assume 0 != ~p1~0;~lk1~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:12,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {1104#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {1104#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:12,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:12,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:12,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:12,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:12,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:12,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:12,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:12,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {1104#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {1104#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:12,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:12,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {1104#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1100#false} is VALID [2022-04-15 11:17:12,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {1100#false} assume 0 != ~p2~0; {1100#false} is VALID [2022-04-15 11:17:12,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {1100#false} assume 1 != ~lk2~0; {1100#false} is VALID [2022-04-15 11:17:12,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {1100#false} assume !false; {1100#false} is VALID [2022-04-15 11:17:12,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:12,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:12,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568515541] [2022-04-15 11:17:12,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568515541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:12,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:12,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:12,478 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:12,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1926018555] [2022-04-15 11:17:12,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1926018555] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:12,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:12,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:12,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062580050] [2022-04-15 11:17:12,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:12,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 11:17:12,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:12,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:12,496 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:12,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:12,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:12,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:12,497 INFO L87 Difference]: Start difference. First operand 77 states and 138 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:12,750 INFO L93 Difference]: Finished difference Result 118 states and 208 transitions. [2022-04-15 11:17:12,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:12,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 11:17:12,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:12,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-15 11:17:12,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-15 11:17:12,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 205 transitions. [2022-04-15 11:17:12,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:12,903 INFO L225 Difference]: With dead ends: 118 [2022-04-15 11:17:12,903 INFO L226 Difference]: Without dead ends: 82 [2022-04-15 11:17:12,904 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:12,906 INFO L913 BasicCegarLoop]: 116 mSDtfsCounter, 144 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:12,911 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 123 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:17:12,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-15 11:17:12,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2022-04-15 11:17:12,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:12,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,927 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,928 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:12,931 INFO L93 Difference]: Finished difference Result 82 states and 141 transitions. [2022-04-15 11:17:12,931 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 141 transitions. [2022-04-15 11:17:12,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:12,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:12,931 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 82 states. [2022-04-15 11:17:12,932 INFO L87 Difference]: Start difference. First operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 82 states. [2022-04-15 11:17:12,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:12,935 INFO L93 Difference]: Finished difference Result 82 states and 141 transitions. [2022-04-15 11:17:12,935 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 141 transitions. [2022-04-15 11:17:12,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:12,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:12,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:12,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:12,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 140 transitions. [2022-04-15 11:17:12,939 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 140 transitions. Word has length 23 [2022-04-15 11:17:12,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:12,939 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 140 transitions. [2022-04-15 11:17:12,940 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 140 transitions. [2022-04-15 11:17:13,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:13,081 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 140 transitions. [2022-04-15 11:17:13,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 11:17:13,081 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:13,081 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:13,081 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:17:13,084 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:13,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:13,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1046077934, now seen corresponding path program 1 times [2022-04-15 11:17:13,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:13,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1268214196] [2022-04-15 11:17:13,090 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:13,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1046077934, now seen corresponding path program 2 times [2022-04-15 11:17:13,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:13,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838549512] [2022-04-15 11:17:13,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:13,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:13,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:13,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {1677#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1671#true} is VALID [2022-04-15 11:17:13,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {1671#true} assume true; {1671#true} is VALID [2022-04-15 11:17:13,186 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1671#true} {1671#true} #217#return; {1671#true} is VALID [2022-04-15 11:17:13,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {1671#true} call ULTIMATE.init(); {1677#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:13,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {1677#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1671#true} is VALID [2022-04-15 11:17:13,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {1671#true} assume true; {1671#true} is VALID [2022-04-15 11:17:13,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1671#true} {1671#true} #217#return; {1671#true} is VALID [2022-04-15 11:17:13,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {1671#true} call #t~ret16 := main(); {1671#true} is VALID [2022-04-15 11:17:13,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {1671#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;havoc ~cond~0; {1671#true} is VALID [2022-04-15 11:17:13,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {1671#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {1671#true} is VALID [2022-04-15 11:17:13,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {1671#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; {1671#true} is VALID [2022-04-15 11:17:13,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {1671#true} assume !(0 != ~p1~0); {1671#true} is VALID [2022-04-15 11:17:13,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {1671#true} assume !(0 != ~p2~0); {1676#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:13,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:13,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:13,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:13,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:13,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:13,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:13,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:13,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {1676#(= main_~p2~0 0)} assume !(0 != ~p10~0); {1676#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:13,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:13,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {1676#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1676#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:13,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p2~0; {1672#false} is VALID [2022-04-15 11:17:13,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {1672#false} assume 1 != ~lk2~0; {1672#false} is VALID [2022-04-15 11:17:13,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {1672#false} assume !false; {1672#false} is VALID [2022-04-15 11:17:13,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:13,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:13,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838549512] [2022-04-15 11:17:13,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838549512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:13,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:13,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:13,193 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:13,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1268214196] [2022-04-15 11:17:13,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1268214196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:13,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:13,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:13,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117687860] [2022-04-15 11:17:13,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:13,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 11:17:13,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:13,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:13,211 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:13,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:13,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:13,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:13,212 INFO L87 Difference]: Start difference. First operand 80 states and 140 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:13,426 INFO L93 Difference]: Finished difference Result 220 states and 396 transitions. [2022-04-15 11:17:13,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:13,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 11:17:13,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:13,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2022-04-15 11:17:13,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2022-04-15 11:17:13,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 208 transitions. [2022-04-15 11:17:13,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:13,596 INFO L225 Difference]: With dead ends: 220 [2022-04-15 11:17:13,596 INFO L226 Difference]: Without dead ends: 149 [2022-04-15 11:17:13,597 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:13,597 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 180 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:13,598 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 85 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:13,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-15 11:17:13,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2022-04-15 11:17:13,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:13,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,614 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,614 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:13,619 INFO L93 Difference]: Finished difference Result 149 states and 262 transitions. [2022-04-15 11:17:13,619 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 262 transitions. [2022-04-15 11:17:13,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:13,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:13,620 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 149 states. [2022-04-15 11:17:13,621 INFO L87 Difference]: Start difference. First operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 149 states. [2022-04-15 11:17:13,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:13,626 INFO L93 Difference]: Finished difference Result 149 states and 262 transitions. [2022-04-15 11:17:13,626 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 262 transitions. [2022-04-15 11:17:13,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:13,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:13,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:13,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:13,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 261 transitions. [2022-04-15 11:17:13,633 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 261 transitions. Word has length 23 [2022-04-15 11:17:13,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:13,633 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 261 transitions. [2022-04-15 11:17:13,633 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 261 transitions. [2022-04-15 11:17:13,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:13,889 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 261 transitions. [2022-04-15 11:17:13,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 11:17:13,889 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:13,889 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:13,889 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:17:13,890 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:13,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:13,890 INFO L85 PathProgramCache]: Analyzing trace with hash -34960684, now seen corresponding path program 1 times [2022-04-15 11:17:13,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:13,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1223317021] [2022-04-15 11:17:13,891 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:13,891 INFO L85 PathProgramCache]: Analyzing trace with hash -34960684, now seen corresponding path program 2 times [2022-04-15 11:17:13,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:13,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986958930] [2022-04-15 11:17:13,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:13,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:13,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:13,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {2721#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2715#true} is VALID [2022-04-15 11:17:13,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {2715#true} assume true; {2715#true} is VALID [2022-04-15 11:17:13,937 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2715#true} {2715#true} #217#return; {2715#true} is VALID [2022-04-15 11:17:13,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {2715#true} call ULTIMATE.init(); {2721#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:13,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {2721#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2715#true} is VALID [2022-04-15 11:17:13,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {2715#true} assume true; {2715#true} is VALID [2022-04-15 11:17:13,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2715#true} {2715#true} #217#return; {2715#true} is VALID [2022-04-15 11:17:13,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {2715#true} call #t~ret16 := main(); {2715#true} is VALID [2022-04-15 11:17:13,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {2715#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;havoc ~cond~0; {2715#true} is VALID [2022-04-15 11:17:13,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {2715#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {2715#true} is VALID [2022-04-15 11:17:13,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {2715#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; {2715#true} is VALID [2022-04-15 11:17:13,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {2715#true} assume !(0 != ~p1~0); {2715#true} is VALID [2022-04-15 11:17:13,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {2715#true} assume 0 != ~p2~0;~lk2~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:13,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:13,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:13,940 INFO L290 TraceCheckUtils]: 12: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:13,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:13,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:13,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:13,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:13,942 INFO L290 TraceCheckUtils]: 17: Hoare triple {2720#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {2720#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:13,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:13,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {2720#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {2720#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:13,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p2~0; {2720#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:13,943 INFO L290 TraceCheckUtils]: 21: Hoare triple {2720#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {2716#false} is VALID [2022-04-15 11:17:13,943 INFO L290 TraceCheckUtils]: 22: Hoare triple {2716#false} assume !false; {2716#false} is VALID [2022-04-15 11:17:13,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:13,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:13,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986958930] [2022-04-15 11:17:13,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986958930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:13,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:13,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:13,945 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:13,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1223317021] [2022-04-15 11:17:13,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1223317021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:13,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:13,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:13,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600799900] [2022-04-15 11:17:13,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:13,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 11:17:13,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:13,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:13,961 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:13,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:13,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:13,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:13,962 INFO L87 Difference]: Start difference. First operand 147 states and 261 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:14,161 INFO L93 Difference]: Finished difference Result 191 states and 339 transitions. [2022-04-15 11:17:14,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:14,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 11:17:14,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:14,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-15 11:17:14,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-15 11:17:14,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 136 transitions. [2022-04-15 11:17:14,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:14,283 INFO L225 Difference]: With dead ends: 191 [2022-04-15 11:17:14,283 INFO L226 Difference]: Without dead ends: 189 [2022-04-15 11:17:14,283 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:14,284 INFO L913 BasicCegarLoop]: 133 mSDtfsCounter, 117 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:14,284 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 140 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:14,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-15 11:17:14,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 147. [2022-04-15 11:17:14,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:14,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,299 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,300 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:14,309 INFO L93 Difference]: Finished difference Result 189 states and 336 transitions. [2022-04-15 11:17:14,309 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 336 transitions. [2022-04-15 11:17:14,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:14,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:14,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 189 states. [2022-04-15 11:17:14,310 INFO L87 Difference]: Start difference. First operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 189 states. [2022-04-15 11:17:14,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:14,320 INFO L93 Difference]: Finished difference Result 189 states and 336 transitions. [2022-04-15 11:17:14,320 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 336 transitions. [2022-04-15 11:17:14,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:14,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:14,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:14,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:14,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 259 transitions. [2022-04-15 11:17:14,328 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 259 transitions. Word has length 23 [2022-04-15 11:17:14,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:14,328 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 259 transitions. [2022-04-15 11:17:14,328 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 259 transitions. [2022-04-15 11:17:14,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:14,581 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 259 transitions. [2022-04-15 11:17:14,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 11:17:14,582 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:14,582 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:14,582 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:17:14,582 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:14,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:14,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1931535814, now seen corresponding path program 1 times [2022-04-15 11:17:14,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:14,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [483030305] [2022-04-15 11:17:14,584 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:14,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1931535814, now seen corresponding path program 2 times [2022-04-15 11:17:14,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:14,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296330590] [2022-04-15 11:17:14,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:14,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:14,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:14,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {3787#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3781#true} is VALID [2022-04-15 11:17:14,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {3781#true} assume true; {3781#true} is VALID [2022-04-15 11:17:14,651 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3781#true} {3781#true} #217#return; {3781#true} is VALID [2022-04-15 11:17:14,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {3781#true} call ULTIMATE.init(); {3787#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:14,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {3787#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3781#true} is VALID [2022-04-15 11:17:14,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {3781#true} assume true; {3781#true} is VALID [2022-04-15 11:17:14,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3781#true} {3781#true} #217#return; {3781#true} is VALID [2022-04-15 11:17:14,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {3781#true} call #t~ret16 := main(); {3781#true} is VALID [2022-04-15 11:17:14,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {3781#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;havoc ~cond~0; {3781#true} is VALID [2022-04-15 11:17:14,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {3781#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {3781#true} is VALID [2022-04-15 11:17:14,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {3781#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; {3781#true} is VALID [2022-04-15 11:17:14,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {3781#true} assume !(0 != ~p1~0); {3781#true} is VALID [2022-04-15 11:17:14,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {3781#true} assume !(0 != ~p2~0); {3781#true} is VALID [2022-04-15 11:17:14,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {3781#true} assume 0 != ~p3~0;~lk3~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:14,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:14,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:14,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:14,655 INFO L290 TraceCheckUtils]: 14: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:14,655 INFO L290 TraceCheckUtils]: 15: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:14,655 INFO L290 TraceCheckUtils]: 16: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:14,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {3786#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {3786#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:14,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:14,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {3786#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {3786#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:14,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {3786#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {3786#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:14,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p3~0; {3786#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:14,657 INFO L290 TraceCheckUtils]: 22: Hoare triple {3786#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {3782#false} is VALID [2022-04-15 11:17:14,658 INFO L290 TraceCheckUtils]: 23: Hoare triple {3782#false} assume !false; {3782#false} is VALID [2022-04-15 11:17:14,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:14,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:14,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296330590] [2022-04-15 11:17:14,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296330590] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:14,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:14,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:14,659 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:14,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [483030305] [2022-04-15 11:17:14,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [483030305] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:14,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:14,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:14,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978141960] [2022-04-15 11:17:14,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:14,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 11:17:14,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:14,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:14,676 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:14,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:14,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:14,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:14,676 INFO L87 Difference]: Start difference. First operand 147 states and 259 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:14,899 INFO L93 Difference]: Finished difference Result 275 states and 491 transitions. [2022-04-15 11:17:14,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:14,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 11:17:14,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:14,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-15 11:17:14,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-15 11:17:14,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 135 transitions. [2022-04-15 11:17:15,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:15,026 INFO L225 Difference]: With dead ends: 275 [2022-04-15 11:17:15,026 INFO L226 Difference]: Without dead ends: 273 [2022-04-15 11:17:15,027 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:15,027 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 171 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:15,028 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 82 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:17:15,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-04-15 11:17:15,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 199. [2022-04-15 11:17:15,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:15,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 273 states. Second operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,046 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,047 INFO L87 Difference]: Start difference. First operand 273 states. Second operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:15,055 INFO L93 Difference]: Finished difference Result 273 states and 486 transitions. [2022-04-15 11:17:15,055 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 486 transitions. [2022-04-15 11:17:15,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:15,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:15,057 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 273 states. [2022-04-15 11:17:15,057 INFO L87 Difference]: Start difference. First operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 273 states. [2022-04-15 11:17:15,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:15,065 INFO L93 Difference]: Finished difference Result 273 states and 486 transitions. [2022-04-15 11:17:15,065 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 486 transitions. [2022-04-15 11:17:15,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:15,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:15,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:15,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:15,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 349 transitions. [2022-04-15 11:17:15,072 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 349 transitions. Word has length 24 [2022-04-15 11:17:15,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:15,073 INFO L478 AbstractCegarLoop]: Abstraction has 199 states and 349 transitions. [2022-04-15 11:17:15,073 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 199 states and 349 transitions. [2022-04-15 11:17:15,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 349 edges. 349 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:15,418 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 349 transitions. [2022-04-15 11:17:15,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 11:17:15,419 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:15,419 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:15,419 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:17:15,419 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:15,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:15,419 INFO L85 PathProgramCache]: Analyzing trace with hash 920418564, now seen corresponding path program 1 times [2022-04-15 11:17:15,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:15,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1491607307] [2022-04-15 11:17:15,420 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:15,420 INFO L85 PathProgramCache]: Analyzing trace with hash 920418564, now seen corresponding path program 2 times [2022-04-15 11:17:15,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:15,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608243643] [2022-04-15 11:17:15,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:15,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:15,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:15,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {5293#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {5287#true} is VALID [2022-04-15 11:17:15,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {5287#true} assume true; {5287#true} is VALID [2022-04-15 11:17:15,485 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5287#true} {5287#true} #217#return; {5287#true} is VALID [2022-04-15 11:17:15,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {5287#true} call ULTIMATE.init(); {5293#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:15,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {5293#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {5287#true} is VALID [2022-04-15 11:17:15,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {5287#true} assume true; {5287#true} is VALID [2022-04-15 11:17:15,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5287#true} {5287#true} #217#return; {5287#true} is VALID [2022-04-15 11:17:15,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {5287#true} call #t~ret16 := main(); {5287#true} is VALID [2022-04-15 11:17:15,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {5287#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;havoc ~cond~0; {5287#true} is VALID [2022-04-15 11:17:15,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {5287#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {5287#true} is VALID [2022-04-15 11:17:15,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {5287#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; {5287#true} is VALID [2022-04-15 11:17:15,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {5287#true} assume !(0 != ~p1~0); {5287#true} is VALID [2022-04-15 11:17:15,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {5287#true} assume !(0 != ~p2~0); {5287#true} is VALID [2022-04-15 11:17:15,487 INFO L290 TraceCheckUtils]: 10: Hoare triple {5287#true} assume !(0 != ~p3~0); {5292#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:15,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:15,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:15,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:15,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:15,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:15,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:15,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {5292#(= main_~p3~0 0)} assume !(0 != ~p10~0); {5292#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:15,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:15,493 INFO L290 TraceCheckUtils]: 19: Hoare triple {5292#(= main_~p3~0 0)} assume !(0 != ~p1~0); {5292#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:15,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {5292#(= main_~p3~0 0)} assume !(0 != ~p2~0); {5292#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:15,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p3~0; {5288#false} is VALID [2022-04-15 11:17:15,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {5288#false} assume 1 != ~lk3~0; {5288#false} is VALID [2022-04-15 11:17:15,496 INFO L290 TraceCheckUtils]: 23: Hoare triple {5288#false} assume !false; {5288#false} is VALID [2022-04-15 11:17:15,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:15,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:15,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608243643] [2022-04-15 11:17:15,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608243643] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:15,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:15,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:15,499 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:15,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1491607307] [2022-04-15 11:17:15,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1491607307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:15,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:15,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:15,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768676515] [2022-04-15 11:17:15,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:15,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 11:17:15,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:15,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:15,517 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:15,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:15,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:15,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:15,518 INFO L87 Difference]: Start difference. First operand 199 states and 349 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:15,752 INFO L93 Difference]: Finished difference Result 471 states and 835 transitions. [2022-04-15 11:17:15,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:15,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 11:17:15,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:15,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-04-15 11:17:15,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-04-15 11:17:15,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 204 transitions. [2022-04-15 11:17:15,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:15,921 INFO L225 Difference]: With dead ends: 471 [2022-04-15 11:17:15,921 INFO L226 Difference]: Without dead ends: 281 [2022-04-15 11:17:15,922 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:15,923 INFO L913 BasicCegarLoop]: 100 mSDtfsCounter, 151 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:15,923 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 107 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:15,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-04-15 11:17:15,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 279. [2022-04-15 11:17:15,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:15,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 states. Second operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,946 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,947 INFO L87 Difference]: Start difference. First operand 281 states. Second operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:15,953 INFO L93 Difference]: Finished difference Result 281 states and 488 transitions. [2022-04-15 11:17:15,953 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 488 transitions. [2022-04-15 11:17:15,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:15,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:15,955 INFO L74 IsIncluded]: Start isIncluded. First operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 281 states. [2022-04-15 11:17:15,955 INFO L87 Difference]: Start difference. First operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 281 states. [2022-04-15 11:17:15,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:15,962 INFO L93 Difference]: Finished difference Result 281 states and 488 transitions. [2022-04-15 11:17:15,962 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 488 transitions. [2022-04-15 11:17:15,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:15,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:15,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:15,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:15,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 487 transitions. [2022-04-15 11:17:15,971 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 487 transitions. Word has length 24 [2022-04-15 11:17:15,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:15,971 INFO L478 AbstractCegarLoop]: Abstraction has 279 states and 487 transitions. [2022-04-15 11:17:15,972 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 279 states and 487 transitions. [2022-04-15 11:17:16,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:16,434 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 487 transitions. [2022-04-15 11:17:16,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 11:17:16,434 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:16,435 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:16,435 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:17:16,435 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:16,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:16,435 INFO L85 PathProgramCache]: Analyzing trace with hash -251718169, now seen corresponding path program 1 times [2022-04-15 11:17:16,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:16,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [68822862] [2022-04-15 11:17:16,436 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:16,436 INFO L85 PathProgramCache]: Analyzing trace with hash -251718169, now seen corresponding path program 2 times [2022-04-15 11:17:16,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:16,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082939067] [2022-04-15 11:17:16,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:16,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:16,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:16,475 INFO L290 TraceCheckUtils]: 0: Hoare triple {7367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {7361#true} is VALID [2022-04-15 11:17:16,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-15 11:17:16,475 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7361#true} {7361#true} #217#return; {7361#true} is VALID [2022-04-15 11:17:16,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {7361#true} call ULTIMATE.init(); {7367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:16,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {7367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {7361#true} is VALID [2022-04-15 11:17:16,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-15 11:17:16,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7361#true} {7361#true} #217#return; {7361#true} is VALID [2022-04-15 11:17:16,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {7361#true} call #t~ret16 := main(); {7361#true} is VALID [2022-04-15 11:17:16,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {7361#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;havoc ~cond~0; {7361#true} is VALID [2022-04-15 11:17:16,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {7361#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {7361#true} is VALID [2022-04-15 11:17:16,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {7361#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; {7361#true} is VALID [2022-04-15 11:17:16,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {7361#true} assume !(0 != ~p1~0); {7361#true} is VALID [2022-04-15 11:17:16,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {7361#true} assume !(0 != ~p2~0); {7361#true} is VALID [2022-04-15 11:17:16,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {7361#true} assume 0 != ~p3~0;~lk3~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:16,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:16,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:16,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:16,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:16,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:16,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:16,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {7366#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {7366#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:16,479 INFO L290 TraceCheckUtils]: 18: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:16,480 INFO L290 TraceCheckUtils]: 19: Hoare triple {7366#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {7366#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:16,480 INFO L290 TraceCheckUtils]: 20: Hoare triple {7366#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {7366#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:16,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {7366#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {7362#false} is VALID [2022-04-15 11:17:16,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {7362#false} assume 0 != ~p4~0; {7362#false} is VALID [2022-04-15 11:17:16,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {7362#false} assume 1 != ~lk4~0; {7362#false} is VALID [2022-04-15 11:17:16,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {7362#false} assume !false; {7362#false} is VALID [2022-04-15 11:17:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:16,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:16,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082939067] [2022-04-15 11:17:16,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082939067] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:16,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:16,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:16,482 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:16,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [68822862] [2022-04-15 11:17:16,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [68822862] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:16,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:16,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:16,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379672038] [2022-04-15 11:17:16,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:16,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 11:17:16,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:16,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:16,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:16,498 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:16,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:16,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:16,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:16,499 INFO L87 Difference]: Start difference. First operand 279 states and 487 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:16,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:16,712 INFO L93 Difference]: Finished difference Result 421 states and 733 transitions. [2022-04-15 11:17:16,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:16,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 11:17:16,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:16,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:16,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-15 11:17:16,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:16,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-15 11:17:16,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 199 transitions. [2022-04-15 11:17:16,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:16,868 INFO L225 Difference]: With dead ends: 421 [2022-04-15 11:17:16,868 INFO L226 Difference]: Without dead ends: 287 [2022-04-15 11:17:16,871 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:16,872 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 142 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:16,872 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 117 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:16,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-04-15 11:17:16,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2022-04-15 11:17:16,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:16,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states. Second operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:16,901 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:16,902 INFO L87 Difference]: Start difference. First operand 287 states. Second operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:16,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:16,909 INFO L93 Difference]: Finished difference Result 287 states and 492 transitions. [2022-04-15 11:17:16,909 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 492 transitions. [2022-04-15 11:17:16,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:16,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:16,910 INFO L74 IsIncluded]: Start isIncluded. First operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 287 states. [2022-04-15 11:17:16,911 INFO L87 Difference]: Start difference. First operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 287 states. [2022-04-15 11:17:16,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:16,919 INFO L93 Difference]: Finished difference Result 287 states and 492 transitions. [2022-04-15 11:17:16,919 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 492 transitions. [2022-04-15 11:17:16,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:16,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:16,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:16,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:16,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:16,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 491 transitions. [2022-04-15 11:17:16,929 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 491 transitions. Word has length 25 [2022-04-15 11:17:16,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:16,929 INFO L478 AbstractCegarLoop]: Abstraction has 285 states and 491 transitions. [2022-04-15 11:17:16,929 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:16,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 285 states and 491 transitions. [2022-04-15 11:17:17,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 491 edges. 491 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:17,385 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 491 transitions. [2022-04-15 11:17:17,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 11:17:17,385 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:17,385 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:17,386 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:17:17,386 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:17,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:17,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1531581847, now seen corresponding path program 1 times [2022-04-15 11:17:17,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:17,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [86290855] [2022-04-15 11:17:17,387 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:17,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1531581847, now seen corresponding path program 2 times [2022-04-15 11:17:17,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:17,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256070356] [2022-04-15 11:17:17,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:17,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:17,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:17,427 INFO L290 TraceCheckUtils]: 0: Hoare triple {9365#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {9359#true} is VALID [2022-04-15 11:17:17,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {9359#true} assume true; {9359#true} is VALID [2022-04-15 11:17:17,427 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9359#true} {9359#true} #217#return; {9359#true} is VALID [2022-04-15 11:17:17,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {9359#true} call ULTIMATE.init(); {9365#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:17,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {9365#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {9359#true} is VALID [2022-04-15 11:17:17,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {9359#true} assume true; {9359#true} is VALID [2022-04-15 11:17:17,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9359#true} {9359#true} #217#return; {9359#true} is VALID [2022-04-15 11:17:17,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {9359#true} call #t~ret16 := main(); {9359#true} is VALID [2022-04-15 11:17:17,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {9359#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;havoc ~cond~0; {9359#true} is VALID [2022-04-15 11:17:17,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {9359#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {9359#true} is VALID [2022-04-15 11:17:17,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {9359#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; {9359#true} is VALID [2022-04-15 11:17:17,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {9359#true} assume !(0 != ~p1~0); {9359#true} is VALID [2022-04-15 11:17:17,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {9359#true} assume !(0 != ~p2~0); {9359#true} is VALID [2022-04-15 11:17:17,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {9359#true} assume !(0 != ~p3~0); {9359#true} is VALID [2022-04-15 11:17:17,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {9359#true} assume 0 != ~p4~0;~lk4~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:17,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:17,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:17,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:17,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:17,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:17,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {9364#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {9364#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:17,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:17,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {9364#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {9364#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:17,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {9364#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {9364#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:17,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {9364#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {9364#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:17,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p4~0; {9364#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:17,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {9364#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {9360#false} is VALID [2022-04-15 11:17:17,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {9360#false} assume !false; {9360#false} is VALID [2022-04-15 11:17:17,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:17,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:17,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256070356] [2022-04-15 11:17:17,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256070356] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:17,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:17,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:17,435 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:17,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [86290855] [2022-04-15 11:17:17,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [86290855] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:17,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:17,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:17,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705567781] [2022-04-15 11:17:17,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:17,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 11:17:17,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:17,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:17,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:17,454 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:17,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:17,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:17,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:17,455 INFO L87 Difference]: Start difference. First operand 285 states and 491 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:17,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:17,686 INFO L93 Difference]: Finished difference Result 525 states and 917 transitions. [2022-04-15 11:17:17,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:17,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 11:17:17,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:17,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:17,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-15 11:17:17,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:17,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-15 11:17:17,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 131 transitions. [2022-04-15 11:17:17,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:17,814 INFO L225 Difference]: With dead ends: 525 [2022-04-15 11:17:17,815 INFO L226 Difference]: Without dead ends: 523 [2022-04-15 11:17:17,815 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:17,816 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 164 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:17,816 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 81 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:17,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-04-15 11:17:17,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 393. [2022-04-15 11:17:17,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:17,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 523 states. Second operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:17,846 INFO L74 IsIncluded]: Start isIncluded. First operand 523 states. Second operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:17,846 INFO L87 Difference]: Start difference. First operand 523 states. Second operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:17,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:17,862 INFO L93 Difference]: Finished difference Result 523 states and 908 transitions. [2022-04-15 11:17:17,862 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 908 transitions. [2022-04-15 11:17:17,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:17,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:17,864 INFO L74 IsIncluded]: Start isIncluded. First operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 523 states. [2022-04-15 11:17:17,865 INFO L87 Difference]: Start difference. First operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 523 states. [2022-04-15 11:17:17,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:17,881 INFO L93 Difference]: Finished difference Result 523 states and 908 transitions. [2022-04-15 11:17:17,881 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 908 transitions. [2022-04-15 11:17:17,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:17,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:17,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:17,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:17,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:17,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 667 transitions. [2022-04-15 11:17:17,895 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 667 transitions. Word has length 25 [2022-04-15 11:17:17,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:17,895 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 667 transitions. [2022-04-15 11:17:17,895 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:17,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 393 states and 667 transitions. [2022-04-15 11:17:18,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 667 edges. 667 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:18,520 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 667 transitions. [2022-04-15 11:17:18,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 11:17:18,520 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:18,521 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:18,521 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:17:18,521 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:18,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:18,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1752268199, now seen corresponding path program 1 times [2022-04-15 11:17:18,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:18,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [552210511] [2022-04-15 11:17:18,522 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:18,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1752268199, now seen corresponding path program 2 times [2022-04-15 11:17:18,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:18,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278900752] [2022-04-15 11:17:18,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:18,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:18,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:18,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {12259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {12253#true} is VALID [2022-04-15 11:17:18,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {12253#true} assume true; {12253#true} is VALID [2022-04-15 11:17:18,568 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12253#true} {12253#true} #217#return; {12253#true} is VALID [2022-04-15 11:17:18,573 INFO L272 TraceCheckUtils]: 0: Hoare triple {12253#true} call ULTIMATE.init(); {12259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:18,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {12259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {12253#true} is VALID [2022-04-15 11:17:18,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {12253#true} assume true; {12253#true} is VALID [2022-04-15 11:17:18,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12253#true} {12253#true} #217#return; {12253#true} is VALID [2022-04-15 11:17:18,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {12253#true} call #t~ret16 := main(); {12253#true} is VALID [2022-04-15 11:17:18,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {12253#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;havoc ~cond~0; {12253#true} is VALID [2022-04-15 11:17:18,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {12253#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {12253#true} is VALID [2022-04-15 11:17:18,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {12253#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; {12253#true} is VALID [2022-04-15 11:17:18,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {12253#true} assume !(0 != ~p1~0); {12253#true} is VALID [2022-04-15 11:17:18,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {12253#true} assume !(0 != ~p2~0); {12253#true} is VALID [2022-04-15 11:17:18,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {12253#true} assume !(0 != ~p3~0); {12253#true} is VALID [2022-04-15 11:17:18,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {12253#true} assume !(0 != ~p4~0); {12258#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:18,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:18,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:18,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:18,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:18,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:18,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {12258#(= main_~p4~0 0)} assume !(0 != ~p10~0); {12258#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:18,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:18,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {12258#(= main_~p4~0 0)} assume !(0 != ~p1~0); {12258#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:18,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {12258#(= main_~p4~0 0)} assume !(0 != ~p2~0); {12258#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:18,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {12258#(= main_~p4~0 0)} assume !(0 != ~p3~0); {12258#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:18,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p4~0; {12254#false} is VALID [2022-04-15 11:17:18,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {12254#false} assume 1 != ~lk4~0; {12254#false} is VALID [2022-04-15 11:17:18,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {12254#false} assume !false; {12254#false} is VALID [2022-04-15 11:17:18,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:18,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:18,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278900752] [2022-04-15 11:17:18,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278900752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:18,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:18,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:18,580 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:18,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [552210511] [2022-04-15 11:17:18,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [552210511] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:18,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:18,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:18,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836932473] [2022-04-15 11:17:18,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:18,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 11:17:18,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:18,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:18,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:18,601 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:18,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:18,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:18,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:18,601 INFO L87 Difference]: Start difference. First operand 393 states and 667 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:18,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:18,886 INFO L93 Difference]: Finished difference Result 925 states and 1581 transitions. [2022-04-15 11:17:18,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:18,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 11:17:18,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:18,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:18,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 201 transitions. [2022-04-15 11:17:18,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:18,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 201 transitions. [2022-04-15 11:17:18,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 201 transitions. [2022-04-15 11:17:19,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:19,095 INFO L225 Difference]: With dead ends: 925 [2022-04-15 11:17:19,095 INFO L226 Difference]: Without dead ends: 547 [2022-04-15 11:17:19,096 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:19,097 INFO L913 BasicCegarLoop]: 102 mSDtfsCounter, 145 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:19,098 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 109 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:17:19,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-04-15 11:17:19,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2022-04-15 11:17:19,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:19,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 547 states. Second operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:19,138 INFO L74 IsIncluded]: Start isIncluded. First operand 547 states. Second operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:19,141 INFO L87 Difference]: Start difference. First operand 547 states. Second operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:19,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:19,157 INFO L93 Difference]: Finished difference Result 547 states and 920 transitions. [2022-04-15 11:17:19,157 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 920 transitions. [2022-04-15 11:17:19,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:19,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:19,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 547 states. [2022-04-15 11:17:19,175 INFO L87 Difference]: Start difference. First operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 547 states. [2022-04-15 11:17:19,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:19,192 INFO L93 Difference]: Finished difference Result 547 states and 920 transitions. [2022-04-15 11:17:19,192 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 920 transitions. [2022-04-15 11:17:19,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:19,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:19,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:19,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:19,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:19,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 919 transitions. [2022-04-15 11:17:19,216 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 919 transitions. Word has length 25 [2022-04-15 11:17:19,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:19,216 INFO L478 AbstractCegarLoop]: Abstraction has 545 states and 919 transitions. [2022-04-15 11:17:19,216 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:19,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 545 states and 919 transitions. [2022-04-15 11:17:20,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 919 edges. 919 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:20,123 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 919 transitions. [2022-04-15 11:17:20,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 11:17:20,124 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:20,124 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:20,124 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:17:20,124 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:20,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:20,125 INFO L85 PathProgramCache]: Analyzing trace with hash -234182919, now seen corresponding path program 1 times [2022-04-15 11:17:20,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:20,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1223346191] [2022-04-15 11:17:20,125 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:20,125 INFO L85 PathProgramCache]: Analyzing trace with hash -234182919, now seen corresponding path program 2 times [2022-04-15 11:17:20,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:20,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286281275] [2022-04-15 11:17:20,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:20,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:20,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:20,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {16305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {16299#true} is VALID [2022-04-15 11:17:20,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {16299#true} assume true; {16299#true} is VALID [2022-04-15 11:17:20,198 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16299#true} {16299#true} #217#return; {16299#true} is VALID [2022-04-15 11:17:20,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {16299#true} call ULTIMATE.init(); {16305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:20,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {16305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {16299#true} is VALID [2022-04-15 11:17:20,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {16299#true} assume true; {16299#true} is VALID [2022-04-15 11:17:20,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16299#true} {16299#true} #217#return; {16299#true} is VALID [2022-04-15 11:17:20,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {16299#true} call #t~ret16 := main(); {16299#true} is VALID [2022-04-15 11:17:20,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {16299#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;havoc ~cond~0; {16299#true} is VALID [2022-04-15 11:17:20,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {16299#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {16299#true} is VALID [2022-04-15 11:17:20,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {16299#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; {16299#true} is VALID [2022-04-15 11:17:20,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {16299#true} assume !(0 != ~p1~0); {16299#true} is VALID [2022-04-15 11:17:20,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {16299#true} assume !(0 != ~p2~0); {16299#true} is VALID [2022-04-15 11:17:20,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {16299#true} assume !(0 != ~p3~0); {16299#true} is VALID [2022-04-15 11:17:20,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {16299#true} assume 0 != ~p4~0;~lk4~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:20,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:20,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:20,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:20,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:20,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:20,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {16304#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {16304#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:20,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:20,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {16304#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {16304#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:20,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {16304#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {16304#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:20,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {16304#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {16304#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:20,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {16304#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {16300#false} is VALID [2022-04-15 11:17:20,204 INFO L290 TraceCheckUtils]: 23: Hoare triple {16300#false} assume 0 != ~p5~0; {16300#false} is VALID [2022-04-15 11:17:20,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {16300#false} assume 1 != ~lk5~0; {16300#false} is VALID [2022-04-15 11:17:20,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {16300#false} assume !false; {16300#false} is VALID [2022-04-15 11:17:20,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:20,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:20,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286281275] [2022-04-15 11:17:20,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286281275] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:20,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:20,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:20,207 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:20,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1223346191] [2022-04-15 11:17:20,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1223346191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:20,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:20,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:20,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591668928] [2022-04-15 11:17:20,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:20,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 11:17:20,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:20,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:20,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:20,224 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:20,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:20,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:20,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:20,226 INFO L87 Difference]: Start difference. First operand 545 states and 919 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:20,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:20,469 INFO L93 Difference]: Finished difference Result 817 states and 1373 transitions. [2022-04-15 11:17:20,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:20,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 11:17:20,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:20,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2022-04-15 11:17:20,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:20,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2022-04-15 11:17:20,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 196 transitions. [2022-04-15 11:17:20,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:20,654 INFO L225 Difference]: With dead ends: 817 [2022-04-15 11:17:20,654 INFO L226 Difference]: Without dead ends: 555 [2022-04-15 11:17:20,655 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:20,655 INFO L913 BasicCegarLoop]: 107 mSDtfsCounter, 141 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:20,655 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 114 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:20,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2022-04-15 11:17:20,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 553. [2022-04-15 11:17:20,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:20,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 555 states. Second operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:20,699 INFO L74 IsIncluded]: Start isIncluded. First operand 555 states. Second operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:20,699 INFO L87 Difference]: Start difference. First operand 555 states. Second operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:20,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:20,718 INFO L93 Difference]: Finished difference Result 555 states and 920 transitions. [2022-04-15 11:17:20,718 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 920 transitions. [2022-04-15 11:17:20,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:20,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:20,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 555 states. [2022-04-15 11:17:20,722 INFO L87 Difference]: Start difference. First operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 555 states. [2022-04-15 11:17:20,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:20,740 INFO L93 Difference]: Finished difference Result 555 states and 920 transitions. [2022-04-15 11:17:20,740 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 920 transitions. [2022-04-15 11:17:20,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:20,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:20,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:20,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:20,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:20,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 919 transitions. [2022-04-15 11:17:20,763 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 919 transitions. Word has length 26 [2022-04-15 11:17:20,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:20,763 INFO L478 AbstractCegarLoop]: Abstraction has 553 states and 919 transitions. [2022-04-15 11:17:20,763 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:20,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 553 states and 919 transitions. [2022-04-15 11:17:21,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 919 edges. 919 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:21,700 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 919 transitions. [2022-04-15 11:17:21,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 11:17:21,700 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:21,701 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:21,701 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:17:21,701 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:21,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:21,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1514046597, now seen corresponding path program 1 times [2022-04-15 11:17:21,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:21,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1753158165] [2022-04-15 11:17:21,702 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:21,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1514046597, now seen corresponding path program 2 times [2022-04-15 11:17:21,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:21,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158578792] [2022-04-15 11:17:21,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:21,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:21,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:21,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {20167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {20161#true} is VALID [2022-04-15 11:17:21,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {20161#true} assume true; {20161#true} is VALID [2022-04-15 11:17:21,753 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20161#true} {20161#true} #217#return; {20161#true} is VALID [2022-04-15 11:17:21,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {20161#true} call ULTIMATE.init(); {20167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:21,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {20167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {20161#true} is VALID [2022-04-15 11:17:21,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {20161#true} assume true; {20161#true} is VALID [2022-04-15 11:17:21,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20161#true} {20161#true} #217#return; {20161#true} is VALID [2022-04-15 11:17:21,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {20161#true} call #t~ret16 := main(); {20161#true} is VALID [2022-04-15 11:17:21,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {20161#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;havoc ~cond~0; {20161#true} is VALID [2022-04-15 11:17:21,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {20161#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {20161#true} is VALID [2022-04-15 11:17:21,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {20161#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; {20161#true} is VALID [2022-04-15 11:17:21,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {20161#true} assume !(0 != ~p1~0); {20161#true} is VALID [2022-04-15 11:17:21,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {20161#true} assume !(0 != ~p2~0); {20161#true} is VALID [2022-04-15 11:17:21,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {20161#true} assume !(0 != ~p3~0); {20161#true} is VALID [2022-04-15 11:17:21,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {20161#true} assume !(0 != ~p4~0); {20161#true} is VALID [2022-04-15 11:17:21,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {20161#true} assume 0 != ~p5~0;~lk5~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:21,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:21,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:21,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:21,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:21,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {20166#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {20166#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:21,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:21,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {20166#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {20166#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:21,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {20166#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {20166#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:21,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {20166#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {20166#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:21,758 INFO L290 TraceCheckUtils]: 22: Hoare triple {20166#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {20166#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:21,758 INFO L290 TraceCheckUtils]: 23: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p5~0; {20166#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:21,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {20166#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {20162#false} is VALID [2022-04-15 11:17:21,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {20162#false} assume !false; {20162#false} is VALID [2022-04-15 11:17:21,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:21,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:21,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158578792] [2022-04-15 11:17:21,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158578792] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:21,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:21,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:21,760 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:21,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1753158165] [2022-04-15 11:17:21,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1753158165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:21,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:21,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:21,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684768885] [2022-04-15 11:17:21,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:21,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 11:17:21,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:21,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:21,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:21,778 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:21,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:21,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:21,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:21,779 INFO L87 Difference]: Start difference. First operand 553 states and 919 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:22,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:22,076 INFO L93 Difference]: Finished difference Result 1005 states and 1697 transitions. [2022-04-15 11:17:22,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:22,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 11:17:22,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:22,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:22,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-15 11:17:22,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:22,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-15 11:17:22,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-15 11:17:22,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:22,273 INFO L225 Difference]: With dead ends: 1005 [2022-04-15 11:17:22,273 INFO L226 Difference]: Without dead ends: 1003 [2022-04-15 11:17:22,274 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:22,274 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:22,275 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 80 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:22,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2022-04-15 11:17:22,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 777. [2022-04-15 11:17:22,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:22,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1003 states. Second operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:22,336 INFO L74 IsIncluded]: Start isIncluded. First operand 1003 states. Second operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:22,337 INFO L87 Difference]: Start difference. First operand 1003 states. Second operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:22,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:22,384 INFO L93 Difference]: Finished difference Result 1003 states and 1680 transitions. [2022-04-15 11:17:22,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1680 transitions. [2022-04-15 11:17:22,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:22,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:22,388 INFO L74 IsIncluded]: Start isIncluded. First operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1003 states. [2022-04-15 11:17:22,389 INFO L87 Difference]: Start difference. First operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1003 states. [2022-04-15 11:17:22,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:22,434 INFO L93 Difference]: Finished difference Result 1003 states and 1680 transitions. [2022-04-15 11:17:22,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1680 transitions. [2022-04-15 11:17:22,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:22,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:22,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:22,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:22,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:22,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1263 transitions. [2022-04-15 11:17:22,480 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1263 transitions. Word has length 26 [2022-04-15 11:17:22,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:22,480 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 1263 transitions. [2022-04-15 11:17:22,480 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:22,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 777 states and 1263 transitions. [2022-04-15 11:17:23,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1263 edges. 1263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:23,703 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1263 transitions. [2022-04-15 11:17:23,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 11:17:23,704 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:23,704 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:23,704 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 11:17:23,704 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:23,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:23,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1769803449, now seen corresponding path program 1 times [2022-04-15 11:17:23,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:23,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1488987292] [2022-04-15 11:17:23,705 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:23,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1769803449, now seen corresponding path program 2 times [2022-04-15 11:17:23,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:23,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513117933] [2022-04-15 11:17:23,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:23,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:23,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:23,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {25749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {25743#true} is VALID [2022-04-15 11:17:23,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {25743#true} assume true; {25743#true} is VALID [2022-04-15 11:17:23,760 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25743#true} {25743#true} #217#return; {25743#true} is VALID [2022-04-15 11:17:23,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {25743#true} call ULTIMATE.init(); {25749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:23,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {25749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {25743#true} is VALID [2022-04-15 11:17:23,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {25743#true} assume true; {25743#true} is VALID [2022-04-15 11:17:23,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25743#true} {25743#true} #217#return; {25743#true} is VALID [2022-04-15 11:17:23,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {25743#true} call #t~ret16 := main(); {25743#true} is VALID [2022-04-15 11:17:23,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {25743#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;havoc ~cond~0; {25743#true} is VALID [2022-04-15 11:17:23,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {25743#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {25743#true} is VALID [2022-04-15 11:17:23,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {25743#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; {25743#true} is VALID [2022-04-15 11:17:23,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {25743#true} assume !(0 != ~p1~0); {25743#true} is VALID [2022-04-15 11:17:23,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {25743#true} assume !(0 != ~p2~0); {25743#true} is VALID [2022-04-15 11:17:23,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {25743#true} assume !(0 != ~p3~0); {25743#true} is VALID [2022-04-15 11:17:23,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {25743#true} assume !(0 != ~p4~0); {25743#true} is VALID [2022-04-15 11:17:23,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {25743#true} assume !(0 != ~p5~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:23,768 INFO L290 TraceCheckUtils]: 13: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {25748#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:23,769 INFO L290 TraceCheckUtils]: 14: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {25748#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:23,769 INFO L290 TraceCheckUtils]: 15: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {25748#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:23,769 INFO L290 TraceCheckUtils]: 16: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {25748#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:23,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {25748#(= main_~p5~0 0)} assume !(0 != ~p10~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:23,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {25748#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:23,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {25748#(= main_~p5~0 0)} assume !(0 != ~p1~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:23,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {25748#(= main_~p5~0 0)} assume !(0 != ~p2~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:23,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {25748#(= main_~p5~0 0)} assume !(0 != ~p3~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:23,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {25748#(= main_~p5~0 0)} assume !(0 != ~p4~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:23,772 INFO L290 TraceCheckUtils]: 23: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p5~0; {25744#false} is VALID [2022-04-15 11:17:23,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {25744#false} assume 1 != ~lk5~0; {25744#false} is VALID [2022-04-15 11:17:23,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {25744#false} assume !false; {25744#false} is VALID [2022-04-15 11:17:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:23,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:23,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513117933] [2022-04-15 11:17:23,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513117933] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:23,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:23,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:23,773 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:23,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1488987292] [2022-04-15 11:17:23,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1488987292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:23,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:23,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:23,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957240941] [2022-04-15 11:17:23,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:23,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 11:17:23,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:23,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:23,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:23,791 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:23,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:23,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:23,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:23,792 INFO L87 Difference]: Start difference. First operand 777 states and 1263 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:24,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:24,293 INFO L93 Difference]: Finished difference Result 1821 states and 2977 transitions. [2022-04-15 11:17:24,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:24,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 11:17:24,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:24,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:24,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 198 transitions. [2022-04-15 11:17:24,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 198 transitions. [2022-04-15 11:17:24,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 198 transitions. [2022-04-15 11:17:24,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:24,562 INFO L225 Difference]: With dead ends: 1821 [2022-04-15 11:17:24,563 INFO L226 Difference]: Without dead ends: 1067 [2022-04-15 11:17:24,564 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:24,566 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 139 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:24,566 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 111 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:24,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2022-04-15 11:17:24,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1065. [2022-04-15 11:17:24,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:24,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1067 states. Second operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:24,660 INFO L74 IsIncluded]: Start isIncluded. First operand 1067 states. Second operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:24,661 INFO L87 Difference]: Start difference. First operand 1067 states. Second operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:24,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:24,710 INFO L93 Difference]: Finished difference Result 1067 states and 1720 transitions. [2022-04-15 11:17:24,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1720 transitions. [2022-04-15 11:17:24,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:24,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:24,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1067 states. [2022-04-15 11:17:24,715 INFO L87 Difference]: Start difference. First operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1067 states. [2022-04-15 11:17:24,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:24,767 INFO L93 Difference]: Finished difference Result 1067 states and 1720 transitions. [2022-04-15 11:17:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1720 transitions. [2022-04-15 11:17:24,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:24,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:24,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:24,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:24,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:24,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1719 transitions. [2022-04-15 11:17:24,854 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1719 transitions. Word has length 26 [2022-04-15 11:17:24,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:24,854 INFO L478 AbstractCegarLoop]: Abstraction has 1065 states and 1719 transitions. [2022-04-15 11:17:24,858 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:24,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1065 states and 1719 transitions. [2022-04-15 11:17:26,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1719 edges. 1719 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:26,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1719 transitions. [2022-04-15 11:17:26,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 11:17:26,594 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:26,595 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:26,595 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 11:17:26,595 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:26,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:26,595 INFO L85 PathProgramCache]: Analyzing trace with hash 309410172, now seen corresponding path program 1 times [2022-04-15 11:17:26,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:26,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1674279412] [2022-04-15 11:17:26,596 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:26,596 INFO L85 PathProgramCache]: Analyzing trace with hash 309410172, now seen corresponding path program 2 times [2022-04-15 11:17:26,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:26,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57511981] [2022-04-15 11:17:26,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:26,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:26,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:26,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {33667#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {33661#true} is VALID [2022-04-15 11:17:26,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {33661#true} assume true; {33661#true} is VALID [2022-04-15 11:17:26,627 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33661#true} {33661#true} #217#return; {33661#true} is VALID [2022-04-15 11:17:26,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {33661#true} call ULTIMATE.init(); {33667#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:26,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {33667#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {33661#true} is VALID [2022-04-15 11:17:26,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {33661#true} assume true; {33661#true} is VALID [2022-04-15 11:17:26,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33661#true} {33661#true} #217#return; {33661#true} is VALID [2022-04-15 11:17:26,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {33661#true} call #t~ret16 := main(); {33661#true} is VALID [2022-04-15 11:17:26,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {33661#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;havoc ~cond~0; {33661#true} is VALID [2022-04-15 11:17:26,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {33661#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {33661#true} is VALID [2022-04-15 11:17:26,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {33661#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; {33661#true} is VALID [2022-04-15 11:17:26,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {33661#true} assume !(0 != ~p1~0); {33661#true} is VALID [2022-04-15 11:17:26,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {33661#true} assume !(0 != ~p2~0); {33661#true} is VALID [2022-04-15 11:17:26,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {33661#true} assume !(0 != ~p3~0); {33661#true} is VALID [2022-04-15 11:17:26,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {33661#true} assume !(0 != ~p4~0); {33661#true} is VALID [2022-04-15 11:17:26,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {33661#true} assume 0 != ~p5~0;~lk5~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:26,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {33666#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:26,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {33666#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:26,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {33666#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:26,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {33666#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:26,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {33666#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:26,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {33666#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:26,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {33666#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:26,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {33666#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:26,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {33666#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:26,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {33666#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:26,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {33662#false} is VALID [2022-04-15 11:17:26,633 INFO L290 TraceCheckUtils]: 24: Hoare triple {33662#false} assume 0 != ~p6~0; {33662#false} is VALID [2022-04-15 11:17:26,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {33662#false} assume 1 != ~lk6~0; {33662#false} is VALID [2022-04-15 11:17:26,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {33662#false} assume !false; {33662#false} is VALID [2022-04-15 11:17:26,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:26,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:26,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57511981] [2022-04-15 11:17:26,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57511981] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:26,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:26,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:26,634 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:26,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1674279412] [2022-04-15 11:17:26,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1674279412] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:26,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:26,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:26,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463867775] [2022-04-15 11:17:26,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:26,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 11:17:26,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:26,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:26,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:26,652 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:26,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:26,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:26,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:26,652 INFO L87 Difference]: Start difference. First operand 1065 states and 1719 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:27,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:27,084 INFO L93 Difference]: Finished difference Result 1597 states and 2569 transitions. [2022-04-15 11:17:27,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:27,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 11:17:27,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:27,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:27,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2022-04-15 11:17:27,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:27,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2022-04-15 11:17:27,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 193 transitions. [2022-04-15 11:17:27,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:27,339 INFO L225 Difference]: With dead ends: 1597 [2022-04-15 11:17:27,340 INFO L226 Difference]: Without dead ends: 1083 [2022-04-15 11:17:27,341 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:27,341 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 140 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:27,342 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 111 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:27,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2022-04-15 11:17:27,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1081. [2022-04-15 11:17:27,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:27,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1083 states. Second operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:27,434 INFO L74 IsIncluded]: Start isIncluded. First operand 1083 states. Second operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:27,435 INFO L87 Difference]: Start difference. First operand 1083 states. Second operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:27,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:27,487 INFO L93 Difference]: Finished difference Result 1083 states and 1720 transitions. [2022-04-15 11:17:27,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1720 transitions. [2022-04-15 11:17:27,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:27,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:27,491 INFO L74 IsIncluded]: Start isIncluded. First operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1083 states. [2022-04-15 11:17:27,492 INFO L87 Difference]: Start difference. First operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1083 states. [2022-04-15 11:17:27,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:27,543 INFO L93 Difference]: Finished difference Result 1083 states and 1720 transitions. [2022-04-15 11:17:27,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1720 transitions. [2022-04-15 11:17:27,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:27,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:27,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:27,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:27,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:27,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1719 transitions. [2022-04-15 11:17:27,626 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1719 transitions. Word has length 27 [2022-04-15 11:17:27,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:27,626 INFO L478 AbstractCegarLoop]: Abstraction has 1081 states and 1719 transitions. [2022-04-15 11:17:27,626 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:27,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1081 states and 1719 transitions. [2022-04-15 11:17:29,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1719 edges. 1719 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:29,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1719 transitions. [2022-04-15 11:17:29,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 11:17:29,293 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:29,293 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:29,293 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 11:17:29,293 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:29,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:29,294 INFO L85 PathProgramCache]: Analyzing trace with hash -970453506, now seen corresponding path program 1 times [2022-04-15 11:17:29,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:29,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [141284088] [2022-04-15 11:17:29,294 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:29,294 INFO L85 PathProgramCache]: Analyzing trace with hash -970453506, now seen corresponding path program 2 times [2022-04-15 11:17:29,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:29,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838284216] [2022-04-15 11:17:29,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:29,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:29,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:29,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:29,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {41201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {41195#true} is VALID [2022-04-15 11:17:29,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-15 11:17:29,329 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41195#true} {41195#true} #217#return; {41195#true} is VALID [2022-04-15 11:17:29,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {41195#true} call ULTIMATE.init(); {41201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:29,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {41201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {41195#true} is VALID [2022-04-15 11:17:29,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-15 11:17:29,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41195#true} {41195#true} #217#return; {41195#true} is VALID [2022-04-15 11:17:29,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {41195#true} call #t~ret16 := main(); {41195#true} is VALID [2022-04-15 11:17:29,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {41195#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;havoc ~cond~0; {41195#true} is VALID [2022-04-15 11:17:29,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {41195#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {41195#true} is VALID [2022-04-15 11:17:29,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {41195#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; {41195#true} is VALID [2022-04-15 11:17:29,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {41195#true} assume !(0 != ~p1~0); {41195#true} is VALID [2022-04-15 11:17:29,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {41195#true} assume !(0 != ~p2~0); {41195#true} is VALID [2022-04-15 11:17:29,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {41195#true} assume !(0 != ~p3~0); {41195#true} is VALID [2022-04-15 11:17:29,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {41195#true} assume !(0 != ~p4~0); {41195#true} is VALID [2022-04-15 11:17:29,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {41195#true} assume !(0 != ~p5~0); {41195#true} is VALID [2022-04-15 11:17:29,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {41195#true} assume 0 != ~p6~0;~lk6~0 := 1; {41200#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:29,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {41200#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {41200#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:29,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {41200#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {41200#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:29,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {41200#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {41200#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:29,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:29,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {41200#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {41200#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:29,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:29,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:29,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:29,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:29,334 INFO L290 TraceCheckUtils]: 23: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:29,335 INFO L290 TraceCheckUtils]: 24: Hoare triple {41200#(= main_~lk6~0 1)} assume 0 != ~p6~0; {41200#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:29,335 INFO L290 TraceCheckUtils]: 25: Hoare triple {41200#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {41196#false} is VALID [2022-04-15 11:17:29,335 INFO L290 TraceCheckUtils]: 26: Hoare triple {41196#false} assume !false; {41196#false} is VALID [2022-04-15 11:17:29,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:29,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:29,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838284216] [2022-04-15 11:17:29,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838284216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:29,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:29,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:29,336 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:29,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [141284088] [2022-04-15 11:17:29,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [141284088] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:29,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:29,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:29,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143985669] [2022-04-15 11:17:29,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:29,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 11:17:29,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:29,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:29,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:29,355 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:29,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:29,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:29,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:29,356 INFO L87 Difference]: Start difference. First operand 1081 states and 1719 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:29,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:29,799 INFO L93 Difference]: Finished difference Result 1933 states and 3129 transitions. [2022-04-15 11:17:29,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:29,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 11:17:29,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:29,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:29,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-15 11:17:29,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:29,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-15 11:17:29,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-15 11:17:29,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:30,156 INFO L225 Difference]: With dead ends: 1933 [2022-04-15 11:17:30,156 INFO L226 Difference]: Without dead ends: 1931 [2022-04-15 11:17:30,156 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:30,157 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 150 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:30,157 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 79 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:30,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2022-04-15 11:17:30,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1545. [2022-04-15 11:17:30,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:30,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1931 states. Second operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:30,303 INFO L74 IsIncluded]: Start isIncluded. First operand 1931 states. Second operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:30,306 INFO L87 Difference]: Start difference. First operand 1931 states. Second operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:30,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:30,453 INFO L93 Difference]: Finished difference Result 1931 states and 3096 transitions. [2022-04-15 11:17:30,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 3096 transitions. [2022-04-15 11:17:30,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:30,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:30,459 INFO L74 IsIncluded]: Start isIncluded. First operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1931 states. [2022-04-15 11:17:30,461 INFO L87 Difference]: Start difference. First operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1931 states. [2022-04-15 11:17:30,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:30,608 INFO L93 Difference]: Finished difference Result 1931 states and 3096 transitions. [2022-04-15 11:17:30,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 3096 transitions. [2022-04-15 11:17:30,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:30,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:30,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:30,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:30,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:30,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2391 transitions. [2022-04-15 11:17:30,802 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2391 transitions. Word has length 27 [2022-04-15 11:17:30,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:30,803 INFO L478 AbstractCegarLoop]: Abstraction has 1545 states and 2391 transitions. [2022-04-15 11:17:30,803 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:30,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1545 states and 2391 transitions. [2022-04-15 11:17:33,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2391 edges. 2391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:33,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2391 transitions. [2022-04-15 11:17:33,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 11:17:33,092 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:33,093 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:33,093 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 11:17:33,093 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:33,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:33,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1981570756, now seen corresponding path program 1 times [2022-04-15 11:17:33,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:33,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1011052521] [2022-04-15 11:17:33,094 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:33,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1981570756, now seen corresponding path program 2 times [2022-04-15 11:17:33,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:33,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957471744] [2022-04-15 11:17:33,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:33,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:33,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:33,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {52031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {52025#true} is VALID [2022-04-15 11:17:33,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {52025#true} assume true; {52025#true} is VALID [2022-04-15 11:17:33,166 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52025#true} {52025#true} #217#return; {52025#true} is VALID [2022-04-15 11:17:33,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {52025#true} call ULTIMATE.init(); {52031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:33,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {52031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {52025#true} is VALID [2022-04-15 11:17:33,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {52025#true} assume true; {52025#true} is VALID [2022-04-15 11:17:33,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52025#true} {52025#true} #217#return; {52025#true} is VALID [2022-04-15 11:17:33,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {52025#true} call #t~ret16 := main(); {52025#true} is VALID [2022-04-15 11:17:33,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {52025#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;havoc ~cond~0; {52025#true} is VALID [2022-04-15 11:17:33,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {52025#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {52025#true} is VALID [2022-04-15 11:17:33,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {52025#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; {52025#true} is VALID [2022-04-15 11:17:33,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {52025#true} assume !(0 != ~p1~0); {52025#true} is VALID [2022-04-15 11:17:33,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {52025#true} assume !(0 != ~p2~0); {52025#true} is VALID [2022-04-15 11:17:33,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {52025#true} assume !(0 != ~p3~0); {52025#true} is VALID [2022-04-15 11:17:33,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {52025#true} assume !(0 != ~p4~0); {52025#true} is VALID [2022-04-15 11:17:33,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {52025#true} assume !(0 != ~p5~0); {52025#true} is VALID [2022-04-15 11:17:33,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {52025#true} assume !(0 != ~p6~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:33,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {52030#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {52030#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:33,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {52030#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {52030#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:33,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {52030#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {52030#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:33,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p10~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:33,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {52030#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {52030#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:33,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p1~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:33,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p2~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:33,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p3~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:33,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p4~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:33,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p5~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:33,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {52030#(= main_~p6~0 0)} assume 0 != ~p6~0; {52026#false} is VALID [2022-04-15 11:17:33,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {52026#false} assume 1 != ~lk6~0; {52026#false} is VALID [2022-04-15 11:17:33,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {52026#false} assume !false; {52026#false} is VALID [2022-04-15 11:17:33,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:33,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:33,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957471744] [2022-04-15 11:17:33,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957471744] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:33,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:33,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:33,174 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:33,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1011052521] [2022-04-15 11:17:33,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1011052521] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:33,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:33,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:33,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903367715] [2022-04-15 11:17:33,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:33,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 11:17:33,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:33,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:33,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:33,195 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:33,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:33,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:33,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:33,195 INFO L87 Difference]: Start difference. First operand 1545 states and 2391 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:34,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:34,031 INFO L93 Difference]: Finished difference Result 3597 states and 5593 transitions. [2022-04-15 11:17:34,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:34,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 11:17:34,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:34,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:34,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2022-04-15 11:17:34,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:34,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2022-04-15 11:17:34,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 195 transitions. [2022-04-15 11:17:34,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:34,456 INFO L225 Difference]: With dead ends: 3597 [2022-04-15 11:17:34,456 INFO L226 Difference]: Without dead ends: 2091 [2022-04-15 11:17:34,459 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:34,459 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 133 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:34,459 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 113 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:34,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2022-04-15 11:17:34,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 2089. [2022-04-15 11:17:34,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:34,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2091 states. Second operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:34,677 INFO L74 IsIncluded]: Start isIncluded. First operand 2091 states. Second operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:34,680 INFO L87 Difference]: Start difference. First operand 2091 states. Second operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:34,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:34,840 INFO L93 Difference]: Finished difference Result 2091 states and 3208 transitions. [2022-04-15 11:17:34,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3208 transitions. [2022-04-15 11:17:34,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:34,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:34,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2091 states. [2022-04-15 11:17:34,848 INFO L87 Difference]: Start difference. First operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2091 states. [2022-04-15 11:17:35,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:35,021 INFO L93 Difference]: Finished difference Result 2091 states and 3208 transitions. [2022-04-15 11:17:35,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3208 transitions. [2022-04-15 11:17:35,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:35,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:35,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:35,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:35,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:35,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 3207 transitions. [2022-04-15 11:17:35,311 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 3207 transitions. Word has length 27 [2022-04-15 11:17:35,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:35,311 INFO L478 AbstractCegarLoop]: Abstraction has 2089 states and 3207 transitions. [2022-04-15 11:17:35,312 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:35,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2089 states and 3207 transitions. [2022-04-15 11:17:38,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3207 edges. 3207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:38,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 3207 transitions. [2022-04-15 11:17:38,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 11:17:38,590 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:38,590 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:38,590 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 11:17:38,590 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:38,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:38,590 INFO L85 PathProgramCache]: Analyzing trace with hash -19072850, now seen corresponding path program 1 times [2022-04-15 11:17:38,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:38,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1296309614] [2022-04-15 11:17:38,591 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:38,591 INFO L85 PathProgramCache]: Analyzing trace with hash -19072850, now seen corresponding path program 2 times [2022-04-15 11:17:38,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:38,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541722621] [2022-04-15 11:17:38,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:38,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:38,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:38,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {67597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {67591#true} is VALID [2022-04-15 11:17:38,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {67591#true} assume true; {67591#true} is VALID [2022-04-15 11:17:38,626 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67591#true} {67591#true} #217#return; {67591#true} is VALID [2022-04-15 11:17:38,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {67591#true} call ULTIMATE.init(); {67597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:38,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {67597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {67591#true} is VALID [2022-04-15 11:17:38,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {67591#true} assume true; {67591#true} is VALID [2022-04-15 11:17:38,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67591#true} {67591#true} #217#return; {67591#true} is VALID [2022-04-15 11:17:38,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {67591#true} call #t~ret16 := main(); {67591#true} is VALID [2022-04-15 11:17:38,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {67591#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;havoc ~cond~0; {67591#true} is VALID [2022-04-15 11:17:38,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {67591#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {67591#true} is VALID [2022-04-15 11:17:38,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {67591#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; {67591#true} is VALID [2022-04-15 11:17:38,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {67591#true} assume !(0 != ~p1~0); {67591#true} is VALID [2022-04-15 11:17:38,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {67591#true} assume !(0 != ~p2~0); {67591#true} is VALID [2022-04-15 11:17:38,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {67591#true} assume !(0 != ~p3~0); {67591#true} is VALID [2022-04-15 11:17:38,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {67591#true} assume !(0 != ~p4~0); {67591#true} is VALID [2022-04-15 11:17:38,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {67591#true} assume !(0 != ~p5~0); {67591#true} is VALID [2022-04-15 11:17:38,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {67591#true} assume 0 != ~p6~0;~lk6~0 := 1; {67596#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:38,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {67596#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {67596#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:38,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {67596#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {67596#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:38,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {67596#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {67596#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:38,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:38,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {67596#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {67596#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:38,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:38,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:38,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:38,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:38,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:38,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {67592#false} is VALID [2022-04-15 11:17:38,632 INFO L290 TraceCheckUtils]: 25: Hoare triple {67592#false} assume 0 != ~p7~0; {67592#false} is VALID [2022-04-15 11:17:38,632 INFO L290 TraceCheckUtils]: 26: Hoare triple {67592#false} assume 1 != ~lk7~0; {67592#false} is VALID [2022-04-15 11:17:38,633 INFO L290 TraceCheckUtils]: 27: Hoare triple {67592#false} assume !false; {67592#false} is VALID [2022-04-15 11:17:38,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:38,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:38,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541722621] [2022-04-15 11:17:38,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541722621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:38,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:38,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:38,633 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:38,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1296309614] [2022-04-15 11:17:38,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1296309614] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:38,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:38,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:38,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805462569] [2022-04-15 11:17:38,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:38,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 11:17:38,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:38,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:38,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:38,651 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:38,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:38,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:38,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:38,651 INFO L87 Difference]: Start difference. First operand 2089 states and 3207 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:39,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:39,459 INFO L93 Difference]: Finished difference Result 3133 states and 4793 transitions. [2022-04-15 11:17:39,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:39,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 11:17:39,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:39,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:39,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2022-04-15 11:17:39,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:39,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2022-04-15 11:17:39,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 190 transitions. [2022-04-15 11:17:39,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:39,894 INFO L225 Difference]: With dead ends: 3133 [2022-04-15 11:17:39,894 INFO L226 Difference]: Without dead ends: 2123 [2022-04-15 11:17:39,896 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:39,896 INFO L913 BasicCegarLoop]: 101 mSDtfsCounter, 139 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:39,896 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 108 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:39,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2022-04-15 11:17:40,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2121. [2022-04-15 11:17:40,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:40,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2123 states. Second operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:40,090 INFO L74 IsIncluded]: Start isIncluded. First operand 2123 states. Second operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:40,093 INFO L87 Difference]: Start difference. First operand 2123 states. Second operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:40,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:40,268 INFO L93 Difference]: Finished difference Result 2123 states and 3208 transitions. [2022-04-15 11:17:40,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3208 transitions. [2022-04-15 11:17:40,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:40,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:40,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2123 states. [2022-04-15 11:17:40,277 INFO L87 Difference]: Start difference. First operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2123 states. [2022-04-15 11:17:40,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:40,462 INFO L93 Difference]: Finished difference Result 2123 states and 3208 transitions. [2022-04-15 11:17:40,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3208 transitions. [2022-04-15 11:17:40,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:40,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:40,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:40,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:40,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:40,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 3207 transitions. [2022-04-15 11:17:40,711 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 3207 transitions. Word has length 28 [2022-04-15 11:17:40,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:40,711 INFO L478 AbstractCegarLoop]: Abstraction has 2121 states and 3207 transitions. [2022-04-15 11:17:40,712 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:40,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2121 states and 3207 transitions. [2022-04-15 11:17:43,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3207 edges. 3207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:43,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 3207 transitions. [2022-04-15 11:17:43,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 11:17:43,945 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:43,945 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:43,945 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 11:17:43,946 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:43,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:43,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1298936528, now seen corresponding path program 1 times [2022-04-15 11:17:43,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:43,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1556866555] [2022-04-15 11:17:43,946 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:43,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1298936528, now seen corresponding path program 2 times [2022-04-15 11:17:43,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:43,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095997503] [2022-04-15 11:17:43,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:43,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:43,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:43,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {82363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {82357#true} is VALID [2022-04-15 11:17:43,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {82357#true} assume true; {82357#true} is VALID [2022-04-15 11:17:43,979 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {82357#true} {82357#true} #217#return; {82357#true} is VALID [2022-04-15 11:17:43,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {82357#true} call ULTIMATE.init(); {82363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:43,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {82363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {82357#true} is VALID [2022-04-15 11:17:43,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {82357#true} assume true; {82357#true} is VALID [2022-04-15 11:17:43,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82357#true} {82357#true} #217#return; {82357#true} is VALID [2022-04-15 11:17:43,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {82357#true} call #t~ret16 := main(); {82357#true} is VALID [2022-04-15 11:17:43,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {82357#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;havoc ~cond~0; {82357#true} is VALID [2022-04-15 11:17:43,980 INFO L290 TraceCheckUtils]: 6: Hoare triple {82357#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {82357#true} is VALID [2022-04-15 11:17:43,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {82357#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; {82357#true} is VALID [2022-04-15 11:17:43,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {82357#true} assume !(0 != ~p1~0); {82357#true} is VALID [2022-04-15 11:17:43,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {82357#true} assume !(0 != ~p2~0); {82357#true} is VALID [2022-04-15 11:17:43,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {82357#true} assume !(0 != ~p3~0); {82357#true} is VALID [2022-04-15 11:17:43,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {82357#true} assume !(0 != ~p4~0); {82357#true} is VALID [2022-04-15 11:17:43,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {82357#true} assume !(0 != ~p5~0); {82357#true} is VALID [2022-04-15 11:17:43,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {82357#true} assume !(0 != ~p6~0); {82357#true} is VALID [2022-04-15 11:17:43,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {82357#true} assume 0 != ~p7~0;~lk7~0 := 1; {82362#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:43,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {82362#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {82362#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:43,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {82362#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {82362#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:43,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:43,983 INFO L290 TraceCheckUtils]: 18: Hoare triple {82362#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {82362#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:43,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:43,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:43,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:43,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:43,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:43,984 INFO L290 TraceCheckUtils]: 24: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:43,985 INFO L290 TraceCheckUtils]: 25: Hoare triple {82362#(= main_~lk7~0 1)} assume 0 != ~p7~0; {82362#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:43,985 INFO L290 TraceCheckUtils]: 26: Hoare triple {82362#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {82358#false} is VALID [2022-04-15 11:17:43,985 INFO L290 TraceCheckUtils]: 27: Hoare triple {82358#false} assume !false; {82358#false} is VALID [2022-04-15 11:17:43,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:43,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:43,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095997503] [2022-04-15 11:17:43,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095997503] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:43,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:43,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:43,986 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:43,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1556866555] [2022-04-15 11:17:43,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1556866555] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:43,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:43,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:43,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741928848] [2022-04-15 11:17:43,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:43,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 11:17:43,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:43,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:44,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:44,004 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:44,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:44,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:44,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:44,004 INFO L87 Difference]: Start difference. First operand 2121 states and 3207 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:45,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:45,003 INFO L93 Difference]: Finished difference Result 3725 states and 5737 transitions. [2022-04-15 11:17:45,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:45,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 11:17:45,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:45,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:45,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-15 11:17:45,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:45,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-15 11:17:45,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 119 transitions. [2022-04-15 11:17:45,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:46,083 INFO L225 Difference]: With dead ends: 3725 [2022-04-15 11:17:46,083 INFO L226 Difference]: Without dead ends: 3723 [2022-04-15 11:17:46,084 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:46,084 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 143 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:46,085 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 78 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:46,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2022-04-15 11:17:46,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3081. [2022-04-15 11:17:46,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:46,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3723 states. Second operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:46,399 INFO L74 IsIncluded]: Start isIncluded. First operand 3723 states. Second operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:46,403 INFO L87 Difference]: Start difference. First operand 3723 states. Second operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:46,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:46,797 INFO L93 Difference]: Finished difference Result 3723 states and 5672 transitions. [2022-04-15 11:17:46,797 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5672 transitions. [2022-04-15 11:17:46,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:46,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:46,804 INFO L74 IsIncluded]: Start isIncluded. First operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3723 states. [2022-04-15 11:17:46,806 INFO L87 Difference]: Start difference. First operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3723 states. [2022-04-15 11:17:47,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:47,171 INFO L93 Difference]: Finished difference Result 3723 states and 5672 transitions. [2022-04-15 11:17:47,171 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5672 transitions. [2022-04-15 11:17:47,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:47,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:47,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:47,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:47,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:47,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 4519 transitions. [2022-04-15 11:17:47,646 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 4519 transitions. Word has length 28 [2022-04-15 11:17:47,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:47,647 INFO L478 AbstractCegarLoop]: Abstraction has 3081 states and 4519 transitions. [2022-04-15 11:17:47,647 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:47,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3081 states and 4519 transitions. [2022-04-15 11:17:52,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4519 edges. 4519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:52,187 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 4519 transitions. [2022-04-15 11:17:52,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 11:17:52,191 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:52,191 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:52,191 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 11:17:52,191 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:52,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:52,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1984913518, now seen corresponding path program 1 times [2022-04-15 11:17:52,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:52,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1063019434] [2022-04-15 11:17:52,192 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:52,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1984913518, now seen corresponding path program 2 times [2022-04-15 11:17:52,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:52,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672903615] [2022-04-15 11:17:52,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:52,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:52,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:52,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {103433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {103427#true} is VALID [2022-04-15 11:17:52,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {103427#true} assume true; {103427#true} is VALID [2022-04-15 11:17:52,234 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {103427#true} {103427#true} #217#return; {103427#true} is VALID [2022-04-15 11:17:52,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {103427#true} call ULTIMATE.init(); {103433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:52,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {103433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {103427#true} is VALID [2022-04-15 11:17:52,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {103427#true} assume true; {103427#true} is VALID [2022-04-15 11:17:52,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {103427#true} {103427#true} #217#return; {103427#true} is VALID [2022-04-15 11:17:52,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {103427#true} call #t~ret16 := main(); {103427#true} is VALID [2022-04-15 11:17:52,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {103427#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;havoc ~cond~0; {103427#true} is VALID [2022-04-15 11:17:52,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {103427#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {103427#true} is VALID [2022-04-15 11:17:52,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {103427#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; {103427#true} is VALID [2022-04-15 11:17:52,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {103427#true} assume !(0 != ~p1~0); {103427#true} is VALID [2022-04-15 11:17:52,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {103427#true} assume !(0 != ~p2~0); {103427#true} is VALID [2022-04-15 11:17:52,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {103427#true} assume !(0 != ~p3~0); {103427#true} is VALID [2022-04-15 11:17:52,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {103427#true} assume !(0 != ~p4~0); {103427#true} is VALID [2022-04-15 11:17:52,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {103427#true} assume !(0 != ~p5~0); {103427#true} is VALID [2022-04-15 11:17:52,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {103427#true} assume !(0 != ~p6~0); {103427#true} is VALID [2022-04-15 11:17:52,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {103427#true} assume !(0 != ~p7~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:52,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {103432#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {103432#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:52,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {103432#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {103432#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:52,237 INFO L290 TraceCheckUtils]: 17: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p10~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:52,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {103432#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {103432#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:52,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p1~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:52,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p2~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:52,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p3~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:52,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p4~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:52,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p5~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:52,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p6~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:52,240 INFO L290 TraceCheckUtils]: 25: Hoare triple {103432#(= main_~p7~0 0)} assume 0 != ~p7~0; {103428#false} is VALID [2022-04-15 11:17:52,240 INFO L290 TraceCheckUtils]: 26: Hoare triple {103428#false} assume 1 != ~lk7~0; {103428#false} is VALID [2022-04-15 11:17:52,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {103428#false} assume !false; {103428#false} is VALID [2022-04-15 11:17:52,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:52,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:52,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672903615] [2022-04-15 11:17:52,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672903615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:52,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:52,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:52,241 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:52,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1063019434] [2022-04-15 11:17:52,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1063019434] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:52,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:52,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:52,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455346970] [2022-04-15 11:17:52,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:52,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 11:17:52,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:52,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:52,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:52,261 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:52,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:52,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:52,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:52,262 INFO L87 Difference]: Start difference. First operand 3081 states and 4519 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:54,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:54,995 INFO L93 Difference]: Finished difference Result 7117 states and 10473 transitions. [2022-04-15 11:17:54,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:54,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 11:17:54,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:54,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:54,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-04-15 11:17:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:54,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-04-15 11:17:54,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 192 transitions. [2022-04-15 11:17:55,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:56,311 INFO L225 Difference]: With dead ends: 7117 [2022-04-15 11:17:56,311 INFO L226 Difference]: Without dead ends: 4107 [2022-04-15 11:17:56,315 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:56,316 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 127 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:56,316 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 115 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:56,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2022-04-15 11:17:56,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 4105. [2022-04-15 11:17:56,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:56,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4107 states. Second operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:56,710 INFO L74 IsIncluded]: Start isIncluded. First operand 4107 states. Second operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:56,713 INFO L87 Difference]: Start difference. First operand 4107 states. Second operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:57,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:57,141 INFO L93 Difference]: Finished difference Result 4107 states and 5960 transitions. [2022-04-15 11:17:57,141 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 5960 transitions. [2022-04-15 11:17:57,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:57,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:57,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4107 states. [2022-04-15 11:17:57,152 INFO L87 Difference]: Start difference. First operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4107 states. [2022-04-15 11:17:57,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:57,604 INFO L93 Difference]: Finished difference Result 4107 states and 5960 transitions. [2022-04-15 11:17:57,604 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 5960 transitions. [2022-04-15 11:17:57,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:57,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:57,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:57,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:57,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:58,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4105 states to 4105 states and 5959 transitions. [2022-04-15 11:17:58,371 INFO L78 Accepts]: Start accepts. Automaton has 4105 states and 5959 transitions. Word has length 28 [2022-04-15 11:17:58,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:58,371 INFO L478 AbstractCegarLoop]: Abstraction has 4105 states and 5959 transitions. [2022-04-15 11:17:58,372 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:58,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4105 states and 5959 transitions. [2022-04-15 11:18:04,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5959 edges. 5959 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:04,532 INFO L276 IsEmpty]: Start isEmpty. Operand 4105 states and 5959 transitions. [2022-04-15 11:18:04,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 11:18:04,535 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:04,535 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:18:04,535 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 11:18:04,535 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:04,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:04,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1612111599, now seen corresponding path program 1 times [2022-04-15 11:18:04,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:04,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2127705671] [2022-04-15 11:18:04,536 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:04,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1612111599, now seen corresponding path program 2 times [2022-04-15 11:18:04,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:04,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846504322] [2022-04-15 11:18:04,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:04,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:04,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:04,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {134103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {134097#true} is VALID [2022-04-15 11:18:04,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {134097#true} assume true; {134097#true} is VALID [2022-04-15 11:18:04,580 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {134097#true} {134097#true} #217#return; {134097#true} is VALID [2022-04-15 11:18:04,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {134097#true} call ULTIMATE.init(); {134103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:04,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {134103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {134097#true} is VALID [2022-04-15 11:18:04,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {134097#true} assume true; {134097#true} is VALID [2022-04-15 11:18:04,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134097#true} {134097#true} #217#return; {134097#true} is VALID [2022-04-15 11:18:04,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {134097#true} call #t~ret16 := main(); {134097#true} is VALID [2022-04-15 11:18:04,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {134097#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;havoc ~cond~0; {134097#true} is VALID [2022-04-15 11:18:04,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {134097#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {134097#true} is VALID [2022-04-15 11:18:04,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {134097#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; {134097#true} is VALID [2022-04-15 11:18:04,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {134097#true} assume !(0 != ~p1~0); {134097#true} is VALID [2022-04-15 11:18:04,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {134097#true} assume !(0 != ~p2~0); {134097#true} is VALID [2022-04-15 11:18:04,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {134097#true} assume !(0 != ~p3~0); {134097#true} is VALID [2022-04-15 11:18:04,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {134097#true} assume !(0 != ~p4~0); {134097#true} is VALID [2022-04-15 11:18:04,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {134097#true} assume !(0 != ~p5~0); {134097#true} is VALID [2022-04-15 11:18:04,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {134097#true} assume !(0 != ~p6~0); {134097#true} is VALID [2022-04-15 11:18:04,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {134097#true} assume 0 != ~p7~0;~lk7~0 := 1; {134102#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:04,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {134102#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {134102#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:04,582 INFO L290 TraceCheckUtils]: 16: Hoare triple {134102#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {134102#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:04,582 INFO L290 TraceCheckUtils]: 17: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:04,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {134102#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {134102#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:04,583 INFO L290 TraceCheckUtils]: 19: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:04,583 INFO L290 TraceCheckUtils]: 20: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:04,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:04,584 INFO L290 TraceCheckUtils]: 22: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:04,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:04,584 INFO L290 TraceCheckUtils]: 24: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:04,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {134098#false} is VALID [2022-04-15 11:18:04,585 INFO L290 TraceCheckUtils]: 26: Hoare triple {134098#false} assume 0 != ~p8~0; {134098#false} is VALID [2022-04-15 11:18:04,585 INFO L290 TraceCheckUtils]: 27: Hoare triple {134098#false} assume 1 != ~lk8~0; {134098#false} is VALID [2022-04-15 11:18:04,585 INFO L290 TraceCheckUtils]: 28: Hoare triple {134098#false} assume !false; {134098#false} is VALID [2022-04-15 11:18:04,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-15 11:18:04,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:04,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846504322] [2022-04-15 11:18:04,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846504322] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:04,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:04,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:04,585 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:04,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2127705671] [2022-04-15 11:18:04,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2127705671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:04,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:04,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:04,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84855749] [2022-04-15 11:18:04,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:04,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 11:18:04,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:04,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:04,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:04,603 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:04,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:04,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:04,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:04,603 INFO L87 Difference]: Start difference. First operand 4105 states and 5959 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:06,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:06,752 INFO L93 Difference]: Finished difference Result 6157 states and 8905 transitions. [2022-04-15 11:18:06,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:06,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 11:18:06,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:06,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-15 11:18:06,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:06,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-15 11:18:06,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 187 transitions. [2022-04-15 11:18:06,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:08,092 INFO L225 Difference]: With dead ends: 6157 [2022-04-15 11:18:08,092 INFO L226 Difference]: Without dead ends: 4171 [2022-04-15 11:18:08,095 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:18:08,095 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 138 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:08,095 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 105 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:18:08,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4171 states. [2022-04-15 11:18:08,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4171 to 4169. [2022-04-15 11:18:08,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:08,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4171 states. Second operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:08,434 INFO L74 IsIncluded]: Start isIncluded. First operand 4171 states. Second operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:08,436 INFO L87 Difference]: Start difference. First operand 4171 states. Second operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:08,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:08,874 INFO L93 Difference]: Finished difference Result 4171 states and 5960 transitions. [2022-04-15 11:18:08,874 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 5960 transitions. [2022-04-15 11:18:08,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:08,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:08,882 INFO L74 IsIncluded]: Start isIncluded. First operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4171 states. [2022-04-15 11:18:08,885 INFO L87 Difference]: Start difference. First operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4171 states. [2022-04-15 11:18:09,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:09,364 INFO L93 Difference]: Finished difference Result 4171 states and 5960 transitions. [2022-04-15 11:18:09,365 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 5960 transitions. [2022-04-15 11:18:09,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:09,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:09,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:09,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:10,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4169 states to 4169 states and 5959 transitions. [2022-04-15 11:18:10,102 INFO L78 Accepts]: Start accepts. Automaton has 4169 states and 5959 transitions. Word has length 29 [2022-04-15 11:18:10,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:10,102 INFO L478 AbstractCegarLoop]: Abstraction has 4169 states and 5959 transitions. [2022-04-15 11:18:10,102 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:10,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4169 states and 5959 transitions. [2022-04-15 11:18:16,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5959 edges. 5959 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:16,338 INFO L276 IsEmpty]: Start isEmpty. Operand 4169 states and 5959 transitions. [2022-04-15 11:18:16,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 11:18:16,341 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:16,341 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:18:16,341 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 11:18:16,341 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:16,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:16,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1402992019, now seen corresponding path program 1 times [2022-04-15 11:18:16,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:16,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1371766647] [2022-04-15 11:18:16,342 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:16,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1402992019, now seen corresponding path program 2 times [2022-04-15 11:18:16,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:16,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293358364] [2022-04-15 11:18:16,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:16,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:16,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:16,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {163109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {163103#true} is VALID [2022-04-15 11:18:16,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {163103#true} assume true; {163103#true} is VALID [2022-04-15 11:18:16,386 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {163103#true} {163103#true} #217#return; {163103#true} is VALID [2022-04-15 11:18:16,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {163103#true} call ULTIMATE.init(); {163109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:16,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {163109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {163103#true} is VALID [2022-04-15 11:18:16,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {163103#true} assume true; {163103#true} is VALID [2022-04-15 11:18:16,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163103#true} {163103#true} #217#return; {163103#true} is VALID [2022-04-15 11:18:16,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {163103#true} call #t~ret16 := main(); {163103#true} is VALID [2022-04-15 11:18:16,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {163103#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;havoc ~cond~0; {163103#true} is VALID [2022-04-15 11:18:16,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {163103#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {163103#true} is VALID [2022-04-15 11:18:16,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {163103#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; {163103#true} is VALID [2022-04-15 11:18:16,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {163103#true} assume !(0 != ~p1~0); {163103#true} is VALID [2022-04-15 11:18:16,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {163103#true} assume !(0 != ~p2~0); {163103#true} is VALID [2022-04-15 11:18:16,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {163103#true} assume !(0 != ~p3~0); {163103#true} is VALID [2022-04-15 11:18:16,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {163103#true} assume !(0 != ~p4~0); {163103#true} is VALID [2022-04-15 11:18:16,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {163103#true} assume !(0 != ~p5~0); {163103#true} is VALID [2022-04-15 11:18:16,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {163103#true} assume !(0 != ~p6~0); {163103#true} is VALID [2022-04-15 11:18:16,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {163103#true} assume !(0 != ~p7~0); {163103#true} is VALID [2022-04-15 11:18:16,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {163103#true} assume 0 != ~p8~0;~lk8~0 := 1; {163108#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:16,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {163108#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {163108#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:16,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:16,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {163108#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {163108#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:16,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:16,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:16,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:16,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:16,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:16,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:16,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:16,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {163108#(= main_~lk8~0 1)} assume 0 != ~p8~0; {163108#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:16,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {163108#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {163104#false} is VALID [2022-04-15 11:18:16,392 INFO L290 TraceCheckUtils]: 28: Hoare triple {163104#false} assume !false; {163104#false} is VALID [2022-04-15 11:18:16,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:18:16,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:16,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293358364] [2022-04-15 11:18:16,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293358364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:16,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:16,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:16,393 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:16,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1371766647] [2022-04-15 11:18:16,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1371766647] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:16,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:16,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:16,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629119705] [2022-04-15 11:18:16,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:16,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 11:18:16,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:16,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:16,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:16,411 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:16,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:16,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:16,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:16,412 INFO L87 Difference]: Start difference. First operand 4169 states and 5959 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:19,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:19,331 INFO L93 Difference]: Finished difference Result 7181 states and 10441 transitions. [2022-04-15 11:18:19,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:19,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 11:18:19,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:19,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:19,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-15 11:18:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:19,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-15 11:18:19,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-15 11:18:19,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:23,148 INFO L225 Difference]: With dead ends: 7181 [2022-04-15 11:18:23,149 INFO L226 Difference]: Without dead ends: 7179 [2022-04-15 11:18:23,150 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:18:23,150 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:23,151 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 77 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:18:23,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7179 states. [2022-04-15 11:18:23,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7179 to 6153. [2022-04-15 11:18:23,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:23,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7179 states. Second operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:23,633 INFO L74 IsIncluded]: Start isIncluded. First operand 7179 states. Second operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:23,639 INFO L87 Difference]: Start difference. First operand 7179 states. Second operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:24,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:24,918 INFO L93 Difference]: Finished difference Result 7179 states and 10312 transitions. [2022-04-15 11:18:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 7179 states and 10312 transitions. [2022-04-15 11:18:24,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:24,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:24,930 INFO L74 IsIncluded]: Start isIncluded. First operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 7179 states. [2022-04-15 11:18:24,933 INFO L87 Difference]: Start difference. First operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 7179 states. [2022-04-15 11:18:26,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:26,289 INFO L93 Difference]: Finished difference Result 7179 states and 10312 transitions. [2022-04-15 11:18:26,289 INFO L276 IsEmpty]: Start isEmpty. Operand 7179 states and 10312 transitions. [2022-04-15 11:18:26,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:26,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:26,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:26,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:26,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:28,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 8519 transitions. [2022-04-15 11:18:28,042 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 8519 transitions. Word has length 29 [2022-04-15 11:18:28,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:28,042 INFO L478 AbstractCegarLoop]: Abstraction has 6153 states and 8519 transitions. [2022-04-15 11:18:28,042 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:28,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6153 states and 8519 transitions. [2022-04-15 11:18:36,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8519 edges. 8519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:36,982 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 8519 transitions. [2022-04-15 11:18:36,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 11:18:36,986 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:36,986 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:18:36,986 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 11:18:36,986 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:36,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:36,986 INFO L85 PathProgramCache]: Analyzing trace with hash 391874769, now seen corresponding path program 1 times [2022-04-15 11:18:36,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:36,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1993660305] [2022-04-15 11:18:36,987 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:36,987 INFO L85 PathProgramCache]: Analyzing trace with hash 391874769, now seen corresponding path program 2 times [2022-04-15 11:18:36,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:36,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043900128] [2022-04-15 11:18:36,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:36,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:37,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:37,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {204147#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {204141#true} is VALID [2022-04-15 11:18:37,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {204141#true} assume true; {204141#true} is VALID [2022-04-15 11:18:37,028 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {204141#true} {204141#true} #217#return; {204141#true} is VALID [2022-04-15 11:18:37,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {204141#true} call ULTIMATE.init(); {204147#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:37,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {204147#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {204141#true} is VALID [2022-04-15 11:18:37,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {204141#true} assume true; {204141#true} is VALID [2022-04-15 11:18:37,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204141#true} {204141#true} #217#return; {204141#true} is VALID [2022-04-15 11:18:37,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {204141#true} call #t~ret16 := main(); {204141#true} is VALID [2022-04-15 11:18:37,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {204141#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;havoc ~cond~0; {204141#true} is VALID [2022-04-15 11:18:37,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {204141#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {204141#true} is VALID [2022-04-15 11:18:37,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {204141#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; {204141#true} is VALID [2022-04-15 11:18:37,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {204141#true} assume !(0 != ~p1~0); {204141#true} is VALID [2022-04-15 11:18:37,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {204141#true} assume !(0 != ~p2~0); {204141#true} is VALID [2022-04-15 11:18:37,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {204141#true} assume !(0 != ~p3~0); {204141#true} is VALID [2022-04-15 11:18:37,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {204141#true} assume !(0 != ~p4~0); {204141#true} is VALID [2022-04-15 11:18:37,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {204141#true} assume !(0 != ~p5~0); {204141#true} is VALID [2022-04-15 11:18:37,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {204141#true} assume !(0 != ~p6~0); {204141#true} is VALID [2022-04-15 11:18:37,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {204141#true} assume !(0 != ~p7~0); {204141#true} is VALID [2022-04-15 11:18:37,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {204141#true} assume !(0 != ~p8~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:37,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {204146#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {204146#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:37,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p10~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:37,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {204146#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {204146#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:37,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p1~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:37,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p2~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:37,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p3~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:37,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p4~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:37,033 INFO L290 TraceCheckUtils]: 23: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p5~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:37,033 INFO L290 TraceCheckUtils]: 24: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p6~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:37,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p7~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:37,034 INFO L290 TraceCheckUtils]: 26: Hoare triple {204146#(= main_~p8~0 0)} assume 0 != ~p8~0; {204142#false} is VALID [2022-04-15 11:18:37,034 INFO L290 TraceCheckUtils]: 27: Hoare triple {204142#false} assume 1 != ~lk8~0; {204142#false} is VALID [2022-04-15 11:18:37,034 INFO L290 TraceCheckUtils]: 28: Hoare triple {204142#false} assume !false; {204142#false} is VALID [2022-04-15 11:18:37,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:18:37,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:37,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043900128] [2022-04-15 11:18:37,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043900128] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:37,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:37,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:37,035 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:37,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1993660305] [2022-04-15 11:18:37,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1993660305] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:37,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:37,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:37,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420648927] [2022-04-15 11:18:37,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:37,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 11:18:37,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:37,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:37,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:37,053 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:37,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:37,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:37,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:37,054 INFO L87 Difference]: Start difference. First operand 6153 states and 8519 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:46,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:46,542 INFO L93 Difference]: Finished difference Result 14093 states and 19529 transitions. [2022-04-15 11:18:46,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:46,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 11:18:46,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:46,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:46,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2022-04-15 11:18:46,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:46,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2022-04-15 11:18:46,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 189 transitions. [2022-04-15 11:18:46,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:51,240 INFO L225 Difference]: With dead ends: 14093 [2022-04-15 11:18:51,240 INFO L226 Difference]: Without dead ends: 8075 [2022-04-15 11:18:51,246 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:18:51,247 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 121 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:51,247 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 117 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:18:51,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8075 states. [2022-04-15 11:18:51,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8075 to 8073. [2022-04-15 11:18:51,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:51,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8075 states. Second operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:51,889 INFO L74 IsIncluded]: Start isIncluded. First operand 8075 states. Second operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:51,898 INFO L87 Difference]: Start difference. First operand 8075 states. Second operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:53,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:53,550 INFO L93 Difference]: Finished difference Result 8075 states and 11016 transitions. [2022-04-15 11:18:53,550 INFO L276 IsEmpty]: Start isEmpty. Operand 8075 states and 11016 transitions. [2022-04-15 11:18:53,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:53,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:53,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 8075 states. [2022-04-15 11:18:53,575 INFO L87 Difference]: Start difference. First operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 8075 states. [2022-04-15 11:18:55,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:55,188 INFO L93 Difference]: Finished difference Result 8075 states and 11016 transitions. [2022-04-15 11:18:55,188 INFO L276 IsEmpty]: Start isEmpty. Operand 8075 states and 11016 transitions. [2022-04-15 11:18:55,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:55,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:55,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:55,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:55,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:57,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8073 states to 8073 states and 11015 transitions. [2022-04-15 11:18:57,998 INFO L78 Accepts]: Start accepts. Automaton has 8073 states and 11015 transitions. Word has length 29 [2022-04-15 11:18:57,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:57,998 INFO L478 AbstractCegarLoop]: Abstraction has 8073 states and 11015 transitions. [2022-04-15 11:18:57,998 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:57,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8073 states and 11015 transitions. [2022-04-15 11:19:09,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11015 edges. 11015 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:09,828 INFO L276 IsEmpty]: Start isEmpty. Operand 8073 states and 11015 transitions. [2022-04-15 11:19:09,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 11:19:09,833 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:09,833 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:19:09,833 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 11:19:09,833 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:09,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:09,833 INFO L85 PathProgramCache]: Analyzing trace with hash 543295075, now seen corresponding path program 1 times [2022-04-15 11:19:09,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:09,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [717743398] [2022-04-15 11:19:09,834 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:09,834 INFO L85 PathProgramCache]: Analyzing trace with hash 543295075, now seen corresponding path program 2 times [2022-04-15 11:19:09,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:09,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767649110] [2022-04-15 11:19:09,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:09,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:09,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:09,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {264641#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {264635#true} is VALID [2022-04-15 11:19:09,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {264635#true} assume true; {264635#true} is VALID [2022-04-15 11:19:09,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {264635#true} {264635#true} #217#return; {264635#true} is VALID [2022-04-15 11:19:09,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {264635#true} call ULTIMATE.init(); {264641#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:19:09,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {264641#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {264635#true} is VALID [2022-04-15 11:19:09,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {264635#true} assume true; {264635#true} is VALID [2022-04-15 11:19:09,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {264635#true} {264635#true} #217#return; {264635#true} is VALID [2022-04-15 11:19:09,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {264635#true} call #t~ret16 := main(); {264635#true} is VALID [2022-04-15 11:19:09,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {264635#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;havoc ~cond~0; {264635#true} is VALID [2022-04-15 11:19:09,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {264635#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {264635#true} is VALID [2022-04-15 11:19:09,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {264635#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; {264635#true} is VALID [2022-04-15 11:19:09,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {264635#true} assume !(0 != ~p1~0); {264635#true} is VALID [2022-04-15 11:19:09,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {264635#true} assume !(0 != ~p2~0); {264635#true} is VALID [2022-04-15 11:19:09,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {264635#true} assume !(0 != ~p3~0); {264635#true} is VALID [2022-04-15 11:19:09,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {264635#true} assume !(0 != ~p4~0); {264635#true} is VALID [2022-04-15 11:19:09,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {264635#true} assume !(0 != ~p5~0); {264635#true} is VALID [2022-04-15 11:19:09,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {264635#true} assume !(0 != ~p6~0); {264635#true} is VALID [2022-04-15 11:19:09,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {264635#true} assume !(0 != ~p7~0); {264635#true} is VALID [2022-04-15 11:19:09,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {264635#true} assume 0 != ~p8~0;~lk8~0 := 1; {264640#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:09,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {264640#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {264640#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:09,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:09,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {264640#(not (= main_~p8~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {264640#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:09,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:09,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:09,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:09,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:09,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:09,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:09,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:09,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {264636#false} is VALID [2022-04-15 11:19:09,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {264636#false} assume 0 != ~p9~0; {264636#false} is VALID [2022-04-15 11:19:09,905 INFO L290 TraceCheckUtils]: 28: Hoare triple {264636#false} assume 1 != ~lk9~0; {264636#false} is VALID [2022-04-15 11:19:09,905 INFO L290 TraceCheckUtils]: 29: Hoare triple {264636#false} assume !false; {264636#false} is VALID [2022-04-15 11:19:09,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:19:09,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:09,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767649110] [2022-04-15 11:19:09,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767649110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:09,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:09,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:09,906 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:09,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [717743398] [2022-04-15 11:19:09,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [717743398] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:09,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:09,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:09,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021656751] [2022-04-15 11:19:09,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:09,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 11:19:09,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:09,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:09,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:09,931 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:09,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:09,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:09,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:09,932 INFO L87 Difference]: Start difference. First operand 8073 states and 11015 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:16,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:16,480 INFO L93 Difference]: Finished difference Result 12109 states and 16457 transitions. [2022-04-15 11:19:16,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:16,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 11:19:16,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:16,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:16,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-15 11:19:16,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:16,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-15 11:19:16,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 184 transitions. [2022-04-15 11:19:16,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:21,359 INFO L225 Difference]: With dead ends: 12109 [2022-04-15 11:19:21,360 INFO L226 Difference]: Without dead ends: 8203 [2022-04-15 11:19:21,364 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:19:21,364 INFO L913 BasicCegarLoop]: 95 mSDtfsCounter, 137 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:19:21,365 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 102 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:19:21,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8203 states. [2022-04-15 11:19:22,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8203 to 8201. [2022-04-15 11:19:22,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:22,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8203 states. Second operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:22,047 INFO L74 IsIncluded]: Start isIncluded. First operand 8203 states. Second operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:22,056 INFO L87 Difference]: Start difference. First operand 8203 states. Second operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:23,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:23,701 INFO L93 Difference]: Finished difference Result 8203 states and 11016 transitions. [2022-04-15 11:19:23,701 INFO L276 IsEmpty]: Start isEmpty. Operand 8203 states and 11016 transitions. [2022-04-15 11:19:23,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:23,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:23,721 INFO L74 IsIncluded]: Start isIncluded. First operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 8203 states. [2022-04-15 11:19:23,731 INFO L87 Difference]: Start difference. First operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 8203 states. [2022-04-15 11:19:25,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:25,324 INFO L93 Difference]: Finished difference Result 8203 states and 11016 transitions. [2022-04-15 11:19:25,324 INFO L276 IsEmpty]: Start isEmpty. Operand 8203 states and 11016 transitions. [2022-04-15 11:19:25,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:25,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:25,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:25,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:25,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8201 states to 8201 states and 11015 transitions. [2022-04-15 11:19:28,320 INFO L78 Accepts]: Start accepts. Automaton has 8201 states and 11015 transitions. Word has length 30 [2022-04-15 11:19:28,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:28,320 INFO L478 AbstractCegarLoop]: Abstraction has 8201 states and 11015 transitions. [2022-04-15 11:19:28,320 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:28,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8201 states and 11015 transitions. [2022-04-15 11:19:40,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11015 edges. 11015 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:40,358 INFO L276 IsEmpty]: Start isEmpty. Operand 8201 states and 11015 transitions. [2022-04-15 11:19:40,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 11:19:40,363 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:40,364 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:19:40,364 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 11:19:40,364 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:40,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:40,364 INFO L85 PathProgramCache]: Analyzing trace with hash -736568603, now seen corresponding path program 1 times [2022-04-15 11:19:40,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:40,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1966717673] [2022-04-15 11:19:40,364 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:40,364 INFO L85 PathProgramCache]: Analyzing trace with hash -736568603, now seen corresponding path program 2 times [2022-04-15 11:19:40,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:40,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547142256] [2022-04-15 11:19:40,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:40,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:40,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:40,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {321679#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {321673#true} is VALID [2022-04-15 11:19:40,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {321673#true} assume true; {321673#true} is VALID [2022-04-15 11:19:40,399 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {321673#true} {321673#true} #217#return; {321673#true} is VALID [2022-04-15 11:19:40,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {321673#true} call ULTIMATE.init(); {321679#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:19:40,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {321679#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {321673#true} is VALID [2022-04-15 11:19:40,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {321673#true} assume true; {321673#true} is VALID [2022-04-15 11:19:40,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {321673#true} {321673#true} #217#return; {321673#true} is VALID [2022-04-15 11:19:40,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {321673#true} call #t~ret16 := main(); {321673#true} is VALID [2022-04-15 11:19:40,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {321673#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;havoc ~cond~0; {321673#true} is VALID [2022-04-15 11:19:40,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {321673#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {321673#true} is VALID [2022-04-15 11:19:40,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {321673#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; {321673#true} is VALID [2022-04-15 11:19:40,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {321673#true} assume !(0 != ~p1~0); {321673#true} is VALID [2022-04-15 11:19:40,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {321673#true} assume !(0 != ~p2~0); {321673#true} is VALID [2022-04-15 11:19:40,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {321673#true} assume !(0 != ~p3~0); {321673#true} is VALID [2022-04-15 11:19:40,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {321673#true} assume !(0 != ~p4~0); {321673#true} is VALID [2022-04-15 11:19:40,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {321673#true} assume !(0 != ~p5~0); {321673#true} is VALID [2022-04-15 11:19:40,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {321673#true} assume !(0 != ~p6~0); {321673#true} is VALID [2022-04-15 11:19:40,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {321673#true} assume !(0 != ~p7~0); {321673#true} is VALID [2022-04-15 11:19:40,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {321673#true} assume !(0 != ~p8~0); {321673#true} is VALID [2022-04-15 11:19:40,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {321673#true} assume 0 != ~p9~0;~lk9~0 := 1; {321678#(= main_~lk9~0 1)} is VALID [2022-04-15 11:19:40,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-15 11:19:40,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {321678#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {321678#(= main_~lk9~0 1)} is VALID [2022-04-15 11:19:40,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-15 11:19:40,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-15 11:19:40,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-15 11:19:40,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-15 11:19:40,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-15 11:19:40,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-15 11:19:40,404 INFO L290 TraceCheckUtils]: 25: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-15 11:19:40,404 INFO L290 TraceCheckUtils]: 26: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-15 11:19:40,404 INFO L290 TraceCheckUtils]: 27: Hoare triple {321678#(= main_~lk9~0 1)} assume 0 != ~p9~0; {321678#(= main_~lk9~0 1)} is VALID [2022-04-15 11:19:40,405 INFO L290 TraceCheckUtils]: 28: Hoare triple {321678#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {321674#false} is VALID [2022-04-15 11:19:40,405 INFO L290 TraceCheckUtils]: 29: Hoare triple {321674#false} assume !false; {321674#false} is VALID [2022-04-15 11:19:40,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:19:40,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:40,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547142256] [2022-04-15 11:19:40,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547142256] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:40,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:40,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:40,405 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:40,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1966717673] [2022-04-15 11:19:40,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1966717673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:40,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:40,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:40,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668230400] [2022-04-15 11:19:40,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:40,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 11:19:40,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:40,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:40,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:40,424 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:40,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:40,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:40,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:40,425 INFO L87 Difference]: Start difference. First operand 8201 states and 11015 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:50,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:50,227 INFO L93 Difference]: Finished difference Result 13837 states and 18825 transitions. [2022-04-15 11:19:50,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:50,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 11:19:50,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:50,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:50,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-15 11:19:50,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:50,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-15 11:19:50,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-04-15 11:19:50,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:20:04,244 INFO L225 Difference]: With dead ends: 13837 [2022-04-15 11:20:04,245 INFO L226 Difference]: Without dead ends: 13835 [2022-04-15 11:20:04,247 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:20:04,247 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 129 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:20:04,248 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 76 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:20:04,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13835 states. [2022-04-15 11:20:05,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13835 to 12297. [2022-04-15 11:20:05,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:20:05,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13835 states. Second operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:05,262 INFO L74 IsIncluded]: Start isIncluded. First operand 13835 states. Second operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:05,276 INFO L87 Difference]: Start difference. First operand 13835 states. Second operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:10,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:20:10,268 INFO L93 Difference]: Finished difference Result 13835 states and 18568 transitions. [2022-04-15 11:20:10,268 INFO L276 IsEmpty]: Start isEmpty. Operand 13835 states and 18568 transitions. [2022-04-15 11:20:10,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:20:10,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:20:10,294 INFO L74 IsIncluded]: Start isIncluded. First operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13835 states. [2022-04-15 11:20:10,309 INFO L87 Difference]: Start difference. First operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13835 states. [2022-04-15 11:20:15,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:20:15,460 INFO L93 Difference]: Finished difference Result 13835 states and 18568 transitions. [2022-04-15 11:20:15,460 INFO L276 IsEmpty]: Start isEmpty. Operand 13835 states and 18568 transitions. [2022-04-15 11:20:15,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:20:15,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:20:15,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:20:15,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:20:15,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:22,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12297 states to 12297 states and 16007 transitions. [2022-04-15 11:20:22,550 INFO L78 Accepts]: Start accepts. Automaton has 12297 states and 16007 transitions. Word has length 30 [2022-04-15 11:20:22,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:20:22,550 INFO L478 AbstractCegarLoop]: Abstraction has 12297 states and 16007 transitions. [2022-04-15 11:20:22,550 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:22,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12297 states and 16007 transitions. [2022-04-15 11:20:40,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16007 edges. 16007 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:20:40,080 INFO L276 IsEmpty]: Start isEmpty. Operand 12297 states and 16007 transitions. [2022-04-15 11:20:40,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 11:20:40,095 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:20:40,095 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:20:40,095 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 11:20:40,095 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:20:40,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:20:40,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1747685853, now seen corresponding path program 1 times [2022-04-15 11:20:40,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:20:40,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1765053733] [2022-04-15 11:20:40,097 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:20:40,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1747685853, now seen corresponding path program 2 times [2022-04-15 11:20:40,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:20:40,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180767279] [2022-04-15 11:20:40,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:20:40,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:20:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:20:40,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:20:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:20:40,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {401629#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {401623#true} is VALID [2022-04-15 11:20:40,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {401623#true} assume true; {401623#true} is VALID [2022-04-15 11:20:40,137 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {401623#true} {401623#true} #217#return; {401623#true} is VALID [2022-04-15 11:20:40,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {401623#true} call ULTIMATE.init(); {401629#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:20:40,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {401629#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {401623#true} is VALID [2022-04-15 11:20:40,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {401623#true} assume true; {401623#true} is VALID [2022-04-15 11:20:40,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {401623#true} {401623#true} #217#return; {401623#true} is VALID [2022-04-15 11:20:40,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {401623#true} call #t~ret16 := main(); {401623#true} is VALID [2022-04-15 11:20:40,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {401623#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;havoc ~cond~0; {401623#true} is VALID [2022-04-15 11:20:40,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {401623#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {401623#true} is VALID [2022-04-15 11:20:40,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {401623#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; {401623#true} is VALID [2022-04-15 11:20:40,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {401623#true} assume !(0 != ~p1~0); {401623#true} is VALID [2022-04-15 11:20:40,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {401623#true} assume !(0 != ~p2~0); {401623#true} is VALID [2022-04-15 11:20:40,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {401623#true} assume !(0 != ~p3~0); {401623#true} is VALID [2022-04-15 11:20:40,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {401623#true} assume !(0 != ~p4~0); {401623#true} is VALID [2022-04-15 11:20:40,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {401623#true} assume !(0 != ~p5~0); {401623#true} is VALID [2022-04-15 11:20:40,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {401623#true} assume !(0 != ~p6~0); {401623#true} is VALID [2022-04-15 11:20:40,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {401623#true} assume !(0 != ~p7~0); {401623#true} is VALID [2022-04-15 11:20:40,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {401623#true} assume !(0 != ~p8~0); {401623#true} is VALID [2022-04-15 11:20:40,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {401623#true} assume !(0 != ~p9~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-15 11:20:40,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p10~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-15 11:20:40,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {401628#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {401628#(= main_~p9~0 0)} is VALID [2022-04-15 11:20:40,164 INFO L290 TraceCheckUtils]: 19: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p1~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-15 11:20:40,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p2~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-15 11:20:40,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p3~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-15 11:20:40,165 INFO L290 TraceCheckUtils]: 22: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p4~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-15 11:20:40,165 INFO L290 TraceCheckUtils]: 23: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p5~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-15 11:20:40,166 INFO L290 TraceCheckUtils]: 24: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p6~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-15 11:20:40,166 INFO L290 TraceCheckUtils]: 25: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p7~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-15 11:20:40,166 INFO L290 TraceCheckUtils]: 26: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p8~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-15 11:20:40,167 INFO L290 TraceCheckUtils]: 27: Hoare triple {401628#(= main_~p9~0 0)} assume 0 != ~p9~0; {401624#false} is VALID [2022-04-15 11:20:40,167 INFO L290 TraceCheckUtils]: 28: Hoare triple {401624#false} assume 1 != ~lk9~0; {401624#false} is VALID [2022-04-15 11:20:40,167 INFO L290 TraceCheckUtils]: 29: Hoare triple {401624#false} assume !false; {401624#false} is VALID [2022-04-15 11:20:40,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:20:40,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:20:40,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180767279] [2022-04-15 11:20:40,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180767279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:20:40,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:20:40,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:20:40,168 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:20:40,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1765053733] [2022-04-15 11:20:40,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1765053733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:20:40,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:20:40,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:20:40,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209168395] [2022-04-15 11:20:40,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:20:40,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 11:20:40,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:20:40,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:40,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:20:40,192 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:20:40,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:20:40,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:20:40,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:20:40,193 INFO L87 Difference]: Start difference. First operand 12297 states and 16007 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:21:32,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:21:32,586 INFO L93 Difference]: Finished difference Result 27917 states and 36233 transitions. [2022-04-15 11:21:32,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:21:32,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 11:21:32,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:21:32,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:21:32,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-04-15 11:21:32,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:21:32,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-04-15 11:21:32,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 186 transitions. [2022-04-15 11:21:32,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:21:50,166 INFO L225 Difference]: With dead ends: 27917 [2022-04-15 11:21:50,167 INFO L226 Difference]: Without dead ends: 15883 [2022-04-15 11:21:50,183 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:21:50,183 INFO L913 BasicCegarLoop]: 112 mSDtfsCounter, 115 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:21:50,183 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 119 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:21:50,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15883 states. [2022-04-15 11:21:51,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15883 to 15881. [2022-04-15 11:21:51,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:21:51,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15883 states. Second operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:21:51,468 INFO L74 IsIncluded]: Start isIncluded. First operand 15883 states. Second operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:21:51,490 INFO L87 Difference]: Start difference. First operand 15883 states. Second operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:21:57,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:21:57,814 INFO L93 Difference]: Finished difference Result 15883 states and 20232 transitions. [2022-04-15 11:21:57,814 INFO L276 IsEmpty]: Start isEmpty. Operand 15883 states and 20232 transitions. [2022-04-15 11:21:57,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:21:57,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:21:57,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15883 states. [2022-04-15 11:21:57,878 INFO L87 Difference]: Start difference. First operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15883 states. [2022-04-15 11:22:04,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:22:04,156 INFO L93 Difference]: Finished difference Result 15883 states and 20232 transitions. [2022-04-15 11:22:04,156 INFO L276 IsEmpty]: Start isEmpty. Operand 15883 states and 20232 transitions. [2022-04-15 11:22:04,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:22:04,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:22:04,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:22:04,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:22:04,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:22:15,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15881 states to 15881 states and 20231 transitions. [2022-04-15 11:22:15,477 INFO L78 Accepts]: Start accepts. Automaton has 15881 states and 20231 transitions. Word has length 30 [2022-04-15 11:22:15,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:22:15,477 INFO L478 AbstractCegarLoop]: Abstraction has 15881 states and 20231 transitions. [2022-04-15 11:22:15,477 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:22:15,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15881 states and 20231 transitions. [2022-04-15 11:22:38,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20231 edges. 20231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:22:38,244 INFO L276 IsEmpty]: Start isEmpty. Operand 15881 states and 20231 transitions. [2022-04-15 11:22:38,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 11:22:38,253 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:22:38,253 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:22:38,253 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 11:22:38,254 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:22:38,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:22:38,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1358574426, now seen corresponding path program 1 times [2022-04-15 11:22:38,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:22:38,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1857680106] [2022-04-15 11:22:38,254 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:22:38,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1358574426, now seen corresponding path program 2 times [2022-04-15 11:22:38,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:22:38,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316352178] [2022-04-15 11:22:38,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:22:38,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:22:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:22:38,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:22:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:22:38,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {521003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {520997#true} is VALID [2022-04-15 11:22:38,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {520997#true} assume true; {520997#true} is VALID [2022-04-15 11:22:38,307 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {520997#true} {520997#true} #217#return; {520997#true} is VALID [2022-04-15 11:22:38,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {520997#true} call ULTIMATE.init(); {521003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:22:38,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {521003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {520997#true} is VALID [2022-04-15 11:22:38,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {520997#true} assume true; {520997#true} is VALID [2022-04-15 11:22:38,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {520997#true} {520997#true} #217#return; {520997#true} is VALID [2022-04-15 11:22:38,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {520997#true} call #t~ret16 := main(); {520997#true} is VALID [2022-04-15 11:22:38,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {520997#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;havoc ~cond~0; {520997#true} is VALID [2022-04-15 11:22:38,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {520997#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {520997#true} is VALID [2022-04-15 11:22:38,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {520997#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; {520997#true} is VALID [2022-04-15 11:22:38,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {520997#true} assume !(0 != ~p1~0); {520997#true} is VALID [2022-04-15 11:22:38,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {520997#true} assume !(0 != ~p2~0); {520997#true} is VALID [2022-04-15 11:22:38,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {520997#true} assume !(0 != ~p3~0); {520997#true} is VALID [2022-04-15 11:22:38,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {520997#true} assume !(0 != ~p4~0); {520997#true} is VALID [2022-04-15 11:22:38,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {520997#true} assume !(0 != ~p5~0); {520997#true} is VALID [2022-04-15 11:22:38,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {520997#true} assume !(0 != ~p6~0); {520997#true} is VALID [2022-04-15 11:22:38,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {520997#true} assume !(0 != ~p7~0); {520997#true} is VALID [2022-04-15 11:22:38,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {520997#true} assume !(0 != ~p8~0); {520997#true} is VALID [2022-04-15 11:22:38,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {520997#true} assume 0 != ~p9~0;~lk9~0 := 1; {521002#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:22:38,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:22:38,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {521002#(not (= main_~p9~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {521002#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:22:38,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:22:38,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:22:38,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:22:38,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:22:38,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:22:38,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:22:38,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:22:38,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:22:38,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {520998#false} is VALID [2022-04-15 11:22:38,312 INFO L290 TraceCheckUtils]: 28: Hoare triple {520998#false} assume 0 != ~p10~0; {520998#false} is VALID [2022-04-15 11:22:38,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {520998#false} assume 1 != ~lk10~0; {520998#false} is VALID [2022-04-15 11:22:38,313 INFO L290 TraceCheckUtils]: 30: Hoare triple {520998#false} assume !false; {520998#false} is VALID [2022-04-15 11:22:38,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:22:38,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:22:38,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316352178] [2022-04-15 11:22:38,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316352178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:22:38,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:22:38,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:22:38,313 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:22:38,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1857680106] [2022-04-15 11:22:38,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1857680106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:22:38,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:22:38,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:22:38,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924382799] [2022-04-15 11:22:38,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:22:38,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 11:22:38,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:22:38,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:22:38,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:22:38,333 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:22:38,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:22:38,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:22:38,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:22:38,334 INFO L87 Difference]: Start difference. First operand 15881 states and 20231 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:23:07,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:23:07,753 INFO L93 Difference]: Finished difference Result 23821 states and 30217 transitions. [2022-04-15 11:23:07,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:23:07,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 11:23:07,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:23:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:23:07,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-15 11:23:07,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:23:07,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-15 11:23:07,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 181 transitions. [2022-04-15 11:23:07,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:23:26,127 INFO L225 Difference]: With dead ends: 23821 [2022-04-15 11:23:26,128 INFO L226 Difference]: Without dead ends: 16139 [2022-04-15 11:23:26,137 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:23:26,138 INFO L913 BasicCegarLoop]: 92 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:23:26,138 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 99 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:23:26,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16139 states. [2022-04-15 11:23:27,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16139 to 16137. [2022-04-15 11:23:27,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:23:27,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16139 states. Second operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:23:27,458 INFO L74 IsIncluded]: Start isIncluded. First operand 16139 states. Second operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:23:27,475 INFO L87 Difference]: Start difference. First operand 16139 states. Second operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:23:34,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:23:34,438 INFO L93 Difference]: Finished difference Result 16139 states and 20232 transitions. [2022-04-15 11:23:34,438 INFO L276 IsEmpty]: Start isEmpty. Operand 16139 states and 20232 transitions. [2022-04-15 11:23:34,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:23:34,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:23:34,468 INFO L74 IsIncluded]: Start isIncluded. First operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16139 states. [2022-04-15 11:23:34,485 INFO L87 Difference]: Start difference. First operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16139 states. [2022-04-15 11:23:41,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:23:41,454 INFO L93 Difference]: Finished difference Result 16139 states and 20232 transitions. [2022-04-15 11:23:41,454 INFO L276 IsEmpty]: Start isEmpty. Operand 16139 states and 20232 transitions. [2022-04-15 11:23:41,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:23:41,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:23:41,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:23:41,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:23:41,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:23:53,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16137 states to 16137 states and 20231 transitions. [2022-04-15 11:23:53,554 INFO L78 Accepts]: Start accepts. Automaton has 16137 states and 20231 transitions. Word has length 31 [2022-04-15 11:23:53,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:23:53,554 INFO L478 AbstractCegarLoop]: Abstraction has 16137 states and 20231 transitions. [2022-04-15 11:23:53,554 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:23:53,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16137 states and 20231 transitions. [2022-04-15 11:24:16,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20231 edges. 20231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:24:16,089 INFO L276 IsEmpty]: Start isEmpty. Operand 16137 states and 20231 transitions. [2022-04-15 11:24:16,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 11:24:16,098 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:24:16,098 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:24:16,098 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 11:24:16,098 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:24:16,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:24:16,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1656529192, now seen corresponding path program 1 times [2022-04-15 11:24:16,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:24:16,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [197684973] [2022-04-15 11:24:16,099 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:24:16,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1656529192, now seen corresponding path program 2 times [2022-04-15 11:24:16,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:24:16,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470227499] [2022-04-15 11:24:16,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:24:16,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:24:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:24:16,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:24:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:24:16,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {633209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {633203#true} is VALID [2022-04-15 11:24:16,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {633203#true} assume true; {633203#true} is VALID [2022-04-15 11:24:16,137 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {633203#true} {633203#true} #217#return; {633203#true} is VALID [2022-04-15 11:24:16,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {633203#true} call ULTIMATE.init(); {633209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:24:16,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {633209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {633203#true} is VALID [2022-04-15 11:24:16,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {633203#true} assume true; {633203#true} is VALID [2022-04-15 11:24:16,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {633203#true} {633203#true} #217#return; {633203#true} is VALID [2022-04-15 11:24:16,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {633203#true} call #t~ret16 := main(); {633203#true} is VALID [2022-04-15 11:24:16,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {633203#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;havoc ~cond~0; {633203#true} is VALID [2022-04-15 11:24:16,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {633203#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {633203#true} is VALID [2022-04-15 11:24:16,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {633203#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; {633203#true} is VALID [2022-04-15 11:24:16,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {633203#true} assume !(0 != ~p1~0); {633203#true} is VALID [2022-04-15 11:24:16,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {633203#true} assume !(0 != ~p2~0); {633203#true} is VALID [2022-04-15 11:24:16,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {633203#true} assume !(0 != ~p3~0); {633203#true} is VALID [2022-04-15 11:24:16,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {633203#true} assume !(0 != ~p4~0); {633203#true} is VALID [2022-04-15 11:24:16,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {633203#true} assume !(0 != ~p5~0); {633203#true} is VALID [2022-04-15 11:24:16,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {633203#true} assume !(0 != ~p6~0); {633203#true} is VALID [2022-04-15 11:24:16,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {633203#true} assume !(0 != ~p7~0); {633203#true} is VALID [2022-04-15 11:24:16,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {633203#true} assume !(0 != ~p8~0); {633203#true} is VALID [2022-04-15 11:24:16,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {633203#true} assume !(0 != ~p9~0); {633203#true} is VALID [2022-04-15 11:24:16,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {633203#true} assume !(0 != ~p10~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-15 11:24:16,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {633208#(= main_~p10~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {633208#(= main_~p10~0 0)} is VALID [2022-04-15 11:24:16,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p1~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-15 11:24:16,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p2~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-15 11:24:16,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p3~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-15 11:24:16,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p4~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-15 11:24:16,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p5~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-15 11:24:16,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p6~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-15 11:24:16,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p7~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-15 11:24:16,143 INFO L290 TraceCheckUtils]: 26: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p8~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-15 11:24:16,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p9~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-15 11:24:16,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {633208#(= main_~p10~0 0)} assume 0 != ~p10~0; {633204#false} is VALID [2022-04-15 11:24:16,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {633204#false} assume 1 != ~lk10~0; {633204#false} is VALID [2022-04-15 11:24:16,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {633204#false} assume !false; {633204#false} is VALID [2022-04-15 11:24:16,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:24:16,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:24:16,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470227499] [2022-04-15 11:24:16,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470227499] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:24:16,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:24:16,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:24:16,144 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:24:16,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [197684973] [2022-04-15 11:24:16,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [197684973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:24:16,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:24:16,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:24:16,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749619765] [2022-04-15 11:24:16,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:24:16,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 11:24:16,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:24:16,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:24:16,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:24:16,164 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:24:16,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:24:16,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:24:16,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:24:16,165 INFO L87 Difference]: Start difference. First operand 16137 states and 20231 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:30:08,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:30:08,041 INFO L93 Difference]: Finished difference Result 46861 states and 57609 transitions. [2022-04-15 11:30:08,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:30:08,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 11:30:08,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:30:08,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:30:08,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-15 11:30:08,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:30:08,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-15 11:30:08,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 184 transitions. [2022-04-15 11:30:08,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.