/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_5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:19:08,896 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:19:08,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:19:08,916 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:19:08,916 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:19:08,917 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:19:08,918 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:19:08,919 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:19:08,920 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:19:08,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:19:08,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:19:08,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:19:08,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:19:08,935 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:19:08,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:19:08,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:19:08,937 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:19:08,937 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:19:08,938 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:19:08,939 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:19:08,940 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:19:08,944 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:19:08,945 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:19:08,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:19:08,946 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:19:08,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:19:08,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:19:08,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:19:08,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:19:08,948 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:19:08,948 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:19:08,949 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:19:08,949 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:19:08,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:19:08,950 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:19:08,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:19:08,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:19:08,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:19:08,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:19:08,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:19:08,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:19:08,958 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:19:08,958 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 08:19:08,963 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:19:08,964 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:19:08,964 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:19:08,964 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:19:08,965 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:19:08,965 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:19:08,965 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:19:08,965 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:19:08,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:19:08,965 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:19:08,965 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:19:08,965 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:19:08,965 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:19:08,966 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:19:08,966 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:19:08,966 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:19:08,966 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:19:08,966 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:19:08,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:19:08,966 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:19:08,966 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:19:08,967 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:19:08,967 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:19:08,967 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:19:08,969 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:19:08,969 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-08 08:19:09,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:19:09,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:19:09,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:19:09,151 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:19:09,152 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:19:09,152 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2022-04-08 08:19:09,205 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ead9f02c2/2de226b2b99d42b0bc6c5fda9a81d5ee/FLAG945109c70 [2022-04-08 08:19:09,546 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:19:09,547 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2022-04-08 08:19:09,551 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ead9f02c2/2de226b2b99d42b0bc6c5fda9a81d5ee/FLAG945109c70 [2022-04-08 08:19:09,558 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ead9f02c2/2de226b2b99d42b0bc6c5fda9a81d5ee [2022-04-08 08:19:09,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:19:09,561 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:19:09,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:19:09,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:19:09,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:19:09,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:19:09" (1/1) ... [2022-04-08 08:19:09,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5795a9ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:09, skipping insertion in model container [2022-04-08 08:19:09,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:19:09" (1/1) ... [2022-04-08 08:19:09,571 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:19:09,581 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:19:09,702 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_5.c[2207,2220] [2022-04-08 08:19:09,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:19:09,709 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:19:09,738 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_5.c[2207,2220] [2022-04-08 08:19:09,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:19:09,766 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:19:09,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:09 WrapperNode [2022-04-08 08:19:09,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:19:09,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:19:09,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:19:09,767 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:19:09,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:09" (1/1) ... [2022-04-08 08:19:09,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:09" (1/1) ... [2022-04-08 08:19:09,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:09" (1/1) ... [2022-04-08 08:19:09,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:09" (1/1) ... [2022-04-08 08:19:09,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:09" (1/1) ... [2022-04-08 08:19:09,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:09" (1/1) ... [2022-04-08 08:19:09,795 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:09" (1/1) ... [2022-04-08 08:19:09,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:19:09,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:19:09,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:19:09,797 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:19:09,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:09" (1/1) ... [2022-04-08 08:19:09,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:19:09,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:19:09,825 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-08 08:19:09,835 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-08 08:19:09,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:19:09,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:19:09,852 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:19:09,852 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:19:09,852 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:19:09,852 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:19:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:19:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:19:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:19:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:19:09,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:19:09,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:19:09,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:19:09,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:19:09,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:19:09,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:19:09,897 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:19:09,898 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:19:10,009 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:19:10,013 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:19:10,014 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 08:19:10,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:19:10 BoogieIcfgContainer [2022-04-08 08:19:10,015 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:19:10,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:19:10,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:19:10,030 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:19:10,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:19:09" (1/3) ... [2022-04-08 08:19:10,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e10d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:19:10, skipping insertion in model container [2022-04-08 08:19:10,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:09" (2/3) ... [2022-04-08 08:19:10,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e10d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:19:10, skipping insertion in model container [2022-04-08 08:19:10,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:19:10" (3/3) ... [2022-04-08 08:19:10,032 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2022-04-08 08:19:10,035 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:19:10,035 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:19:10,060 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:19:10,064 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-08 08:19:10,064 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:19:10,075 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 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-08 08:19:10,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 08:19:10,080 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:10,080 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:10,081 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:10,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:10,084 INFO L85 PathProgramCache]: Analyzing trace with hash -663266717, now seen corresponding path program 1 times [2022-04-08 08:19:10,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:10,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1124496997] [2022-04-08 08:19:10,096 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:10,096 INFO L85 PathProgramCache]: Analyzing trace with hash -663266717, now seen corresponding path program 2 times [2022-04-08 08:19:10,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:10,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265695072] [2022-04-08 08:19:10,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:10,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:10,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:10,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {33#true} is VALID [2022-04-08 08:19:10,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-08 08:19:10,344 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #115#return; {33#true} is VALID [2022-04-08 08:19:10,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:10,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {33#true} is VALID [2022-04-08 08:19:10,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-08 08:19:10,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #115#return; {33#true} is VALID [2022-04-08 08:19:10,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret10 := main(); {33#true} is VALID [2022-04-08 08:19:10,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#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;havoc ~cond~0; {33#true} is VALID [2022-04-08 08:19:10,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {33#true} is VALID [2022-04-08 08:19:10,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {33#true} is VALID [2022-04-08 08:19:10,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 != ~p1~0;~lk1~0 := 1; {38#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:10,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {38#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:10,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {38#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {38#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:10,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {38#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:10,351 INFO L290 TraceCheckUtils]: 12: Hoare triple {38#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {38#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:10,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {38#(= main_~lk1~0 1)} assume 0 != ~p1~0; {38#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:10,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {38#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {34#false} is VALID [2022-04-08 08:19:10,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-08 08:19:10,357 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-08 08:19:10,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:10,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265695072] [2022-04-08 08:19:10,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265695072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:10,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:10,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:10,361 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:10,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1124496997] [2022-04-08 08:19:10,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1124496997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:10,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:10,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:10,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460618832] [2022-04-08 08:19:10,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:10,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 08:19:10,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:10,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:10,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:10,391 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:10,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:10,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:10,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:10,415 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 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 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:10,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:10,631 INFO L93 Difference]: Finished difference Result 58 states and 91 transitions. [2022-04-08 08:19:10,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:10,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 08:19:10,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:10,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:10,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-08 08:19:10,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:10,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-08 08:19:10,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-04-08 08:19:10,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:10,719 INFO L225 Difference]: With dead ends: 58 [2022-04-08 08:19:10,719 INFO L226 Difference]: Without dead ends: 43 [2022-04-08 08:19:10,720 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-08 08:19:10,722 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 89 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:10,723 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 59 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:10,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-08 08:19:10,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2022-04-08 08:19:10,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:10,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:10,745 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:10,745 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:10,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:10,748 INFO L93 Difference]: Finished difference Result 43 states and 69 transitions. [2022-04-08 08:19:10,748 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 69 transitions. [2022-04-08 08:19:10,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:10,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:10,749 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-08 08:19:10,749 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-08 08:19:10,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:10,752 INFO L93 Difference]: Finished difference Result 43 states and 69 transitions. [2022-04-08 08:19:10,752 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 69 transitions. [2022-04-08 08:19:10,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:10,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:10,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:10,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:10,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:10,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 50 transitions. [2022-04-08 08:19:10,756 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 50 transitions. Word has length 16 [2022-04-08 08:19:10,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:10,756 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 50 transitions. [2022-04-08 08:19:10,756 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:10,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 50 transitions. [2022-04-08 08:19:10,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:10,811 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2022-04-08 08:19:10,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 08:19:10,811 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:10,812 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:10,812 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:19:10,812 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:10,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:10,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1472613343, now seen corresponding path program 1 times [2022-04-08 08:19:10,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:10,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [415813239] [2022-04-08 08:19:10,813 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:10,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1472613343, now seen corresponding path program 2 times [2022-04-08 08:19:10,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:10,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524083350] [2022-04-08 08:19:10,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:10,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:10,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:10,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {309#true} is VALID [2022-04-08 08:19:10,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#true} assume true; {309#true} is VALID [2022-04-08 08:19:10,866 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {309#true} {309#true} #115#return; {309#true} is VALID [2022-04-08 08:19:10,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {309#true} call ULTIMATE.init(); {315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:10,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {309#true} is VALID [2022-04-08 08:19:10,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {309#true} assume true; {309#true} is VALID [2022-04-08 08:19:10,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {309#true} {309#true} #115#return; {309#true} is VALID [2022-04-08 08:19:10,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {309#true} call #t~ret10 := main(); {309#true} is VALID [2022-04-08 08:19:10,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {309#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;havoc ~cond~0; {309#true} is VALID [2022-04-08 08:19:10,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {309#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {309#true} is VALID [2022-04-08 08:19:10,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {309#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {309#true} is VALID [2022-04-08 08:19:10,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {309#true} assume !(0 != ~p1~0); {314#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:10,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {314#(= main_~p1~0 0)} assume !(0 != ~p2~0); {314#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:10,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {314#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {314#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:10,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {314#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {314#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:10,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {314#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {314#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:10,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {314#(= main_~p1~0 0)} assume 0 != ~p1~0; {310#false} is VALID [2022-04-08 08:19:10,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {310#false} assume 1 != ~lk1~0; {310#false} is VALID [2022-04-08 08:19:10,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {310#false} assume !false; {310#false} is VALID [2022-04-08 08:19:10,872 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-08 08:19:10,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:10,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524083350] [2022-04-08 08:19:10,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524083350] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:10,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:10,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:10,875 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:10,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [415813239] [2022-04-08 08:19:10,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [415813239] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:10,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:10,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:10,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145316397] [2022-04-08 08:19:10,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:10,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 08:19:10,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:10,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:10,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:10,893 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:10,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:10,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:10,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:10,894 INFO L87 Difference]: Start difference. First operand 31 states and 50 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:11,031 INFO L93 Difference]: Finished difference Result 68 states and 113 transitions. [2022-04-08 08:19:11,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:11,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 08:19:11,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:11,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2022-04-08 08:19:11,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2022-04-08 08:19:11,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 102 transitions. [2022-04-08 08:19:11,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:11,129 INFO L225 Difference]: With dead ends: 68 [2022-04-08 08:19:11,129 INFO L226 Difference]: Without dead ends: 43 [2022-04-08 08:19:11,130 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-08 08:19:11,131 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:11,131 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 55 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:11,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-08 08:19:11,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2022-04-08 08:19:11,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:11,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,138 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,138 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:11,140 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2022-04-08 08:19:11,140 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2022-04-08 08:19:11,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:11,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:11,141 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-08 08:19:11,141 INFO L87 Difference]: Start difference. First operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-08 08:19:11,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:11,143 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2022-04-08 08:19:11,143 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2022-04-08 08:19:11,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:11,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:11,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:11,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:11,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 66 transitions. [2022-04-08 08:19:11,145 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 66 transitions. Word has length 16 [2022-04-08 08:19:11,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:11,145 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 66 transitions. [2022-04-08 08:19:11,145 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 66 transitions. [2022-04-08 08:19:11,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:11,201 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 66 transitions. [2022-04-08 08:19:11,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 08:19:11,202 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:11,202 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:11,202 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:19:11,202 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:11,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:11,203 INFO L85 PathProgramCache]: Analyzing trace with hash 913783256, now seen corresponding path program 1 times [2022-04-08 08:19:11,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:11,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [743173591] [2022-04-08 08:19:11,203 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:11,204 INFO L85 PathProgramCache]: Analyzing trace with hash 913783256, now seen corresponding path program 2 times [2022-04-08 08:19:11,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:11,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149599160] [2022-04-08 08:19:11,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:11,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:11,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:11,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {625#true} is VALID [2022-04-08 08:19:11,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {625#true} assume true; {625#true} is VALID [2022-04-08 08:19:11,250 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {625#true} {625#true} #115#return; {625#true} is VALID [2022-04-08 08:19:11,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {625#true} call ULTIMATE.init(); {631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:11,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {625#true} is VALID [2022-04-08 08:19:11,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {625#true} assume true; {625#true} is VALID [2022-04-08 08:19:11,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {625#true} {625#true} #115#return; {625#true} is VALID [2022-04-08 08:19:11,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {625#true} call #t~ret10 := main(); {625#true} is VALID [2022-04-08 08:19:11,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {625#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;havoc ~cond~0; {625#true} is VALID [2022-04-08 08:19:11,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {625#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {625#true} is VALID [2022-04-08 08:19:11,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {625#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {625#true} is VALID [2022-04-08 08:19:11,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {625#true} assume 0 != ~p1~0;~lk1~0 := 1; {630#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:11,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {630#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {630#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:11,253 INFO L290 TraceCheckUtils]: 10: Hoare triple {630#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {630#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:11,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {630#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {630#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:11,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {630#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {630#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:11,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {630#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {626#false} is VALID [2022-04-08 08:19:11,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {626#false} assume 0 != ~p2~0; {626#false} is VALID [2022-04-08 08:19:11,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {626#false} assume 1 != ~lk2~0; {626#false} is VALID [2022-04-08 08:19:11,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {626#false} assume !false; {626#false} is VALID [2022-04-08 08:19:11,254 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-08 08:19:11,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:11,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149599160] [2022-04-08 08:19:11,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149599160] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:11,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:11,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:11,255 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:11,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [743173591] [2022-04-08 08:19:11,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [743173591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:11,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:11,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:11,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137735204] [2022-04-08 08:19:11,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:11,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 08:19:11,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:11,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:11,266 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:11,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:11,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:11,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:11,267 INFO L87 Difference]: Start difference. First operand 41 states and 66 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:11,365 INFO L93 Difference]: Finished difference Result 64 states and 100 transitions. [2022-04-08 08:19:11,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:11,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 08:19:11,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:11,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-04-08 08:19:11,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-04-08 08:19:11,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 97 transitions. [2022-04-08 08:19:11,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:11,441 INFO L225 Difference]: With dead ends: 64 [2022-04-08 08:19:11,441 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 08:19:11,442 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-08 08:19:11,444 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 66 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:11,444 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 63 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:11,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 08:19:11,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-04-08 08:19:11,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:11,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,449 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,449 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:11,451 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2022-04-08 08:19:11,451 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2022-04-08 08:19:11,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:11,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:11,451 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-08 08:19:11,452 INFO L87 Difference]: Start difference. First operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-08 08:19:11,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:11,453 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2022-04-08 08:19:11,453 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2022-04-08 08:19:11,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:11,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:11,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:11,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:11,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 68 transitions. [2022-04-08 08:19:11,455 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 68 transitions. Word has length 17 [2022-04-08 08:19:11,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:11,455 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 68 transitions. [2022-04-08 08:19:11,455 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 68 transitions. [2022-04-08 08:19:11,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:11,511 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 68 transitions. [2022-04-08 08:19:11,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 08:19:11,511 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:11,512 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:11,512 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:19:11,512 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:11,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:11,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1593841626, now seen corresponding path program 1 times [2022-04-08 08:19:11,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:11,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [471943718] [2022-04-08 08:19:11,513 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:11,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1593841626, now seen corresponding path program 2 times [2022-04-08 08:19:11,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:11,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486949091] [2022-04-08 08:19:11,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:11,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:11,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:11,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {951#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {945#true} is VALID [2022-04-08 08:19:11,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {945#true} assume true; {945#true} is VALID [2022-04-08 08:19:11,569 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {945#true} {945#true} #115#return; {945#true} is VALID [2022-04-08 08:19:11,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {945#true} call ULTIMATE.init(); {951#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:11,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {951#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {945#true} is VALID [2022-04-08 08:19:11,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {945#true} assume true; {945#true} is VALID [2022-04-08 08:19:11,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {945#true} {945#true} #115#return; {945#true} is VALID [2022-04-08 08:19:11,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {945#true} call #t~ret10 := main(); {945#true} is VALID [2022-04-08 08:19:11,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {945#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;havoc ~cond~0; {945#true} is VALID [2022-04-08 08:19:11,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {945#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {945#true} is VALID [2022-04-08 08:19:11,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {945#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {945#true} is VALID [2022-04-08 08:19:11,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {945#true} assume !(0 != ~p1~0); {945#true} is VALID [2022-04-08 08:19:11,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {945#true} assume !(0 != ~p2~0); {950#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:11,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {950#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {950#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:11,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {950#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {950#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:11,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {950#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {950#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:11,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {950#(= main_~p2~0 0)} assume !(0 != ~p1~0); {950#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:11,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {950#(= main_~p2~0 0)} assume 0 != ~p2~0; {946#false} is VALID [2022-04-08 08:19:11,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {946#false} assume 1 != ~lk2~0; {946#false} is VALID [2022-04-08 08:19:11,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {946#false} assume !false; {946#false} is VALID [2022-04-08 08:19:11,572 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-08 08:19:11,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:11,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486949091] [2022-04-08 08:19:11,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486949091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:11,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:11,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:11,573 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:11,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [471943718] [2022-04-08 08:19:11,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [471943718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:11,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:11,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:11,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861794498] [2022-04-08 08:19:11,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:11,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 08:19:11,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:11,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:11,584 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:11,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:11,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:11,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:11,584 INFO L87 Difference]: Start difference. First operand 44 states and 68 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:11,674 INFO L93 Difference]: Finished difference Result 112 states and 180 transitions. [2022-04-08 08:19:11,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:11,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 08:19:11,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:11,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-08 08:19:11,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-08 08:19:11,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 100 transitions. [2022-04-08 08:19:11,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:11,735 INFO L225 Difference]: With dead ends: 112 [2022-04-08 08:19:11,736 INFO L226 Difference]: Without dead ends: 77 [2022-04-08 08:19:11,736 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-08 08:19:11,740 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 78 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:11,741 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 49 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:11,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-08 08:19:11,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-04-08 08:19:11,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:11,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,753 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,753 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:11,755 INFO L93 Difference]: Finished difference Result 77 states and 118 transitions. [2022-04-08 08:19:11,755 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 118 transitions. [2022-04-08 08:19:11,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:11,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:11,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-08 08:19:11,756 INFO L87 Difference]: Start difference. First operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-08 08:19:11,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:11,758 INFO L93 Difference]: Finished difference Result 77 states and 118 transitions. [2022-04-08 08:19:11,758 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 118 transitions. [2022-04-08 08:19:11,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:11,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:11,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:11,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:11,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 117 transitions. [2022-04-08 08:19:11,760 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 117 transitions. Word has length 17 [2022-04-08 08:19:11,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:11,760 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 117 transitions. [2022-04-08 08:19:11,760 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 117 transitions. [2022-04-08 08:19:11,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:11,839 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 117 transitions. [2022-04-08 08:19:11,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 08:19:11,839 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:11,839 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:11,839 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 08:19:11,839 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:11,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:11,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1891779044, now seen corresponding path program 1 times [2022-04-08 08:19:11,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:11,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1053466697] [2022-04-08 08:19:11,840 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:11,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1891779044, now seen corresponding path program 2 times [2022-04-08 08:19:11,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:11,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757741309] [2022-04-08 08:19:11,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:11,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:11,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:11,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {1491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1485#true} is VALID [2022-04-08 08:19:11,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {1485#true} assume true; {1485#true} is VALID [2022-04-08 08:19:11,888 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1485#true} {1485#true} #115#return; {1485#true} is VALID [2022-04-08 08:19:11,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {1485#true} call ULTIMATE.init(); {1491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:11,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {1491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1485#true} is VALID [2022-04-08 08:19:11,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {1485#true} assume true; {1485#true} is VALID [2022-04-08 08:19:11,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1485#true} {1485#true} #115#return; {1485#true} is VALID [2022-04-08 08:19:11,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {1485#true} call #t~ret10 := main(); {1485#true} is VALID [2022-04-08 08:19:11,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {1485#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;havoc ~cond~0; {1485#true} is VALID [2022-04-08 08:19:11,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {1485#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {1485#true} is VALID [2022-04-08 08:19:11,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {1485#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {1485#true} is VALID [2022-04-08 08:19:11,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {1485#true} assume !(0 != ~p1~0); {1485#true} is VALID [2022-04-08 08:19:11,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {1485#true} assume 0 != ~p2~0;~lk2~0 := 1; {1490#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:11,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {1490#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {1490#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:11,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {1490#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1490#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:11,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {1490#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1490#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:11,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {1490#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {1490#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:11,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {1490#(= main_~lk2~0 1)} assume 0 != ~p2~0; {1490#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:11,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {1490#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {1486#false} is VALID [2022-04-08 08:19:11,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {1486#false} assume !false; {1486#false} is VALID [2022-04-08 08:19:11,892 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-08 08:19:11,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:11,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757741309] [2022-04-08 08:19:11,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757741309] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:11,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:11,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:11,893 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:11,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1053466697] [2022-04-08 08:19:11,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1053466697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:11,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:11,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:11,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558556908] [2022-04-08 08:19:11,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:11,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 08:19:11,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:11,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:11,906 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:11,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:11,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:11,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:11,906 INFO L87 Difference]: Start difference. First operand 75 states and 117 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:11,984 INFO L93 Difference]: Finished difference Result 95 states and 147 transitions. [2022-04-08 08:19:11,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:11,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 08:19:11,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:11,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-08 08:19:11,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:11,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-08 08:19:11,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2022-04-08 08:19:12,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:12,035 INFO L225 Difference]: With dead ends: 95 [2022-04-08 08:19:12,035 INFO L226 Difference]: Without dead ends: 93 [2022-04-08 08:19:12,035 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-08 08:19:12,036 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 51 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:12,036 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 68 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:12,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-08 08:19:12,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2022-04-08 08:19:12,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:12,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:12,043 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:12,043 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:12,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:12,046 INFO L93 Difference]: Finished difference Result 93 states and 144 transitions. [2022-04-08 08:19:12,046 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 144 transitions. [2022-04-08 08:19:12,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:12,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:12,046 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 93 states. [2022-04-08 08:19:12,047 INFO L87 Difference]: Start difference. First operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 93 states. [2022-04-08 08:19:12,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:12,065 INFO L93 Difference]: Finished difference Result 93 states and 144 transitions. [2022-04-08 08:19:12,065 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 144 transitions. [2022-04-08 08:19:12,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:12,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:12,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:12,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:12,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:12,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 115 transitions. [2022-04-08 08:19:12,067 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 115 transitions. Word has length 17 [2022-04-08 08:19:12,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:12,067 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 115 transitions. [2022-04-08 08:19:12,067 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:12,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 115 transitions. [2022-04-08 08:19:12,163 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-08 08:19:12,164 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 115 transitions. [2022-04-08 08:19:12,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 08:19:12,164 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:12,164 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:12,164 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 08:19:12,164 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:12,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:12,165 INFO L85 PathProgramCache]: Analyzing trace with hash -2130301802, now seen corresponding path program 1 times [2022-04-08 08:19:12,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:12,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [459614434] [2022-04-08 08:19:12,165 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:12,165 INFO L85 PathProgramCache]: Analyzing trace with hash -2130301802, now seen corresponding path program 2 times [2022-04-08 08:19:12,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:12,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872758556] [2022-04-08 08:19:12,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:12,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:12,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:12,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {2029#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2023#true} is VALID [2022-04-08 08:19:12,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {2023#true} assume true; {2023#true} is VALID [2022-04-08 08:19:12,198 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2023#true} {2023#true} #115#return; {2023#true} is VALID [2022-04-08 08:19:12,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {2023#true} call ULTIMATE.init(); {2029#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:12,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {2029#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2023#true} is VALID [2022-04-08 08:19:12,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {2023#true} assume true; {2023#true} is VALID [2022-04-08 08:19:12,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2023#true} {2023#true} #115#return; {2023#true} is VALID [2022-04-08 08:19:12,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {2023#true} call #t~ret10 := main(); {2023#true} is VALID [2022-04-08 08:19:12,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {2023#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;havoc ~cond~0; {2023#true} is VALID [2022-04-08 08:19:12,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {2023#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {2023#true} is VALID [2022-04-08 08:19:12,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {2023#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {2023#true} is VALID [2022-04-08 08:19:12,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {2023#true} assume !(0 != ~p1~0); {2023#true} is VALID [2022-04-08 08:19:12,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {2023#true} assume !(0 != ~p2~0); {2023#true} is VALID [2022-04-08 08:19:12,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {2023#true} assume 0 != ~p3~0;~lk3~0 := 1; {2028#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:12,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {2028#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2028#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:12,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {2028#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2028#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:12,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {2028#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {2028#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:12,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {2028#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {2028#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:12,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {2028#(= main_~lk3~0 1)} assume 0 != ~p3~0; {2028#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:12,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {2028#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {2024#false} is VALID [2022-04-08 08:19:12,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {2024#false} assume !false; {2024#false} is VALID [2022-04-08 08:19:12,202 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-08 08:19:12,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:12,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872758556] [2022-04-08 08:19:12,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872758556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:12,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:12,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:12,203 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:12,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [459614434] [2022-04-08 08:19:12,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [459614434] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:12,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:12,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:12,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829109958] [2022-04-08 08:19:12,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:12,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 08:19:12,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:12,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:12,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:12,214 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:12,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:12,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:12,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:12,215 INFO L87 Difference]: Start difference. First operand 75 states and 115 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:12,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:12,314 INFO L93 Difference]: Finished difference Result 131 states and 203 transitions. [2022-04-08 08:19:12,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:12,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 08:19:12,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:12,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:12,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-04-08 08:19:12,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:12,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-04-08 08:19:12,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2022-04-08 08:19:12,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:12,354 INFO L225 Difference]: With dead ends: 131 [2022-04-08 08:19:12,354 INFO L226 Difference]: Without dead ends: 129 [2022-04-08 08:19:12,355 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-08 08:19:12,355 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 69 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:12,355 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 46 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:12,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-08 08:19:12,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 103. [2022-04-08 08:19:12,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:12,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:12,364 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:12,365 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:12,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:12,367 INFO L93 Difference]: Finished difference Result 129 states and 198 transitions. [2022-04-08 08:19:12,367 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 198 transitions. [2022-04-08 08:19:12,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:12,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:12,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 129 states. [2022-04-08 08:19:12,368 INFO L87 Difference]: Start difference. First operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 129 states. [2022-04-08 08:19:12,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:12,371 INFO L93 Difference]: Finished difference Result 129 states and 198 transitions. [2022-04-08 08:19:12,371 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 198 transitions. [2022-04-08 08:19:12,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:12,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:12,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:12,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:12,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:12,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 157 transitions. [2022-04-08 08:19:12,373 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 157 transitions. Word has length 18 [2022-04-08 08:19:12,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:12,373 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 157 transitions. [2022-04-08 08:19:12,374 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:12,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 157 transitions. [2022-04-08 08:19:12,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:12,498 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 157 transitions. [2022-04-08 08:19:12,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 08:19:12,498 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:12,498 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:12,498 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 08:19:12,499 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:12,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:12,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1355318868, now seen corresponding path program 1 times [2022-04-08 08:19:12,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:12,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1649924891] [2022-04-08 08:19:12,499 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:12,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1355318868, now seen corresponding path program 2 times [2022-04-08 08:19:12,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:12,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910959641] [2022-04-08 08:19:12,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:12,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:12,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:12,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {2767#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2761#true} is VALID [2022-04-08 08:19:12,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {2761#true} assume true; {2761#true} is VALID [2022-04-08 08:19:12,537 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2761#true} {2761#true} #115#return; {2761#true} is VALID [2022-04-08 08:19:12,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {2761#true} call ULTIMATE.init(); {2767#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:12,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {2767#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2761#true} is VALID [2022-04-08 08:19:12,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {2761#true} assume true; {2761#true} is VALID [2022-04-08 08:19:12,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2761#true} {2761#true} #115#return; {2761#true} is VALID [2022-04-08 08:19:12,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {2761#true} call #t~ret10 := main(); {2761#true} is VALID [2022-04-08 08:19:12,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {2761#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;havoc ~cond~0; {2761#true} is VALID [2022-04-08 08:19:12,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {2761#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {2761#true} is VALID [2022-04-08 08:19:12,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {2761#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {2761#true} is VALID [2022-04-08 08:19:12,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {2761#true} assume !(0 != ~p1~0); {2761#true} is VALID [2022-04-08 08:19:12,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {2761#true} assume !(0 != ~p2~0); {2761#true} is VALID [2022-04-08 08:19:12,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {2761#true} assume !(0 != ~p3~0); {2766#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:12,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {2766#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {2766#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:12,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {2766#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {2766#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:12,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {2766#(= main_~p3~0 0)} assume !(0 != ~p1~0); {2766#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:12,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {2766#(= main_~p3~0 0)} assume !(0 != ~p2~0); {2766#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:12,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {2766#(= main_~p3~0 0)} assume 0 != ~p3~0; {2762#false} is VALID [2022-04-08 08:19:12,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {2762#false} assume 1 != ~lk3~0; {2762#false} is VALID [2022-04-08 08:19:12,548 INFO L290 TraceCheckUtils]: 17: Hoare triple {2762#false} assume !false; {2762#false} is VALID [2022-04-08 08:19:12,548 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-08 08:19:12,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:12,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910959641] [2022-04-08 08:19:12,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910959641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:12,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:12,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:12,549 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:12,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1649924891] [2022-04-08 08:19:12,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1649924891] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:12,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:12,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:12,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95119742] [2022-04-08 08:19:12,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:12,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 08:19:12,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:12,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:12,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:12,558 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:12,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:12,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:12,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:12,559 INFO L87 Difference]: Start difference. First operand 103 states and 157 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:12,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:12,644 INFO L93 Difference]: Finished difference Result 231 states and 355 transitions. [2022-04-08 08:19:12,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:12,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 08:19:12,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:12,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:12,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-04-08 08:19:12,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:12,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-04-08 08:19:12,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 96 transitions. [2022-04-08 08:19:12,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:12,698 INFO L225 Difference]: With dead ends: 231 [2022-04-08 08:19:12,698 INFO L226 Difference]: Without dead ends: 137 [2022-04-08 08:19:12,698 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-08 08:19:12,699 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 61 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:12,700 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 59 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:12,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-08 08:19:12,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-04-08 08:19:12,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:12,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:12,716 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:12,716 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:12,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:12,719 INFO L93 Difference]: Finished difference Result 137 states and 200 transitions. [2022-04-08 08:19:12,719 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2022-04-08 08:19:12,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:12,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:12,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 137 states. [2022-04-08 08:19:12,720 INFO L87 Difference]: Start difference. First operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 137 states. [2022-04-08 08:19:12,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:12,723 INFO L93 Difference]: Finished difference Result 137 states and 200 transitions. [2022-04-08 08:19:12,723 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2022-04-08 08:19:12,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:12,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:12,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:12,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:12,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:12,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 199 transitions. [2022-04-08 08:19:12,727 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 199 transitions. Word has length 18 [2022-04-08 08:19:12,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:12,727 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 199 transitions. [2022-04-08 08:19:12,727 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:12,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 199 transitions. [2022-04-08 08:19:12,889 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-08 08:19:12,889 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 199 transitions. [2022-04-08 08:19:12,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 08:19:12,889 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:12,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] [2022-04-08 08:19:12,889 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 08:19:12,889 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:12,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:12,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1614630737, now seen corresponding path program 1 times [2022-04-08 08:19:12,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:12,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [661287738] [2022-04-08 08:19:12,890 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:12,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1614630737, now seen corresponding path program 2 times [2022-04-08 08:19:12,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:12,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052641573] [2022-04-08 08:19:12,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:12,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:12,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:12,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {3785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {3779#true} is VALID [2022-04-08 08:19:12,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {3779#true} assume true; {3779#true} is VALID [2022-04-08 08:19:12,917 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3779#true} {3779#true} #115#return; {3779#true} is VALID [2022-04-08 08:19:12,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {3779#true} call ULTIMATE.init(); {3785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:12,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {3785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {3779#true} is VALID [2022-04-08 08:19:12,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {3779#true} assume true; {3779#true} is VALID [2022-04-08 08:19:12,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3779#true} {3779#true} #115#return; {3779#true} is VALID [2022-04-08 08:19:12,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {3779#true} call #t~ret10 := main(); {3779#true} is VALID [2022-04-08 08:19:12,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {3779#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;havoc ~cond~0; {3779#true} is VALID [2022-04-08 08:19:12,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {3779#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {3779#true} is VALID [2022-04-08 08:19:12,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {3779#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {3779#true} is VALID [2022-04-08 08:19:12,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {3779#true} assume !(0 != ~p1~0); {3779#true} is VALID [2022-04-08 08:19:12,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {3779#true} assume !(0 != ~p2~0); {3779#true} is VALID [2022-04-08 08:19:12,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {3779#true} assume 0 != ~p3~0;~lk3~0 := 1; {3784#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:12,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {3784#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {3784#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:12,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {3784#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {3784#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:12,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {3784#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {3784#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:12,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {3784#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {3784#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:12,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {3784#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {3780#false} is VALID [2022-04-08 08:19:12,920 INFO L290 TraceCheckUtils]: 16: Hoare triple {3780#false} assume 0 != ~p4~0; {3780#false} is VALID [2022-04-08 08:19:12,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {3780#false} assume 1 != ~lk4~0; {3780#false} is VALID [2022-04-08 08:19:12,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {3780#false} assume !false; {3780#false} is VALID [2022-04-08 08:19:12,920 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-08 08:19:12,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:12,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052641573] [2022-04-08 08:19:12,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052641573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:12,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:12,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:12,920 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:12,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [661287738] [2022-04-08 08:19:12,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [661287738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:12,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:12,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:12,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480169400] [2022-04-08 08:19:12,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:12,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 08:19:12,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:12,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:12,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:12,931 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:12,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:12,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:12,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:12,931 INFO L87 Difference]: Start difference. First operand 135 states and 199 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:13,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:13,009 INFO L93 Difference]: Finished difference Result 205 states and 301 transitions. [2022-04-08 08:19:13,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:13,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 08:19:13,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:13,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:13,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-08 08:19:13,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:13,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-08 08:19:13,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-04-08 08:19:13,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:13,062 INFO L225 Difference]: With dead ends: 205 [2022-04-08 08:19:13,062 INFO L226 Difference]: Without dead ends: 143 [2022-04-08 08:19:13,062 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-08 08:19:13,063 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:13,063 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 57 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:13,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-08 08:19:13,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2022-04-08 08:19:13,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:13,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:13,085 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:13,085 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:13,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:13,087 INFO L93 Difference]: Finished difference Result 143 states and 204 transitions. [2022-04-08 08:19:13,088 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 204 transitions. [2022-04-08 08:19:13,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:13,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:13,088 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 143 states. [2022-04-08 08:19:13,089 INFO L87 Difference]: Start difference. First operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 143 states. [2022-04-08 08:19:13,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:13,091 INFO L93 Difference]: Finished difference Result 143 states and 204 transitions. [2022-04-08 08:19:13,091 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 204 transitions. [2022-04-08 08:19:13,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:13,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:13,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:13,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:13,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:13,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 203 transitions. [2022-04-08 08:19:13,094 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 203 transitions. Word has length 19 [2022-04-08 08:19:13,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:13,094 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 203 transitions. [2022-04-08 08:19:13,094 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:13,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 141 states and 203 transitions. [2022-04-08 08:19:13,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:13,256 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 203 transitions. [2022-04-08 08:19:13,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 08:19:13,256 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:13,256 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:13,256 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 08:19:13,257 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:13,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:13,257 INFO L85 PathProgramCache]: Analyzing trace with hash -934572367, now seen corresponding path program 1 times [2022-04-08 08:19:13,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:13,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [568205616] [2022-04-08 08:19:13,257 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:13,257 INFO L85 PathProgramCache]: Analyzing trace with hash -934572367, now seen corresponding path program 2 times [2022-04-08 08:19:13,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:13,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460332654] [2022-04-08 08:19:13,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:13,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:13,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:13,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {4775#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4769#true} is VALID [2022-04-08 08:19:13,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {4769#true} assume true; {4769#true} is VALID [2022-04-08 08:19:13,301 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4769#true} {4769#true} #115#return; {4769#true} is VALID [2022-04-08 08:19:13,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {4769#true} call ULTIMATE.init(); {4775#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:13,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {4775#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4769#true} is VALID [2022-04-08 08:19:13,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {4769#true} assume true; {4769#true} is VALID [2022-04-08 08:19:13,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4769#true} {4769#true} #115#return; {4769#true} is VALID [2022-04-08 08:19:13,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {4769#true} call #t~ret10 := main(); {4769#true} is VALID [2022-04-08 08:19:13,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {4769#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;havoc ~cond~0; {4769#true} is VALID [2022-04-08 08:19:13,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {4769#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {4769#true} is VALID [2022-04-08 08:19:13,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {4769#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {4769#true} is VALID [2022-04-08 08:19:13,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {4769#true} assume !(0 != ~p1~0); {4769#true} is VALID [2022-04-08 08:19:13,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {4769#true} assume !(0 != ~p2~0); {4769#true} is VALID [2022-04-08 08:19:13,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {4769#true} assume !(0 != ~p3~0); {4769#true} is VALID [2022-04-08 08:19:13,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {4769#true} assume 0 != ~p4~0;~lk4~0 := 1; {4774#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:13,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {4774#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {4774#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:13,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {4774#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {4774#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:13,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {4774#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {4774#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:13,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {4774#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {4774#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:13,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {4774#(= main_~lk4~0 1)} assume 0 != ~p4~0; {4774#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:13,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {4774#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {4770#false} is VALID [2022-04-08 08:19:13,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {4770#false} assume !false; {4770#false} is VALID [2022-04-08 08:19:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:19:13,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:13,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460332654] [2022-04-08 08:19:13,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460332654] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:13,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:13,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:13,305 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:13,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [568205616] [2022-04-08 08:19:13,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [568205616] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:13,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:13,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:13,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884756707] [2022-04-08 08:19:13,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:13,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 08:19:13,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:13,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:13,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:13,315 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:13,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:13,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:13,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:13,315 INFO L87 Difference]: Start difference. First operand 141 states and 203 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:13,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:13,399 INFO L93 Difference]: Finished difference Result 237 states and 341 transitions. [2022-04-08 08:19:13,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:13,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 08:19:13,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:13,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:13,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-04-08 08:19:13,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:13,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-04-08 08:19:13,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 59 transitions. [2022-04-08 08:19:13,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:13,450 INFO L225 Difference]: With dead ends: 237 [2022-04-08 08:19:13,450 INFO L226 Difference]: Without dead ends: 235 [2022-04-08 08:19:13,450 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-08 08:19:13,452 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 62 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:13,453 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 45 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:13,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-04-08 08:19:13,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 201. [2022-04-08 08:19:13,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:13,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states. Second operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:13,470 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:13,471 INFO L87 Difference]: Start difference. First operand 235 states. Second operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:13,477 INFO L93 Difference]: Finished difference Result 235 states and 332 transitions. [2022-04-08 08:19:13,477 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 332 transitions. [2022-04-08 08:19:13,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:13,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:13,478 INFO L74 IsIncluded]: Start isIncluded. First operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 235 states. [2022-04-08 08:19:13,478 INFO L87 Difference]: Start difference. First operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 235 states. [2022-04-08 08:19:13,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:13,482 INFO L93 Difference]: Finished difference Result 235 states and 332 transitions. [2022-04-08 08:19:13,483 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 332 transitions. [2022-04-08 08:19:13,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:13,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:13,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:13,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:13,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:13,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 283 transitions. [2022-04-08 08:19:13,497 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 283 transitions. Word has length 19 [2022-04-08 08:19:13,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:13,497 INFO L478 AbstractCegarLoop]: Abstraction has 201 states and 283 transitions. [2022-04-08 08:19:13,497 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:13,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 201 states and 283 transitions. [2022-04-08 08:19:13,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:13,758 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 283 transitions. [2022-04-08 08:19:13,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 08:19:13,758 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:13,759 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:13,759 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 08:19:13,759 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:13,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:13,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1743918993, now seen corresponding path program 1 times [2022-04-08 08:19:13,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:13,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [403419757] [2022-04-08 08:19:13,759 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:13,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1743918993, now seen corresponding path program 2 times [2022-04-08 08:19:13,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:13,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15733199] [2022-04-08 08:19:13,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:13,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:13,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:13,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {6133#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {6127#true} is VALID [2022-04-08 08:19:13,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {6127#true} assume true; {6127#true} is VALID [2022-04-08 08:19:13,783 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6127#true} {6127#true} #115#return; {6127#true} is VALID [2022-04-08 08:19:13,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {6127#true} call ULTIMATE.init(); {6133#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:13,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {6133#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {6127#true} is VALID [2022-04-08 08:19:13,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {6127#true} assume true; {6127#true} is VALID [2022-04-08 08:19:13,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6127#true} {6127#true} #115#return; {6127#true} is VALID [2022-04-08 08:19:13,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {6127#true} call #t~ret10 := main(); {6127#true} is VALID [2022-04-08 08:19:13,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {6127#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;havoc ~cond~0; {6127#true} is VALID [2022-04-08 08:19:13,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {6127#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {6127#true} is VALID [2022-04-08 08:19:13,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {6127#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {6127#true} is VALID [2022-04-08 08:19:13,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {6127#true} assume !(0 != ~p1~0); {6127#true} is VALID [2022-04-08 08:19:13,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {6127#true} assume !(0 != ~p2~0); {6127#true} is VALID [2022-04-08 08:19:13,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {6127#true} assume !(0 != ~p3~0); {6127#true} is VALID [2022-04-08 08:19:13,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {6127#true} assume !(0 != ~p4~0); {6132#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:13,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {6132#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {6132#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:13,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {6132#(= main_~p4~0 0)} assume !(0 != ~p1~0); {6132#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:13,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {6132#(= main_~p4~0 0)} assume !(0 != ~p2~0); {6132#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:13,786 INFO L290 TraceCheckUtils]: 15: Hoare triple {6132#(= main_~p4~0 0)} assume !(0 != ~p3~0); {6132#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:13,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {6132#(= main_~p4~0 0)} assume 0 != ~p4~0; {6128#false} is VALID [2022-04-08 08:19:13,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {6128#false} assume 1 != ~lk4~0; {6128#false} is VALID [2022-04-08 08:19:13,786 INFO L290 TraceCheckUtils]: 18: Hoare triple {6128#false} assume !false; {6128#false} is VALID [2022-04-08 08:19:13,786 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-08 08:19:13,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:13,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15733199] [2022-04-08 08:19:13,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15733199] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:13,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:13,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:13,787 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:13,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [403419757] [2022-04-08 08:19:13,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [403419757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:13,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:13,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:13,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679816138] [2022-04-08 08:19:13,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:13,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 08:19:13,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:13,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:13,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:13,797 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:13,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:13,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:13,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:13,797 INFO L87 Difference]: Start difference. First operand 201 states and 283 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:13,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:13,894 INFO L93 Difference]: Finished difference Result 445 states and 621 transitions. [2022-04-08 08:19:13,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:13,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 08:19:13,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:13,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:13,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-04-08 08:19:13,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:13,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-04-08 08:19:13,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 93 transitions. [2022-04-08 08:19:13,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:13,951 INFO L225 Difference]: With dead ends: 445 [2022-04-08 08:19:13,951 INFO L226 Difference]: Without dead ends: 259 [2022-04-08 08:19:13,952 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-08 08:19:13,953 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 55 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:13,953 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 61 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:13,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-08 08:19:13,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2022-04-08 08:19:13,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:13,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:13,971 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:13,972 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:13,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:13,976 INFO L93 Difference]: Finished difference Result 259 states and 344 transitions. [2022-04-08 08:19:13,976 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 344 transitions. [2022-04-08 08:19:13,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:13,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:13,977 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 259 states. [2022-04-08 08:19:13,977 INFO L87 Difference]: Start difference. First operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 259 states. [2022-04-08 08:19:13,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:13,981 INFO L93 Difference]: Finished difference Result 259 states and 344 transitions. [2022-04-08 08:19:13,981 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 344 transitions. [2022-04-08 08:19:13,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:13,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:13,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:13,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:13,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:13,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 343 transitions. [2022-04-08 08:19:13,987 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 343 transitions. Word has length 19 [2022-04-08 08:19:13,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:13,987 INFO L478 AbstractCegarLoop]: Abstraction has 257 states and 343 transitions. [2022-04-08 08:19:13,987 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:13,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 257 states and 343 transitions. [2022-04-08 08:19:14,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 343 edges. 343 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:14,306 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 343 transitions. [2022-04-08 08:19:14,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 08:19:14,307 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:14,307 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] [2022-04-08 08:19:14,307 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 08:19:14,307 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:14,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:14,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1093243721, now seen corresponding path program 1 times [2022-04-08 08:19:14,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:14,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [364557637] [2022-04-08 08:19:14,308 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:14,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1093243721, now seen corresponding path program 2 times [2022-04-08 08:19:14,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:14,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109898097] [2022-04-08 08:19:14,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:14,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:14,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:14,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {8067#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {8061#true} is VALID [2022-04-08 08:19:14,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {8061#true} assume true; {8061#true} is VALID [2022-04-08 08:19:14,343 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8061#true} {8061#true} #115#return; {8061#true} is VALID [2022-04-08 08:19:14,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {8061#true} call ULTIMATE.init(); {8067#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:14,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {8067#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {8061#true} is VALID [2022-04-08 08:19:14,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {8061#true} assume true; {8061#true} is VALID [2022-04-08 08:19:14,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8061#true} {8061#true} #115#return; {8061#true} is VALID [2022-04-08 08:19:14,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {8061#true} call #t~ret10 := main(); {8061#true} is VALID [2022-04-08 08:19:14,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {8061#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;havoc ~cond~0; {8061#true} is VALID [2022-04-08 08:19:14,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {8061#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {8061#true} is VALID [2022-04-08 08:19:14,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {8061#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {8061#true} is VALID [2022-04-08 08:19:14,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {8061#true} assume !(0 != ~p1~0); {8061#true} is VALID [2022-04-08 08:19:14,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {8061#true} assume !(0 != ~p2~0); {8061#true} is VALID [2022-04-08 08:19:14,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {8061#true} assume !(0 != ~p3~0); {8061#true} is VALID [2022-04-08 08:19:14,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {8061#true} assume 0 != ~p4~0;~lk4~0 := 1; {8066#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:14,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {8066#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {8066#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:14,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {8066#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {8066#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:14,345 INFO L290 TraceCheckUtils]: 14: Hoare triple {8066#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {8066#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:14,345 INFO L290 TraceCheckUtils]: 15: Hoare triple {8066#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {8066#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:14,346 INFO L290 TraceCheckUtils]: 16: Hoare triple {8066#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {8062#false} is VALID [2022-04-08 08:19:14,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {8062#false} assume 0 != ~p5~0; {8062#false} is VALID [2022-04-08 08:19:14,346 INFO L290 TraceCheckUtils]: 18: Hoare triple {8062#false} assume 1 != ~lk5~0; {8062#false} is VALID [2022-04-08 08:19:14,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {8062#false} assume !false; {8062#false} is VALID [2022-04-08 08:19:14,346 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-08 08:19:14,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:14,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109898097] [2022-04-08 08:19:14,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109898097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:14,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:14,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:14,347 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:14,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [364557637] [2022-04-08 08:19:14,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [364557637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:14,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:14,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:14,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973551506] [2022-04-08 08:19:14,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:14,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 08:19:14,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:14,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:14,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:14,357 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:14,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:14,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:14,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:14,358 INFO L87 Difference]: Start difference. First operand 257 states and 343 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:14,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:14,444 INFO L93 Difference]: Finished difference Result 385 states and 509 transitions. [2022-04-08 08:19:14,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:14,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 08:19:14,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:14,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:14,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-08 08:19:14,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:14,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-08 08:19:14,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 88 transitions. [2022-04-08 08:19:14,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:14,505 INFO L225 Difference]: With dead ends: 385 [2022-04-08 08:19:14,505 INFO L226 Difference]: Without dead ends: 267 [2022-04-08 08:19:14,505 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-08 08:19:14,506 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 63 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:14,506 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 54 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:14,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-08 08:19:14,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2022-04-08 08:19:14,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:14,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:14,522 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:14,523 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:14,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:14,527 INFO L93 Difference]: Finished difference Result 267 states and 344 transitions. [2022-04-08 08:19:14,527 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 344 transitions. [2022-04-08 08:19:14,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:14,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:14,528 INFO L74 IsIncluded]: Start isIncluded. First operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 267 states. [2022-04-08 08:19:14,529 INFO L87 Difference]: Start difference. First operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 267 states. [2022-04-08 08:19:14,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:14,533 INFO L93 Difference]: Finished difference Result 267 states and 344 transitions. [2022-04-08 08:19:14,533 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 344 transitions. [2022-04-08 08:19:14,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:14,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:14,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:14,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:14,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:14,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 343 transitions. [2022-04-08 08:19:14,540 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 343 transitions. Word has length 20 [2022-04-08 08:19:14,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:14,540 INFO L478 AbstractCegarLoop]: Abstraction has 265 states and 343 transitions. [2022-04-08 08:19:14,540 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:14,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 265 states and 343 transitions. [2022-04-08 08:19:14,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 343 edges. 343 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:14,838 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 343 transitions. [2022-04-08 08:19:14,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 08:19:14,839 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:14,840 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] [2022-04-08 08:19:14,840 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 08:19:14,841 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:14,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:14,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1773302091, now seen corresponding path program 1 times [2022-04-08 08:19:14,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:14,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1078747779] [2022-04-08 08:19:14,841 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:14,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1773302091, now seen corresponding path program 2 times [2022-04-08 08:19:14,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:14,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296235195] [2022-04-08 08:19:14,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:14,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:14,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:14,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {9913#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {9907#true} is VALID [2022-04-08 08:19:14,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {9907#true} assume true; {9907#true} is VALID [2022-04-08 08:19:14,864 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9907#true} {9907#true} #115#return; {9907#true} is VALID [2022-04-08 08:19:14,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {9907#true} call ULTIMATE.init(); {9913#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:14,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {9913#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {9907#true} is VALID [2022-04-08 08:19:14,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {9907#true} assume true; {9907#true} is VALID [2022-04-08 08:19:14,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9907#true} {9907#true} #115#return; {9907#true} is VALID [2022-04-08 08:19:14,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {9907#true} call #t~ret10 := main(); {9907#true} is VALID [2022-04-08 08:19:14,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {9907#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;havoc ~cond~0; {9907#true} is VALID [2022-04-08 08:19:14,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {9907#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {9907#true} is VALID [2022-04-08 08:19:14,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {9907#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {9907#true} is VALID [2022-04-08 08:19:14,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {9907#true} assume !(0 != ~p1~0); {9907#true} is VALID [2022-04-08 08:19:14,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {9907#true} assume !(0 != ~p2~0); {9907#true} is VALID [2022-04-08 08:19:14,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {9907#true} assume !(0 != ~p3~0); {9907#true} is VALID [2022-04-08 08:19:14,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {9907#true} assume !(0 != ~p4~0); {9907#true} is VALID [2022-04-08 08:19:14,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {9907#true} assume 0 != ~p5~0;~lk5~0 := 1; {9912#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:14,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {9912#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {9912#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:14,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {9912#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {9912#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:14,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {9912#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {9912#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:14,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {9912#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {9912#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:14,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {9912#(= main_~lk5~0 1)} assume 0 != ~p5~0; {9912#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:14,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {9912#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {9908#false} is VALID [2022-04-08 08:19:14,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {9908#false} assume !false; {9908#false} is VALID [2022-04-08 08:19:14,867 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-08 08:19:14,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:14,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296235195] [2022-04-08 08:19:14,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296235195] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:14,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:14,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:14,868 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:14,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1078747779] [2022-04-08 08:19:14,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1078747779] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:14,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:14,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:14,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485799820] [2022-04-08 08:19:14,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:14,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 08:19:14,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:14,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:14,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:14,878 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:14,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:14,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:14,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:14,879 INFO L87 Difference]: Start difference. First operand 265 states and 343 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:14,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:14,981 INFO L93 Difference]: Finished difference Result 427 states and 544 transitions. [2022-04-08 08:19:14,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:14,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 08:19:14,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:14,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:14,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-08 08:19:14,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:14,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-08 08:19:14,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2022-04-08 08:19:15,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:15,023 INFO L225 Difference]: With dead ends: 427 [2022-04-08 08:19:15,023 INFO L226 Difference]: Without dead ends: 425 [2022-04-08 08:19:15,023 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-08 08:19:15,024 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 54 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:15,024 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 43 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:15,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-04-08 08:19:15,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 393. [2022-04-08 08:19:15,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:15,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 425 states. Second operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:15,050 INFO L74 IsIncluded]: Start isIncluded. First operand 425 states. Second operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:15,050 INFO L87 Difference]: Start difference. First operand 425 states. Second operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:15,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:15,059 INFO L93 Difference]: Finished difference Result 425 states and 527 transitions. [2022-04-08 08:19:15,059 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 527 transitions. [2022-04-08 08:19:15,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:15,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:15,060 INFO L74 IsIncluded]: Start isIncluded. First operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 425 states. [2022-04-08 08:19:15,061 INFO L87 Difference]: Start difference. First operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 425 states. [2022-04-08 08:19:15,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:15,072 INFO L93 Difference]: Finished difference Result 425 states and 527 transitions. [2022-04-08 08:19:15,072 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 527 transitions. [2022-04-08 08:19:15,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:15,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:15,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:15,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:15,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:15,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 495 transitions. [2022-04-08 08:19:15,081 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 495 transitions. Word has length 20 [2022-04-08 08:19:15,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:15,081 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 495 transitions. [2022-04-08 08:19:15,082 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:15,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 393 states and 495 transitions. [2022-04-08 08:19:15,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 495 edges. 495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:15,526 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 495 transitions. [2022-04-08 08:19:15,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 08:19:15,526 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:15,526 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] [2022-04-08 08:19:15,527 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 08:19:15,527 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:15,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:15,527 INFO L85 PathProgramCache]: Analyzing trace with hash 963955465, now seen corresponding path program 1 times [2022-04-08 08:19:15,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:15,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [162439404] [2022-04-08 08:19:15,527 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:15,527 INFO L85 PathProgramCache]: Analyzing trace with hash 963955465, now seen corresponding path program 2 times [2022-04-08 08:19:15,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:15,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451678226] [2022-04-08 08:19:15,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:15,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:15,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:15,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {12415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {12409#true} is VALID [2022-04-08 08:19:15,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {12409#true} assume true; {12409#true} is VALID [2022-04-08 08:19:15,562 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12409#true} {12409#true} #115#return; {12409#true} is VALID [2022-04-08 08:19:15,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {12409#true} call ULTIMATE.init(); {12415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:15,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {12415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {12409#true} is VALID [2022-04-08 08:19:15,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {12409#true} assume true; {12409#true} is VALID [2022-04-08 08:19:15,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12409#true} {12409#true} #115#return; {12409#true} is VALID [2022-04-08 08:19:15,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {12409#true} call #t~ret10 := main(); {12409#true} is VALID [2022-04-08 08:19:15,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {12409#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;havoc ~cond~0; {12409#true} is VALID [2022-04-08 08:19:15,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {12409#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {12409#true} is VALID [2022-04-08 08:19:15,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {12409#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {12409#true} is VALID [2022-04-08 08:19:15,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {12409#true} assume !(0 != ~p1~0); {12409#true} is VALID [2022-04-08 08:19:15,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {12409#true} assume !(0 != ~p2~0); {12409#true} is VALID [2022-04-08 08:19:15,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {12409#true} assume !(0 != ~p3~0); {12409#true} is VALID [2022-04-08 08:19:15,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {12409#true} assume !(0 != ~p4~0); {12409#true} is VALID [2022-04-08 08:19:15,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {12409#true} assume !(0 != ~p5~0); {12414#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:15,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {12414#(= main_~p5~0 0)} assume !(0 != ~p1~0); {12414#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:15,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {12414#(= main_~p5~0 0)} assume !(0 != ~p2~0); {12414#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:15,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {12414#(= main_~p5~0 0)} assume !(0 != ~p3~0); {12414#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:15,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {12414#(= main_~p5~0 0)} assume !(0 != ~p4~0); {12414#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:15,581 INFO L290 TraceCheckUtils]: 17: Hoare triple {12414#(= main_~p5~0 0)} assume 0 != ~p5~0; {12410#false} is VALID [2022-04-08 08:19:15,581 INFO L290 TraceCheckUtils]: 18: Hoare triple {12410#false} assume 1 != ~lk5~0; {12410#false} is VALID [2022-04-08 08:19:15,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {12410#false} assume !false; {12410#false} is VALID [2022-04-08 08:19:15,581 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-08 08:19:15,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:15,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451678226] [2022-04-08 08:19:15,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451678226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:15,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:15,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:15,582 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:15,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [162439404] [2022-04-08 08:19:15,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [162439404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:15,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:15,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:15,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537009046] [2022-04-08 08:19:15,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:15,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 08:19:15,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:15,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:15,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:15,593 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:15,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:15,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:15,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:15,594 INFO L87 Difference]: Start difference. First operand 393 states and 495 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:15,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:15,726 INFO L93 Difference]: Finished difference Result 857 states and 1055 transitions. [2022-04-08 08:19:15,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:15,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 08:19:15,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:15,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:15,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-08 08:19:15,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:15,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-08 08:19:15,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 88 transitions. [2022-04-08 08:19:15,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:15,779 INFO L225 Difference]: With dead ends: 857 [2022-04-08 08:19:15,779 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 08:19:15,780 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-08 08:19:15,781 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:15,781 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 62 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:15,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 08:19:15,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 08:19:15,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:15,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 08:19:15,781 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 08:19:15,781 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 08:19:15,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:15,782 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 08:19:15,782 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 08:19:15,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:15,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:15,782 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 08:19:15,782 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 08:19:15,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:15,782 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 08:19:15,782 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 08:19:15,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:15,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:15,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:15,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:15,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 08:19:15,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 08:19:15,782 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-04-08 08:19:15,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:15,782 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 08:19:15,782 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:15,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 08:19:15,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:15,783 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 08:19:15,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:15,784 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 08:19:15,785 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 08:19:15,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 08:19:18,623 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-08 08:19:18,623 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-08 08:19:18,623 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-08 08:19:18,623 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 08:19:18,623 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 08:19:18,623 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 08:19:18,623 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 08:19:18,623 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 08:19:18,623 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 08:19:18,623 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 08:19:18,624 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 6 95) the Hoare annotation is: true [2022-04-08 08:19:18,624 INFO L885 garLoopResultBuilder]: At program point L85-1(lines 26 90) the Hoare annotation is: true [2022-04-08 08:19:18,624 INFO L878 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (let ((.cse0 (not (= main_~p4~0 0))) (.cse1 (= main_~lk4~0 1))) (or (and .cse0 .cse1 (= main_~p5~0 0)) (and (= main_~lk5~0 1) .cse0 .cse1))) [2022-04-08 08:19:18,624 INFO L878 garLoopResultBuilder]: At program point L65-1(lines 26 90) the Hoare annotation is: (let ((.cse4 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse6 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse1 (= main_~lk4~0 1)) (.cse2 (= main_~lk3~0 1)) (.cse7 (= main_~p5~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse5) (and .cse0 .cse1 .cse3 .cse6) (and .cse4 .cse7 .cse3 .cse6) (and .cse4 .cse2 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse5) (and .cse4 .cse2 .cse7 .cse5) (and .cse4 .cse7 .cse6 .cse5) (and .cse1 .cse7 .cse3 .cse6) (and .cse0 .cse1 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse5) (and .cse1 .cse7 .cse6 .cse5) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse0 .cse6 .cse5) (and .cse1 .cse2 .cse7 .cse3))) [2022-04-08 08:19:18,624 INFO L885 garLoopResultBuilder]: At program point L28(lines 28 30) the Hoare annotation is: true [2022-04-08 08:19:18,624 INFO L878 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (= main_~lk5~0 1) [2022-04-08 08:19:18,624 INFO L878 garLoopResultBuilder]: At program point L86-1(lines 7 95) the Hoare annotation is: false [2022-04-08 08:19:18,624 INFO L878 garLoopResultBuilder]: At program point L70-1(lines 26 90) the Hoare annotation is: (let ((.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p4~0 0)) (.cse2 (= main_~p5~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse0 .cse5) (and .cse3 .cse2 .cse5) (and .cse0 .cse2 .cse5) (and .cse3 .cse4 .cse1) (and .cse3 .cse1 .cse2) (and .cse4 .cse0 .cse1))) [2022-04-08 08:19:18,624 INFO L878 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (let ((.cse6 (= main_~p4~0 0)) (.cse7 (= main_~lk5~0 1)) (.cse4 (= main_~p2~0 0)) (.cse5 (= main_~p3~0 0)) (.cse0 (not (= main_~p1~0 0))) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse9 (= main_~lk3~0 1)) (.cse3 (= main_~p5~0 0)) (.cse8 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse1 .cse5 .cse8) (and .cse6 .cse0 .cse1 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse1 .cse9 .cse8) (and .cse6 .cse7 .cse0 .cse1 .cse9 .cse4) (and .cse6 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse1 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse1 .cse2 .cse9 .cse8) (and .cse7 .cse0 .cse1 .cse2 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse1 .cse2 .cse9 .cse4) (and .cse6 .cse0 .cse1 .cse3 .cse5 .cse8) (and .cse6 .cse7 .cse0 .cse1 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse8))) [2022-04-08 08:19:18,624 INFO L885 garLoopResultBuilder]: At program point L91(lines 7 95) the Hoare annotation is: true [2022-04-08 08:19:18,624 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 6 95) the Hoare annotation is: true [2022-04-08 08:19:18,624 INFO L878 garLoopResultBuilder]: At program point L75-1(lines 26 90) the Hoare annotation is: (let ((.cse1 (= main_~p5~0 0)) (.cse2 (= main_~lk4~0 1)) (.cse0 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse3 .cse2) (and .cse0 .cse3))) [2022-04-08 08:19:18,624 INFO L878 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse2 (= main_~lk3~0 1)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p5~0 0)) (.cse0 (= main_~p4~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse6 (= main_~p3~0 0)) (.cse3 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2 .cse5 .cse3) (and .cse0 .cse2 .cse5 .cse3) (and .cse0 .cse5 .cse6 .cse3) (and .cse1 .cse4 .cse6 .cse3) (and .cse1 .cse4 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse3) (and .cse0 .cse1 .cse6 .cse3))) [2022-04-08 08:19:18,625 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 93) the Hoare annotation is: false [2022-04-08 08:19:18,625 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 95) the Hoare annotation is: true [2022-04-08 08:19:18,625 INFO L878 garLoopResultBuilder]: At program point L59-1(lines 26 90) the Hoare annotation is: (let ((.cse9 (= main_~lk2~0 1)) (.cse4 (= main_~p3~0 0)) (.cse5 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse8 (= main_~p1~0 0)) (.cse7 (= main_~p5~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse2 .cse8 .cse7 .cse4 .cse9) (and .cse0 .cse2 .cse8 .cse3 .cse4) (and .cse5 .cse0 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse9) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse5 .cse6 .cse8 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse3) (and .cse5 .cse0 .cse6 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse7 .cse4 .cse9) (and .cse5 .cse0 .cse6 .cse8 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse3) (and .cse5 .cse0 .cse8 .cse3 .cse4) (and .cse5 .cse1 .cse7 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse3 .cse4) (and .cse2 .cse6 .cse8 .cse7 .cse9) (and .cse5 .cse0 .cse1 .cse4 .cse9) (and .cse2 .cse8 .cse7 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse2 .cse8 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse4 .cse9) (and .cse5 .cse6 .cse8 .cse7 .cse3) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse3) (and .cse2 .cse6 .cse8 .cse7 .cse3))) [2022-04-08 08:19:18,625 INFO L878 garLoopResultBuilder]: At program point L55-1(lines 26 90) the Hoare annotation is: (let ((.cse5 (= main_~lk1~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse3 (= main_~p2~0 0)) (.cse4 (= main_~p4~0 0)) (.cse2 (= main_~p1~0 0)) (.cse6 (= main_~p3~0 0)) (.cse7 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse7) (and .cse4 .cse2 .cse3 .cse6) (and .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse5 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse6 .cse7) (and .cse5 .cse0 .cse1 .cse7) (and .cse4 .cse1 .cse2 .cse7) (and .cse0 .cse1 .cse2 .cse7) (and .cse4 .cse5 .cse3 .cse6) (and .cse0 .cse2 .cse6 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse0 .cse1 .cse3) (and .cse4 .cse2 .cse6 .cse7))) [2022-04-08 08:19:18,625 INFO L878 garLoopResultBuilder]: At program point L51-1(lines 26 90) the Hoare annotation is: (let ((.cse4 (= main_~p1~0 0)) (.cse2 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse1 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse1 .cse2) (and .cse0 .cse3 .cse5) (and .cse3 .cse4 .cse1) (and .cse0 .cse2 .cse5) (and .cse4 .cse2 .cse5) (and .cse0 .cse3 .cse1))) [2022-04-08 08:19:18,625 INFO L878 garLoopResultBuilder]: At program point L80-1(lines 26 90) the Hoare annotation is: (or (= main_~lk5~0 1) (= main_~p5~0 0)) [2022-04-08 08:19:18,625 INFO L878 garLoopResultBuilder]: At program point L47-1(lines 26 90) the Hoare annotation is: (let ((.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~p2~0 0)) (.cse2 (= main_~p1~0 0)) (.cse1 (= main_~lk2~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse3) (and .cse2 .cse1))) [2022-04-08 08:19:18,625 INFO L878 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (let ((.cse1 (= main_~p4~0 0)) (.cse2 (= main_~lk5~0 1)) (.cse0 (not (= main_~p3~0 0))) (.cse5 (= main_~lk4~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse4 (= main_~p5~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse4) (and .cse0 .cse2 .cse5 .cse3) (and .cse0 .cse5 .cse3 .cse4))) [2022-04-08 08:19:18,625 INFO L885 garLoopResultBuilder]: At program point L43(lines 43 45) the Hoare annotation is: true [2022-04-08 08:19:18,625 INFO L878 garLoopResultBuilder]: At program point L43-2(lines 26 90) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-04-08 08:19:18,627 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-08 08:19:18,628 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 08:19:18,633 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 08:19:18,635 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 08:19:18,657 INFO L163 areAnnotationChecker]: CFG has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 08:19:18,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 08:19:18 BoogieIcfgContainer [2022-04-08 08:19:18,662 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 08:19:18,663 INFO L158 Benchmark]: Toolchain (without parser) took 9101.81ms. Allocated memory was 199.2MB in the beginning and 297.8MB in the end (delta: 98.6MB). Free memory was 141.1MB in the beginning and 159.5MB in the end (delta: -18.4MB). Peak memory consumption was 147.3MB. Max. memory is 8.0GB. [2022-04-08 08:19:18,663 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 199.2MB. Free memory was 157.2MB in the beginning and 157.0MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 08:19:18,663 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.53ms. Allocated memory was 199.2MB in the beginning and 247.5MB in the end (delta: 48.2MB). Free memory was 140.9MB in the beginning and 219.2MB in the end (delta: -78.3MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. [2022-04-08 08:19:18,663 INFO L158 Benchmark]: Boogie Preprocessor took 28.81ms. Allocated memory is still 247.5MB. Free memory was 219.2MB in the beginning and 217.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 08:19:18,663 INFO L158 Benchmark]: RCFGBuilder took 218.43ms. Allocated memory is still 247.5MB. Free memory was 217.1MB in the beginning and 205.0MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 08:19:18,663 INFO L158 Benchmark]: TraceAbstraction took 8645.80ms. Allocated memory was 247.5MB in the beginning and 297.8MB in the end (delta: 50.3MB). Free memory was 204.5MB in the beginning and 159.5MB in the end (delta: 45.0MB). Peak memory consumption was 163.2MB. Max. memory is 8.0GB. [2022-04-08 08:19:18,664 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 199.2MB. Free memory was 157.2MB in the beginning and 157.0MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 203.53ms. Allocated memory was 199.2MB in the beginning and 247.5MB in the end (delta: 48.2MB). Free memory was 140.9MB in the beginning and 219.2MB in the end (delta: -78.3MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.81ms. Allocated memory is still 247.5MB. Free memory was 219.2MB in the beginning and 217.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 218.43ms. Allocated memory is still 247.5MB. Free memory was 217.1MB in the beginning and 205.0MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 8645.80ms. Allocated memory was 247.5MB in the beginning and 297.8MB in the end (delta: 50.3MB). Free memory was 204.5MB in the beginning and 159.5MB in the end (delta: 45.0MB). Peak memory consumption was 163.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 93]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 831 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 831 mSDsluCounter, 721 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 429 IncrementalHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 628 mSDtfsCounter, 429 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=393occurred in iteration=12, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 136 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 30 LocationsWithAnnotation, 30 PreInvPairs, 519 NumberOfFragments, 1696 HoareAnnotationTreeSize, 30 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 30 FomulaSimplificationsInter, 9655 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 08:19:18,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...