/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/locks/test_locks_15-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 18:01:59,696 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 18:01:59,697 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 18:01:59,756 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 18:01:59,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 18:01:59,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 18:01:59,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 18:01:59,759 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 18:01:59,773 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 18:01:59,774 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 18:01:59,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 18:01:59,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 18:01:59,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 18:01:59,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 18:01:59,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 18:01:59,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 18:01:59,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 18:01:59,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 18:01:59,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 18:01:59,780 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 18:01:59,781 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 18:01:59,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 18:01:59,807 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 18:01:59,808 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 18:01:59,809 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 18:01:59,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 18:01:59,811 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 18:01:59,811 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 18:01:59,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 18:01:59,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 18:01:59,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 18:01:59,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 18:01:59,813 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 18:01:59,813 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 18:01:59,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 18:01:59,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 18:01:59,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 18:01:59,815 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 18:01:59,815 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 18:01:59,815 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 18:01:59,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 18:01:59,816 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 18:01:59,816 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 18:01:59,836 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 18:01:59,836 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 18:01:59,837 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 18:01:59,837 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 18:01:59,837 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 18:01:59,837 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 18:01:59,837 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 18:01:59,837 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 18:01:59,837 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 18:01:59,837 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 18:01:59,837 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 18:01:59,838 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 18:01:59,838 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 18:01:59,838 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 18:01:59,838 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 18:01:59,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 18:01:59,838 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 18:01:59,838 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 18:01:59,838 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 18:01:59,838 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 18:01:59,838 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 18:01:59,839 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 18:01:59,839 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 18:02:00,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 18:02:00,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 18:02:00,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 18:02:00,052 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 18:02:00,053 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 18:02:00,055 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_15-2.c [2022-04-15 18:02:00,108 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93e8465ee/931fb5452d734d118713f21a6487b1a0/FLAGe6ef89c52 [2022-04-15 18:02:00,464 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 18:02:00,465 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-2.c [2022-04-15 18:02:00,469 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93e8465ee/931fb5452d734d118713f21a6487b1a0/FLAGe6ef89c52 [2022-04-15 18:02:00,478 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93e8465ee/931fb5452d734d118713f21a6487b1a0 [2022-04-15 18:02:00,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 18:02:00,481 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 18:02:00,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 18:02:00,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 18:02:00,497 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 18:02:00,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:02:00" (1/1) ... [2022-04-15 18:02:00,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47aba2b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:02:00, skipping insertion in model container [2022-04-15 18:02:00,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:02:00" (1/1) ... [2022-04-15 18:02:00,513 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 18:02:00,540 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 18:02:00,679 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-2.c[5628,5641] [2022-04-15 18:02:00,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 18:02:00,691 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 18:02:00,713 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-2.c[5628,5641] [2022-04-15 18:02:00,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 18:02:00,723 INFO L208 MainTranslator]: Completed translation [2022-04-15 18:02:00,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:02:00 WrapperNode [2022-04-15 18:02:00,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 18:02:00,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 18:02:00,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 18:02:00,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 18:02:00,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:02:00" (1/1) ... [2022-04-15 18:02:00,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:02:00" (1/1) ... [2022-04-15 18:02:00,741 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:02:00" (1/1) ... [2022-04-15 18:02:00,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:02:00" (1/1) ... [2022-04-15 18:02:00,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:02:00" (1/1) ... [2022-04-15 18:02:00,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:02:00" (1/1) ... [2022-04-15 18:02:00,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:02:00" (1/1) ... [2022-04-15 18:02:00,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 18:02:00,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 18:02:00,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 18:02:00,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 18:02:00,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:02:00" (1/1) ... [2022-04-15 18:02:00,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 18:02:00,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 18:02:00,813 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 18:02:00,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-15 18:02:00,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 18:02:00,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 18:02:00,861 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 18:02:00,862 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 18:02:00,862 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 18:02:00,863 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 18:02:00,863 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 18:02:00,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 18:02:00,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 18:02:00,863 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 18:02:00,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 18:02:00,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 18:02:00,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 18:02:00,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 18:02:00,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 18:02:00,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 18:02:00,947 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 18:02:00,949 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 18:02:01,168 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 18:02:01,175 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 18:02:01,175 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 18:02:01,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:02:01 BoogieIcfgContainer [2022-04-15 18:02:01,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 18:02:01,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 18:02:01,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 18:02:01,181 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 18:02:01,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:02:00" (1/3) ... [2022-04-15 18:02:01,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a04709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:02:01, skipping insertion in model container [2022-04-15 18:02:01,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:02:00" (2/3) ... [2022-04-15 18:02:01,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a04709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:02:01, skipping insertion in model container [2022-04-15 18:02:01,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:02:01" (3/3) ... [2022-04-15 18:02:01,183 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.c [2022-04-15 18:02:01,187 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 18:02:01,187 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 18:02:01,220 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 18:02:01,227 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 18:02:01,227 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 18:02:01,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 18:02:01,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 18:02:01,250 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:02:01,251 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:02:01,251 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:02:01,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:02:01,255 INFO L85 PathProgramCache]: Analyzing trace with hash 208658311, now seen corresponding path program 1 times [2022-04-15 18:02:01,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:01,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1384220345] [2022-04-15 18:02:01,271 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:02:01,271 INFO L85 PathProgramCache]: Analyzing trace with hash 208658311, now seen corresponding path program 2 times [2022-04-15 18:02:01,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:02:01,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387619056] [2022-04-15 18:02:01,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:02:01,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:02:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:01,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:02:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:01,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {69#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {63#true} is VALID [2022-04-15 18:02:01,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#true} assume true; {63#true} is VALID [2022-04-15 18:02:01,577 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63#true} {63#true} #285#return; {63#true} is VALID [2022-04-15 18:02:01,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {63#true} call ULTIMATE.init(); {69#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:02:01,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {69#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {63#true} is VALID [2022-04-15 18:02:01,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {63#true} assume true; {63#true} is VALID [2022-04-15 18:02:01,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63#true} {63#true} #285#return; {63#true} is VALID [2022-04-15 18:02:01,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {63#true} call #t~ret20 := main(); {63#true} is VALID [2022-04-15 18:02:01,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {63#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {63#true} is VALID [2022-04-15 18:02:01,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {63#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {63#true} is VALID [2022-04-15 18:02:01,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {63#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {63#true} is VALID [2022-04-15 18:02:01,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {63#true} assume 0 != ~p1~0;~lk1~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-15 18:02:01,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {68#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {68#(= main_~lk1~0 1)} is VALID [2022-04-15 18:02:01,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-15 18:02:01,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-15 18:02:01,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-15 18:02:01,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-15 18:02:01,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-15 18:02:01,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-15 18:02:01,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-15 18:02:01,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {68#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {68#(= main_~lk1~0 1)} is VALID [2022-04-15 18:02:01,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-15 18:02:01,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-15 18:02:01,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-15 18:02:01,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-15 18:02:01,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-15 18:02:01,599 INFO L290 TraceCheckUtils]: 23: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p1~0; {68#(= main_~lk1~0 1)} is VALID [2022-04-15 18:02:01,599 INFO L290 TraceCheckUtils]: 24: Hoare triple {68#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {64#false} is VALID [2022-04-15 18:02:01,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {64#false} assume !false; {64#false} is VALID [2022-04-15 18:02:01,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:02:01,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:02:01,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387619056] [2022-04-15 18:02:01,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387619056] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:01,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:01,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:01,603 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:02:01,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1384220345] [2022-04-15 18:02:01,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1384220345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:01,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:01,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:01,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833535655] [2022-04-15 18:02:01,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:02:01,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 18:02:01,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:02:01,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:01,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:01,647 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:02:01,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:01,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:02:01,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:02:01,675 INFO L87 Difference]: Start difference. First operand has 60 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:02,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:02,074 INFO L93 Difference]: Finished difference Result 118 states and 211 transitions. [2022-04-15 18:02:02,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:02:02,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 18:02:02,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:02:02,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:02,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-15 18:02:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:02,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-15 18:02:02,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 211 transitions. [2022-04-15 18:02:02,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:02,304 INFO L225 Difference]: With dead ends: 118 [2022-04-15 18:02:02,304 INFO L226 Difference]: Without dead ends: 103 [2022-04-15 18:02:02,307 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:02:02,311 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 259 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:02:02,312 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 119 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 18:02:02,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-15 18:02:02,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2022-04-15 18:02:02,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:02:02,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:02,365 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:02,366 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:02,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:02,376 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2022-04-15 18:02:02,376 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 189 transitions. [2022-04-15 18:02:02,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:02,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:02,379 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 103 states. [2022-04-15 18:02:02,379 INFO L87 Difference]: Start difference. First operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 103 states. [2022-04-15 18:02:02,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:02,387 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2022-04-15 18:02:02,387 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 189 transitions. [2022-04-15 18:02:02,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:02,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:02,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:02:02,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:02:02,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:02,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 130 transitions. [2022-04-15 18:02:02,392 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 130 transitions. Word has length 26 [2022-04-15 18:02:02,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:02:02,393 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 130 transitions. [2022-04-15 18:02:02,393 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:02,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 130 transitions. [2022-04-15 18:02:02,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:02,519 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 130 transitions. [2022-04-15 18:02:02,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 18:02:02,524 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:02:02,524 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:02:02,524 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 18:02:02,525 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:02:02,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:02:02,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1785486395, now seen corresponding path program 1 times [2022-04-15 18:02:02,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:02,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1039930686] [2022-04-15 18:02:02,529 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:02:02,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1785486395, now seen corresponding path program 2 times [2022-04-15 18:02:02,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:02:02,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691140026] [2022-04-15 18:02:02,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:02:02,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:02:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:02,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:02:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:02,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {659#true} is VALID [2022-04-15 18:02:02,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-15 18:02:02,637 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {659#true} {659#true} #285#return; {659#true} is VALID [2022-04-15 18:02:02,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:02:02,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {659#true} is VALID [2022-04-15 18:02:02,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-15 18:02:02,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #285#return; {659#true} is VALID [2022-04-15 18:02:02,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret20 := main(); {659#true} is VALID [2022-04-15 18:02:02,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {659#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {659#true} is VALID [2022-04-15 18:02:02,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {659#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {659#true} is VALID [2022-04-15 18:02:02,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {659#true} is VALID [2022-04-15 18:02:02,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#true} assume !(0 != ~p1~0); {664#(= main_~p1~0 0)} is VALID [2022-04-15 18:02:02,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {664#(= main_~p1~0 0)} assume !(0 != ~p2~0); {664#(= main_~p1~0 0)} is VALID [2022-04-15 18:02:02,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-15 18:02:02,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-15 18:02:02,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-15 18:02:02,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-15 18:02:02,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-15 18:02:02,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-15 18:02:02,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-15 18:02:02,644 INFO L290 TraceCheckUtils]: 17: Hoare triple {664#(= main_~p1~0 0)} assume !(0 != ~p10~0); {664#(= main_~p1~0 0)} is VALID [2022-04-15 18:02:02,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-15 18:02:02,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-15 18:02:02,646 INFO L290 TraceCheckUtils]: 20: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-15 18:02:02,646 INFO L290 TraceCheckUtils]: 21: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-15 18:02:02,646 INFO L290 TraceCheckUtils]: 22: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-15 18:02:02,647 INFO L290 TraceCheckUtils]: 23: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p1~0; {660#false} is VALID [2022-04-15 18:02:02,647 INFO L290 TraceCheckUtils]: 24: Hoare triple {660#false} assume 1 != ~lk1~0; {660#false} is VALID [2022-04-15 18:02:02,647 INFO L290 TraceCheckUtils]: 25: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-04-15 18:02:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:02:02,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:02:02,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691140026] [2022-04-15 18:02:02,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691140026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:02,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:02,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:02,649 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:02:02,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1039930686] [2022-04-15 18:02:02,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1039930686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:02,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:02,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:02,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71623983] [2022-04-15 18:02:02,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:02:02,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 18:02:02,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:02:02,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:02,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:02,671 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:02:02,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:02,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:02:02,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:02:02,672 INFO L87 Difference]: Start difference. First operand 71 states and 130 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:02,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:02,913 INFO L93 Difference]: Finished difference Result 168 states and 313 transitions. [2022-04-15 18:02:02,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:02:02,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 18:02:02,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:02:02,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:02,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2022-04-15 18:02:02,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:02,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2022-04-15 18:02:02,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 282 transitions. [2022-04-15 18:02:03,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:03,160 INFO L225 Difference]: With dead ends: 168 [2022-04-15 18:02:03,160 INFO L226 Difference]: Without dead ends: 103 [2022-04-15 18:02:03,161 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:02:03,164 INFO L913 BasicCegarLoop]: 128 mSDtfsCounter, 223 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:02:03,167 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 135 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 18:02:03,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-15 18:02:03,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2022-04-15 18:02:03,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:02:03,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:03,185 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:03,185 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:03,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:03,188 INFO L93 Difference]: Finished difference Result 103 states and 187 transitions. [2022-04-15 18:02:03,188 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2022-04-15 18:02:03,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:03,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:03,189 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 103 states. [2022-04-15 18:02:03,189 INFO L87 Difference]: Start difference. First operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 103 states. [2022-04-15 18:02:03,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:03,197 INFO L93 Difference]: Finished difference Result 103 states and 187 transitions. [2022-04-15 18:02:03,197 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2022-04-15 18:02:03,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:03,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:03,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:02:03,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:02:03,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:03,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 186 transitions. [2022-04-15 18:02:03,203 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 186 transitions. Word has length 26 [2022-04-15 18:02:03,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:02:03,204 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 186 transitions. [2022-04-15 18:02:03,204 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:03,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 186 transitions. [2022-04-15 18:02:03,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:03,342 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 186 transitions. [2022-04-15 18:02:03,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 18:02:03,343 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:02:03,343 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:02:03,343 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 18:02:03,343 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:02:03,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:02:03,343 INFO L85 PathProgramCache]: Analyzing trace with hash -2121315188, now seen corresponding path program 1 times [2022-04-15 18:02:03,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:03,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1874812812] [2022-04-15 18:02:03,344 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:02:03,344 INFO L85 PathProgramCache]: Analyzing trace with hash -2121315188, now seen corresponding path program 2 times [2022-04-15 18:02:03,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:02:03,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294368000] [2022-04-15 18:02:03,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:02:03,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:02:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:03,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:02:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:03,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {1421#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1415#true} is VALID [2022-04-15 18:02:03,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {1415#true} assume true; {1415#true} is VALID [2022-04-15 18:02:03,393 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1415#true} {1415#true} #285#return; {1415#true} is VALID [2022-04-15 18:02:03,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {1415#true} call ULTIMATE.init(); {1421#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:02:03,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {1421#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1415#true} is VALID [2022-04-15 18:02:03,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {1415#true} assume true; {1415#true} is VALID [2022-04-15 18:02:03,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1415#true} {1415#true} #285#return; {1415#true} is VALID [2022-04-15 18:02:03,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {1415#true} call #t~ret20 := main(); {1415#true} is VALID [2022-04-15 18:02:03,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {1415#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {1415#true} is VALID [2022-04-15 18:02:03,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {1415#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {1415#true} is VALID [2022-04-15 18:02:03,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {1415#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {1415#true} is VALID [2022-04-15 18:02:03,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {1415#true} assume 0 != ~p1~0;~lk1~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 18:02:03,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {1420#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 18:02:03,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 18:02:03,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 18:02:03,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 18:02:03,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 18:02:03,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 18:02:03,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 18:02:03,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 18:02:03,417 INFO L290 TraceCheckUtils]: 17: Hoare triple {1420#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 18:02:03,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 18:02:03,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 18:02:03,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 18:02:03,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 18:02:03,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-15 18:02:03,419 INFO L290 TraceCheckUtils]: 23: Hoare triple {1420#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1416#false} is VALID [2022-04-15 18:02:03,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {1416#false} assume 0 != ~p2~0; {1416#false} is VALID [2022-04-15 18:02:03,419 INFO L290 TraceCheckUtils]: 25: Hoare triple {1416#false} assume 1 != ~lk2~0; {1416#false} is VALID [2022-04-15 18:02:03,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {1416#false} assume !false; {1416#false} is VALID [2022-04-15 18:02:03,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:02:03,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:02:03,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294368000] [2022-04-15 18:02:03,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294368000] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:03,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:03,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:03,420 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:02:03,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1874812812] [2022-04-15 18:02:03,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1874812812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:03,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:03,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:03,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203447847] [2022-04-15 18:02:03,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:02:03,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 18:02:03,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:02:03,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:03,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:03,438 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:02:03,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:03,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:02:03,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:02:03,438 INFO L87 Difference]: Start difference. First operand 101 states and 186 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:03,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:03,675 INFO L93 Difference]: Finished difference Result 154 states and 280 transitions. [2022-04-15 18:02:03,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:02:03,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 18:02:03,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:02:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:03,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 277 transitions. [2022-04-15 18:02:03,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:03,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 277 transitions. [2022-04-15 18:02:03,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 277 transitions. [2022-04-15 18:02:03,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:03,874 INFO L225 Difference]: With dead ends: 154 [2022-04-15 18:02:03,874 INFO L226 Difference]: Without dead ends: 106 [2022-04-15 18:02:03,874 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:02:03,875 INFO L913 BasicCegarLoop]: 156 mSDtfsCounter, 196 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:02:03,879 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 163 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 18:02:03,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-15 18:02:03,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2022-04-15 18:02:03,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:02:03,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:03,900 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:03,901 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:03,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:03,904 INFO L93 Difference]: Finished difference Result 106 states and 189 transitions. [2022-04-15 18:02:03,904 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 189 transitions. [2022-04-15 18:02:03,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:03,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:03,905 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-15 18:02:03,905 INFO L87 Difference]: Start difference. First operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-15 18:02:03,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:03,909 INFO L93 Difference]: Finished difference Result 106 states and 189 transitions. [2022-04-15 18:02:03,910 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 189 transitions. [2022-04-15 18:02:03,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:03,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:03,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:02:03,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:02:03,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:03,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 188 transitions. [2022-04-15 18:02:03,913 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 188 transitions. Word has length 27 [2022-04-15 18:02:03,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:02:03,913 INFO L478 AbstractCegarLoop]: Abstraction has 104 states and 188 transitions. [2022-04-15 18:02:03,913 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:03,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 188 transitions. [2022-04-15 18:02:04,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:04,061 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 188 transitions. [2022-04-15 18:02:04,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 18:02:04,061 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:02:04,061 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:02:04,061 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 18:02:04,062 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:02:04,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:02:04,062 INFO L85 PathProgramCache]: Analyzing trace with hash 484708366, now seen corresponding path program 1 times [2022-04-15 18:02:04,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:04,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [685518714] [2022-04-15 18:02:04,063 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:02:04,063 INFO L85 PathProgramCache]: Analyzing trace with hash 484708366, now seen corresponding path program 2 times [2022-04-15 18:02:04,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:02:04,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016634622] [2022-04-15 18:02:04,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:02:04,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:02:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:04,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:02:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:04,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {2161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-15 18:02:04,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-15 18:02:04,123 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2155#true} {2155#true} #285#return; {2155#true} is VALID [2022-04-15 18:02:04,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:02:04,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {2161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-15 18:02:04,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-15 18:02:04,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #285#return; {2155#true} is VALID [2022-04-15 18:02:04,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret20 := main(); {2155#true} is VALID [2022-04-15 18:02:04,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {2155#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {2155#true} is VALID [2022-04-15 18:02:04,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {2155#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {2155#true} is VALID [2022-04-15 18:02:04,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {2155#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {2155#true} is VALID [2022-04-15 18:02:04,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {2155#true} assume !(0 != ~p1~0); {2155#true} is VALID [2022-04-15 18:02:04,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {2155#true} assume !(0 != ~p2~0); {2160#(= main_~p2~0 0)} is VALID [2022-04-15 18:02:04,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-15 18:02:04,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-15 18:02:04,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-15 18:02:04,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-15 18:02:04,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-15 18:02:04,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-15 18:02:04,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-15 18:02:04,130 INFO L290 TraceCheckUtils]: 17: Hoare triple {2160#(= main_~p2~0 0)} assume !(0 != ~p10~0); {2160#(= main_~p2~0 0)} is VALID [2022-04-15 18:02:04,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-15 18:02:04,131 INFO L290 TraceCheckUtils]: 19: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-15 18:02:04,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-15 18:02:04,133 INFO L290 TraceCheckUtils]: 21: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-15 18:02:04,133 INFO L290 TraceCheckUtils]: 22: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-15 18:02:04,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {2160#(= main_~p2~0 0)} assume !(0 != ~p1~0); {2160#(= main_~p2~0 0)} is VALID [2022-04-15 18:02:04,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p2~0; {2156#false} is VALID [2022-04-15 18:02:04,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {2156#false} assume 1 != ~lk2~0; {2156#false} is VALID [2022-04-15 18:02:04,134 INFO L290 TraceCheckUtils]: 26: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-15 18:02:04,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:02:04,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:02:04,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016634622] [2022-04-15 18:02:04,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016634622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:04,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:04,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:04,135 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:02:04,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [685518714] [2022-04-15 18:02:04,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [685518714] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:04,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:04,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:04,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428472771] [2022-04-15 18:02:04,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:02:04,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 18:02:04,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:02:04,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:04,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:04,154 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:02:04,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:04,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:02:04,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:02:04,155 INFO L87 Difference]: Start difference. First operand 104 states and 188 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:04,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:04,403 INFO L93 Difference]: Finished difference Result 292 states and 540 transitions. [2022-04-15 18:02:04,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:02:04,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 18:02:04,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:02:04,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:04,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2022-04-15 18:02:04,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2022-04-15 18:02:04,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 280 transitions. [2022-04-15 18:02:04,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:04,643 INFO L225 Difference]: With dead ends: 292 [2022-04-15 18:02:04,643 INFO L226 Difference]: Without dead ends: 197 [2022-04-15 18:02:04,644 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:02:04,645 INFO L913 BasicCegarLoop]: 102 mSDtfsCounter, 248 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:02:04,645 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 109 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 18:02:04,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-15 18:02:04,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2022-04-15 18:02:04,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:02:04,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:04,656 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:04,656 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:04,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:04,661 INFO L93 Difference]: Finished difference Result 197 states and 358 transitions. [2022-04-15 18:02:04,661 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 358 transitions. [2022-04-15 18:02:04,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:04,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:04,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 197 states. [2022-04-15 18:02:04,662 INFO L87 Difference]: Start difference. First operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 197 states. [2022-04-15 18:02:04,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:04,666 INFO L93 Difference]: Finished difference Result 197 states and 358 transitions. [2022-04-15 18:02:04,666 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 358 transitions. [2022-04-15 18:02:04,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:04,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:04,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:02:04,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:02:04,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:04,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 357 transitions. [2022-04-15 18:02:04,672 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 357 transitions. Word has length 27 [2022-04-15 18:02:04,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:02:04,672 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 357 transitions. [2022-04-15 18:02:04,672 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:04,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 195 states and 357 transitions. [2022-04-15 18:02:04,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 357 edges. 357 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:04,956 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 357 transitions. [2022-04-15 18:02:04,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 18:02:04,956 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:02:04,956 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:02:04,957 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 18:02:04,957 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:02:04,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:02:04,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1816114224, now seen corresponding path program 1 times [2022-04-15 18:02:04,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:04,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1501203627] [2022-04-15 18:02:04,957 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:02:04,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1816114224, now seen corresponding path program 2 times [2022-04-15 18:02:04,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:02:04,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183409894] [2022-04-15 18:02:04,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:02:04,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:02:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:05,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:02:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:05,012 INFO L290 TraceCheckUtils]: 0: Hoare triple {3541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3535#true} is VALID [2022-04-15 18:02:05,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {3535#true} assume true; {3535#true} is VALID [2022-04-15 18:02:05,012 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3535#true} {3535#true} #285#return; {3535#true} is VALID [2022-04-15 18:02:05,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {3535#true} call ULTIMATE.init(); {3541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:02:05,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {3541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3535#true} is VALID [2022-04-15 18:02:05,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {3535#true} assume true; {3535#true} is VALID [2022-04-15 18:02:05,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3535#true} {3535#true} #285#return; {3535#true} is VALID [2022-04-15 18:02:05,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {3535#true} call #t~ret20 := main(); {3535#true} is VALID [2022-04-15 18:02:05,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {3535#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {3535#true} is VALID [2022-04-15 18:02:05,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {3535#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {3535#true} is VALID [2022-04-15 18:02:05,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {3535#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {3535#true} is VALID [2022-04-15 18:02:05,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {3535#true} assume !(0 != ~p1~0); {3535#true} is VALID [2022-04-15 18:02:05,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {3535#true} assume 0 != ~p2~0;~lk2~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 18:02:05,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 18:02:05,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 18:02:05,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 18:02:05,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 18:02:05,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 18:02:05,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 18:02:05,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 18:02:05,016 INFO L290 TraceCheckUtils]: 17: Hoare triple {3540#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 18:02:05,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 18:02:05,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 18:02:05,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 18:02:05,017 INFO L290 TraceCheckUtils]: 21: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 18:02:05,018 INFO L290 TraceCheckUtils]: 22: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 18:02:05,018 INFO L290 TraceCheckUtils]: 23: Hoare triple {3540#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 18:02:05,018 INFO L290 TraceCheckUtils]: 24: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p2~0; {3540#(= main_~lk2~0 1)} is VALID [2022-04-15 18:02:05,019 INFO L290 TraceCheckUtils]: 25: Hoare triple {3540#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {3536#false} is VALID [2022-04-15 18:02:05,019 INFO L290 TraceCheckUtils]: 26: Hoare triple {3536#false} assume !false; {3536#false} is VALID [2022-04-15 18:02:05,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:02:05,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:02:05,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183409894] [2022-04-15 18:02:05,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183409894] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:05,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:05,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:05,020 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:02:05,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1501203627] [2022-04-15 18:02:05,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1501203627] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:05,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:05,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:05,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107929538] [2022-04-15 18:02:05,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:02:05,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 18:02:05,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:02:05,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:05,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:05,034 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:02:05,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:05,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:02:05,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:02:05,035 INFO L87 Difference]: Start difference. First operand 195 states and 357 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:05,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:05,272 INFO L93 Difference]: Finished difference Result 255 states and 467 transitions. [2022-04-15 18:02:05,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:02:05,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 18:02:05,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:02:05,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:05,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-15 18:02:05,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:05,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-15 18:02:05,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 184 transitions. [2022-04-15 18:02:05,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:05,444 INFO L225 Difference]: With dead ends: 255 [2022-04-15 18:02:05,444 INFO L226 Difference]: Without dead ends: 253 [2022-04-15 18:02:05,445 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:02:05,455 INFO L913 BasicCegarLoop]: 181 mSDtfsCounter, 161 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:02:05,455 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 188 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 18:02:05,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-15 18:02:05,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 195. [2022-04-15 18:02:05,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:02:05,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:05,466 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:05,467 INFO L87 Difference]: Start difference. First operand 253 states. Second operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:05,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:05,472 INFO L93 Difference]: Finished difference Result 253 states and 464 transitions. [2022-04-15 18:02:05,472 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 464 transitions. [2022-04-15 18:02:05,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:05,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:05,473 INFO L74 IsIncluded]: Start isIncluded. First operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 253 states. [2022-04-15 18:02:05,473 INFO L87 Difference]: Start difference. First operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 253 states. [2022-04-15 18:02:05,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:05,478 INFO L93 Difference]: Finished difference Result 253 states and 464 transitions. [2022-04-15 18:02:05,478 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 464 transitions. [2022-04-15 18:02:05,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:05,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:05,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:02:05,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:02:05,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:05,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 355 transitions. [2022-04-15 18:02:05,482 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 355 transitions. Word has length 27 [2022-04-15 18:02:05,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:02:05,482 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 355 transitions. [2022-04-15 18:02:05,483 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:05,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 195 states and 355 transitions. [2022-04-15 18:02:05,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 355 edges. 355 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:05,758 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 355 transitions. [2022-04-15 18:02:05,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 18:02:05,758 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:02:05,758 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:02:05,758 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 18:02:05,759 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:02:05,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:02:05,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2141269562, now seen corresponding path program 1 times [2022-04-15 18:02:05,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:05,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [285805700] [2022-04-15 18:02:05,759 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:02:05,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2141269562, now seen corresponding path program 2 times [2022-04-15 18:02:05,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:02:05,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478298760] [2022-04-15 18:02:05,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:02:05,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:02:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:05,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:02:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:05,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {4959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4953#true} is VALID [2022-04-15 18:02:05,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {4953#true} assume true; {4953#true} is VALID [2022-04-15 18:02:05,824 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4953#true} {4953#true} #285#return; {4953#true} is VALID [2022-04-15 18:02:05,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {4953#true} call ULTIMATE.init(); {4959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:02:05,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {4959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4953#true} is VALID [2022-04-15 18:02:05,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {4953#true} assume true; {4953#true} is VALID [2022-04-15 18:02:05,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4953#true} {4953#true} #285#return; {4953#true} is VALID [2022-04-15 18:02:05,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {4953#true} call #t~ret20 := main(); {4953#true} is VALID [2022-04-15 18:02:05,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {4953#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {4953#true} is VALID [2022-04-15 18:02:05,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {4953#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {4953#true} is VALID [2022-04-15 18:02:05,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {4953#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {4953#true} is VALID [2022-04-15 18:02:05,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {4953#true} assume !(0 != ~p1~0); {4953#true} is VALID [2022-04-15 18:02:05,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {4953#true} assume !(0 != ~p2~0); {4953#true} is VALID [2022-04-15 18:02:05,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {4953#true} assume 0 != ~p3~0;~lk3~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 18:02:05,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 18:02:05,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 18:02:05,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 18:02:05,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 18:02:05,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 18:02:05,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 18:02:05,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {4958#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 18:02:05,828 INFO L290 TraceCheckUtils]: 18: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 18:02:05,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 18:02:05,830 INFO L290 TraceCheckUtils]: 20: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 18:02:05,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 18:02:05,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 18:02:05,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {4958#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 18:02:05,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {4958#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 18:02:05,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p3~0; {4958#(= main_~lk3~0 1)} is VALID [2022-04-15 18:02:05,832 INFO L290 TraceCheckUtils]: 26: Hoare triple {4958#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {4954#false} is VALID [2022-04-15 18:02:05,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {4954#false} assume !false; {4954#false} is VALID [2022-04-15 18:02:05,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:02:05,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:02:05,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478298760] [2022-04-15 18:02:05,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478298760] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:05,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:05,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:05,833 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:02:05,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [285805700] [2022-04-15 18:02:05,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [285805700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:05,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:05,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:05,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631491380] [2022-04-15 18:02:05,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:02:05,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 18:02:05,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:02:05,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:05,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:05,849 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:02:05,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:05,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:02:05,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:02:05,849 INFO L87 Difference]: Start difference. First operand 195 states and 355 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:06,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:06,075 INFO L93 Difference]: Finished difference Result 371 states and 683 transitions. [2022-04-15 18:02:06,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:02:06,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 18:02:06,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:02:06,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:06,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-15 18:02:06,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:06,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-15 18:02:06,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 183 transitions. [2022-04-15 18:02:06,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:06,224 INFO L225 Difference]: With dead ends: 371 [2022-04-15 18:02:06,224 INFO L226 Difference]: Without dead ends: 369 [2022-04-15 18:02:06,224 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:02:06,225 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 239 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:02:06,225 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 106 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 18:02:06,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-04-15 18:02:06,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 263. [2022-04-15 18:02:06,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:02:06,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 369 states. Second operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:06,242 INFO L74 IsIncluded]: Start isIncluded. First operand 369 states. Second operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:06,242 INFO L87 Difference]: Start difference. First operand 369 states. Second operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:06,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:06,248 INFO L93 Difference]: Finished difference Result 369 states and 678 transitions. [2022-04-15 18:02:06,249 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 678 transitions. [2022-04-15 18:02:06,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:06,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:06,250 INFO L74 IsIncluded]: Start isIncluded. First operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 369 states. [2022-04-15 18:02:06,250 INFO L87 Difference]: Start difference. First operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 369 states. [2022-04-15 18:02:06,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:06,257 INFO L93 Difference]: Finished difference Result 369 states and 678 transitions. [2022-04-15 18:02:06,257 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 678 transitions. [2022-04-15 18:02:06,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:06,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:06,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:02:06,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:02:06,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:06,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 477 transitions. [2022-04-15 18:02:06,264 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 477 transitions. Word has length 28 [2022-04-15 18:02:06,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:02:06,264 INFO L478 AbstractCegarLoop]: Abstraction has 263 states and 477 transitions. [2022-04-15 18:02:06,264 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:06,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 263 states and 477 transitions. [2022-04-15 18:02:06,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 477 edges. 477 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:06,677 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 477 transitions. [2022-04-15 18:02:06,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 18:02:06,677 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:02:06,678 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:02:06,678 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 18:02:06,678 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:02:06,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:02:06,678 INFO L85 PathProgramCache]: Analyzing trace with hash 147124856, now seen corresponding path program 1 times [2022-04-15 18:02:06,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:06,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1435083990] [2022-04-15 18:02:06,679 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:02:06,679 INFO L85 PathProgramCache]: Analyzing trace with hash 147124856, now seen corresponding path program 2 times [2022-04-15 18:02:06,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:02:06,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221101761] [2022-04-15 18:02:06,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:02:06,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:02:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:06,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:02:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:06,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {6977#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {6971#true} is VALID [2022-04-15 18:02:06,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {6971#true} assume true; {6971#true} is VALID [2022-04-15 18:02:06,747 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6971#true} {6971#true} #285#return; {6971#true} is VALID [2022-04-15 18:02:06,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {6971#true} call ULTIMATE.init(); {6977#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:02:06,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {6977#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {6971#true} is VALID [2022-04-15 18:02:06,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {6971#true} assume true; {6971#true} is VALID [2022-04-15 18:02:06,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6971#true} {6971#true} #285#return; {6971#true} is VALID [2022-04-15 18:02:06,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {6971#true} call #t~ret20 := main(); {6971#true} is VALID [2022-04-15 18:02:06,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {6971#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {6971#true} is VALID [2022-04-15 18:02:06,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {6971#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {6971#true} is VALID [2022-04-15 18:02:06,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {6971#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {6971#true} is VALID [2022-04-15 18:02:06,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {6971#true} assume !(0 != ~p1~0); {6971#true} is VALID [2022-04-15 18:02:06,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {6971#true} assume !(0 != ~p2~0); {6971#true} is VALID [2022-04-15 18:02:06,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {6971#true} assume !(0 != ~p3~0); {6976#(= main_~p3~0 0)} is VALID [2022-04-15 18:02:06,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-15 18:02:06,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-15 18:02:06,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-15 18:02:06,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-15 18:02:06,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-15 18:02:06,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-15 18:02:06,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {6976#(= main_~p3~0 0)} assume !(0 != ~p10~0); {6976#(= main_~p3~0 0)} is VALID [2022-04-15 18:02:06,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-15 18:02:06,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-15 18:02:06,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-15 18:02:06,757 INFO L290 TraceCheckUtils]: 21: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-15 18:02:06,758 INFO L290 TraceCheckUtils]: 22: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-15 18:02:06,758 INFO L290 TraceCheckUtils]: 23: Hoare triple {6976#(= main_~p3~0 0)} assume !(0 != ~p1~0); {6976#(= main_~p3~0 0)} is VALID [2022-04-15 18:02:06,758 INFO L290 TraceCheckUtils]: 24: Hoare triple {6976#(= main_~p3~0 0)} assume !(0 != ~p2~0); {6976#(= main_~p3~0 0)} is VALID [2022-04-15 18:02:06,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p3~0; {6972#false} is VALID [2022-04-15 18:02:06,759 INFO L290 TraceCheckUtils]: 26: Hoare triple {6972#false} assume 1 != ~lk3~0; {6972#false} is VALID [2022-04-15 18:02:06,759 INFO L290 TraceCheckUtils]: 27: Hoare triple {6972#false} assume !false; {6972#false} is VALID [2022-04-15 18:02:06,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:02:06,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:02:06,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221101761] [2022-04-15 18:02:06,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221101761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:06,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:06,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:06,760 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:02:06,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1435083990] [2022-04-15 18:02:06,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1435083990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:06,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:06,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:06,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827549891] [2022-04-15 18:02:06,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:02:06,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 18:02:06,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:02:06,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:06,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:06,775 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:02:06,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:06,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:02:06,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:02:06,775 INFO L87 Difference]: Start difference. First operand 263 states and 477 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:07,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:07,032 INFO L93 Difference]: Finished difference Result 631 states and 1155 transitions. [2022-04-15 18:02:07,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:02:07,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 18:02:07,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:02:07,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:07,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 276 transitions. [2022-04-15 18:02:07,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:07,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 276 transitions. [2022-04-15 18:02:07,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 276 transitions. [2022-04-15 18:02:07,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:07,207 INFO L225 Difference]: With dead ends: 631 [2022-04-15 18:02:07,207 INFO L226 Difference]: Without dead ends: 377 [2022-04-15 18:02:07,208 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:02:07,209 INFO L913 BasicCegarLoop]: 132 mSDtfsCounter, 211 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:02:07,209 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 139 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 18:02:07,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-04-15 18:02:07,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2022-04-15 18:02:07,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:02:07,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 377 states. Second operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:07,227 INFO L74 IsIncluded]: Start isIncluded. First operand 377 states. Second operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:07,228 INFO L87 Difference]: Start difference. First operand 377 states. Second operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:07,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:07,234 INFO L93 Difference]: Finished difference Result 377 states and 680 transitions. [2022-04-15 18:02:07,234 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 680 transitions. [2022-04-15 18:02:07,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:07,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:07,236 INFO L74 IsIncluded]: Start isIncluded. First operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 377 states. [2022-04-15 18:02:07,236 INFO L87 Difference]: Start difference. First operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 377 states. [2022-04-15 18:02:07,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:07,243 INFO L93 Difference]: Finished difference Result 377 states and 680 transitions. [2022-04-15 18:02:07,243 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 680 transitions. [2022-04-15 18:02:07,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:07,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:07,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:02:07,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:02:07,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:07,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 679 transitions. [2022-04-15 18:02:07,251 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 679 transitions. Word has length 28 [2022-04-15 18:02:07,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:02:07,251 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 679 transitions. [2022-04-15 18:02:07,251 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:07,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 375 states and 679 transitions. [2022-04-15 18:02:07,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 679 edges. 679 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:07,849 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 679 transitions. [2022-04-15 18:02:07,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 18:02:07,849 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:02:07,849 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:02:07,849 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 18:02:07,850 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:02:07,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:02:07,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1955059427, now seen corresponding path program 1 times [2022-04-15 18:02:07,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:07,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [724742580] [2022-04-15 18:02:07,850 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:02:07,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1955059427, now seen corresponding path program 2 times [2022-04-15 18:02:07,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:02:07,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153368455] [2022-04-15 18:02:07,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:02:07,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:02:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:07,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:02:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:07,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {9755#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {9749#true} is VALID [2022-04-15 18:02:07,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {9749#true} assume true; {9749#true} is VALID [2022-04-15 18:02:07,884 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9749#true} {9749#true} #285#return; {9749#true} is VALID [2022-04-15 18:02:07,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {9749#true} call ULTIMATE.init(); {9755#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:02:07,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {9755#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {9749#true} is VALID [2022-04-15 18:02:07,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {9749#true} assume true; {9749#true} is VALID [2022-04-15 18:02:07,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9749#true} {9749#true} #285#return; {9749#true} is VALID [2022-04-15 18:02:07,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {9749#true} call #t~ret20 := main(); {9749#true} is VALID [2022-04-15 18:02:07,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {9749#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {9749#true} is VALID [2022-04-15 18:02:07,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {9749#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {9749#true} is VALID [2022-04-15 18:02:07,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {9749#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {9749#true} is VALID [2022-04-15 18:02:07,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {9749#true} assume !(0 != ~p1~0); {9749#true} is VALID [2022-04-15 18:02:07,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {9749#true} assume !(0 != ~p2~0); {9749#true} is VALID [2022-04-15 18:02:07,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {9749#true} assume 0 != ~p3~0;~lk3~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 18:02:07,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 18:02:07,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 18:02:07,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 18:02:07,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 18:02:07,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 18:02:07,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 18:02:07,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {9754#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 18:02:07,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 18:02:07,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 18:02:07,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 18:02:07,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 18:02:07,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 18:02:07,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {9754#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 18:02:07,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {9754#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {9754#(not (= main_~p3~0 0))} is VALID [2022-04-15 18:02:07,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {9754#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {9750#false} is VALID [2022-04-15 18:02:07,889 INFO L290 TraceCheckUtils]: 26: Hoare triple {9750#false} assume 0 != ~p4~0; {9750#false} is VALID [2022-04-15 18:02:07,890 INFO L290 TraceCheckUtils]: 27: Hoare triple {9750#false} assume 1 != ~lk4~0; {9750#false} is VALID [2022-04-15 18:02:07,890 INFO L290 TraceCheckUtils]: 28: Hoare triple {9750#false} assume !false; {9750#false} is VALID [2022-04-15 18:02:07,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:02:07,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:02:07,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153368455] [2022-04-15 18:02:07,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153368455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:07,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:07,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:07,890 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:02:07,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [724742580] [2022-04-15 18:02:07,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [724742580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:07,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:07,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:07,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184785491] [2022-04-15 18:02:07,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:02:07,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 18:02:07,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:02:07,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:07,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:07,907 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:02:07,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:07,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:02:07,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:02:07,907 INFO L87 Difference]: Start difference. First operand 375 states and 679 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:08,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:08,166 INFO L93 Difference]: Finished difference Result 565 states and 1021 transitions. [2022-04-15 18:02:08,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:02:08,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 18:02:08,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:02:08,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:08,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 271 transitions. [2022-04-15 18:02:08,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:08,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 271 transitions. [2022-04-15 18:02:08,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 271 transitions. [2022-04-15 18:02:08,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:08,348 INFO L225 Difference]: With dead ends: 565 [2022-04-15 18:02:08,348 INFO L226 Difference]: Without dead ends: 383 [2022-04-15 18:02:08,350 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:02:08,351 INFO L913 BasicCegarLoop]: 150 mSDtfsCounter, 194 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:02:08,351 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 157 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 18:02:08,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-04-15 18:02:08,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 381. [2022-04-15 18:02:08,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:02:08,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 383 states. Second operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:08,384 INFO L74 IsIncluded]: Start isIncluded. First operand 383 states. Second operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:08,385 INFO L87 Difference]: Start difference. First operand 383 states. Second operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:08,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:08,397 INFO L93 Difference]: Finished difference Result 383 states and 684 transitions. [2022-04-15 18:02:08,398 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 684 transitions. [2022-04-15 18:02:08,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:08,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:08,399 INFO L74 IsIncluded]: Start isIncluded. First operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 383 states. [2022-04-15 18:02:08,400 INFO L87 Difference]: Start difference. First operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 383 states. [2022-04-15 18:02:08,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:08,412 INFO L93 Difference]: Finished difference Result 383 states and 684 transitions. [2022-04-15 18:02:08,412 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 684 transitions. [2022-04-15 18:02:08,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:08,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:08,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:02:08,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:02:08,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:08,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 683 transitions. [2022-04-15 18:02:08,424 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 683 transitions. Word has length 29 [2022-04-15 18:02:08,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:02:08,424 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 683 transitions. [2022-04-15 18:02:08,425 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:08,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 381 states and 683 transitions. [2022-04-15 18:02:09,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 683 edges. 683 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:09,019 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 683 transitions. [2022-04-15 18:02:09,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 18:02:09,025 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:02:09,025 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:02:09,025 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 18:02:09,025 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:02:09,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:02:09,027 INFO L85 PathProgramCache]: Analyzing trace with hash 266115685, now seen corresponding path program 1 times [2022-04-15 18:02:09,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:09,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1425237610] [2022-04-15 18:02:09,027 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:02:09,027 INFO L85 PathProgramCache]: Analyzing trace with hash 266115685, now seen corresponding path program 2 times [2022-04-15 18:02:09,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:02:09,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558233079] [2022-04-15 18:02:09,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:02:09,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:02:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:09,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:02:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:09,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {12425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {12419#true} is VALID [2022-04-15 18:02:09,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {12419#true} assume true; {12419#true} is VALID [2022-04-15 18:02:09,058 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12419#true} {12419#true} #285#return; {12419#true} is VALID [2022-04-15 18:02:09,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {12419#true} call ULTIMATE.init(); {12425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:02:09,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {12425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {12419#true} is VALID [2022-04-15 18:02:09,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {12419#true} assume true; {12419#true} is VALID [2022-04-15 18:02:09,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12419#true} {12419#true} #285#return; {12419#true} is VALID [2022-04-15 18:02:09,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {12419#true} call #t~ret20 := main(); {12419#true} is VALID [2022-04-15 18:02:09,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {12419#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {12419#true} is VALID [2022-04-15 18:02:09,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {12419#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {12419#true} is VALID [2022-04-15 18:02:09,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {12419#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {12419#true} is VALID [2022-04-15 18:02:09,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {12419#true} assume !(0 != ~p1~0); {12419#true} is VALID [2022-04-15 18:02:09,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {12419#true} assume !(0 != ~p2~0); {12419#true} is VALID [2022-04-15 18:02:09,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {12419#true} assume !(0 != ~p3~0); {12419#true} is VALID [2022-04-15 18:02:09,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {12419#true} assume 0 != ~p4~0;~lk4~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 18:02:09,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 18:02:09,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 18:02:09,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 18:02:09,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 18:02:09,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 18:02:09,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {12424#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 18:02:09,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 18:02:09,062 INFO L290 TraceCheckUtils]: 19: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 18:02:09,062 INFO L290 TraceCheckUtils]: 20: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 18:02:09,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 18:02:09,063 INFO L290 TraceCheckUtils]: 22: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 18:02:09,063 INFO L290 TraceCheckUtils]: 23: Hoare triple {12424#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 18:02:09,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {12424#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 18:02:09,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {12424#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 18:02:09,064 INFO L290 TraceCheckUtils]: 26: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p4~0; {12424#(= main_~lk4~0 1)} is VALID [2022-04-15 18:02:09,064 INFO L290 TraceCheckUtils]: 27: Hoare triple {12424#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {12420#false} is VALID [2022-04-15 18:02:09,064 INFO L290 TraceCheckUtils]: 28: Hoare triple {12420#false} assume !false; {12420#false} is VALID [2022-04-15 18:02:09,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:02:09,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:02:09,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558233079] [2022-04-15 18:02:09,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558233079] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:09,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:09,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:09,065 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:02:09,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1425237610] [2022-04-15 18:02:09,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1425237610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:09,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:09,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:09,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607904541] [2022-04-15 18:02:09,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:02:09,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 18:02:09,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:02:09,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:09,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:09,081 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:02:09,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:09,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:02:09,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:02:09,082 INFO L87 Difference]: Start difference. First operand 381 states and 683 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:09,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:09,351 INFO L93 Difference]: Finished difference Result 717 states and 1301 transitions. [2022-04-15 18:02:09,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:02:09,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 18:02:09,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:02:09,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:09,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2022-04-15 18:02:09,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:09,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2022-04-15 18:02:09,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 179 transitions. [2022-04-15 18:02:09,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:09,485 INFO L225 Difference]: With dead ends: 717 [2022-04-15 18:02:09,485 INFO L226 Difference]: Without dead ends: 715 [2022-04-15 18:02:09,486 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:02:09,488 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 232 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:02:09,488 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 105 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 18:02:09,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-04-15 18:02:09,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 521. [2022-04-15 18:02:09,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:02:09,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 715 states. Second operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:09,535 INFO L74 IsIncluded]: Start isIncluded. First operand 715 states. Second operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:09,535 INFO L87 Difference]: Start difference. First operand 715 states. Second operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:09,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:09,553 INFO L93 Difference]: Finished difference Result 715 states and 1292 transitions. [2022-04-15 18:02:09,553 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1292 transitions. [2022-04-15 18:02:09,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:09,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:09,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 715 states. [2022-04-15 18:02:09,557 INFO L87 Difference]: Start difference. First operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 715 states. [2022-04-15 18:02:09,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:09,574 INFO L93 Difference]: Finished difference Result 715 states and 1292 transitions. [2022-04-15 18:02:09,574 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1292 transitions. [2022-04-15 18:02:09,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:09,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:09,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:02:09,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:02:09,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:09,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 923 transitions. [2022-04-15 18:02:09,590 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 923 transitions. Word has length 29 [2022-04-15 18:02:09,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:02:09,590 INFO L478 AbstractCegarLoop]: Abstraction has 521 states and 923 transitions. [2022-04-15 18:02:09,590 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:09,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 521 states and 923 transitions. [2022-04-15 18:02:10,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 923 edges. 923 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:10,434 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 923 transitions. [2022-04-15 18:02:10,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 18:02:10,435 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:02:10,435 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:02:10,435 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 18:02:10,435 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:02:10,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:02:10,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1728029021, now seen corresponding path program 1 times [2022-04-15 18:02:10,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:10,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [714077623] [2022-04-15 18:02:10,436 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:02:10,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1728029021, now seen corresponding path program 2 times [2022-04-15 18:02:10,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:02:10,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445604553] [2022-04-15 18:02:10,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:02:10,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:02:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:10,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:02:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:10,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {16343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {16337#true} is VALID [2022-04-15 18:02:10,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {16337#true} assume true; {16337#true} is VALID [2022-04-15 18:02:10,500 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16337#true} {16337#true} #285#return; {16337#true} is VALID [2022-04-15 18:02:10,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {16337#true} call ULTIMATE.init(); {16343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:02:10,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {16343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {16337#true} is VALID [2022-04-15 18:02:10,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {16337#true} assume true; {16337#true} is VALID [2022-04-15 18:02:10,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16337#true} {16337#true} #285#return; {16337#true} is VALID [2022-04-15 18:02:10,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {16337#true} call #t~ret20 := main(); {16337#true} is VALID [2022-04-15 18:02:10,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {16337#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {16337#true} is VALID [2022-04-15 18:02:10,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {16337#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {16337#true} is VALID [2022-04-15 18:02:10,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {16337#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {16337#true} is VALID [2022-04-15 18:02:10,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {16337#true} assume !(0 != ~p1~0); {16337#true} is VALID [2022-04-15 18:02:10,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {16337#true} assume !(0 != ~p2~0); {16337#true} is VALID [2022-04-15 18:02:10,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {16337#true} assume !(0 != ~p3~0); {16337#true} is VALID [2022-04-15 18:02:10,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {16337#true} assume !(0 != ~p4~0); {16342#(= main_~p4~0 0)} is VALID [2022-04-15 18:02:10,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-15 18:02:10,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-15 18:02:10,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-15 18:02:10,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-15 18:02:10,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-15 18:02:10,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {16342#(= main_~p4~0 0)} assume !(0 != ~p10~0); {16342#(= main_~p4~0 0)} is VALID [2022-04-15 18:02:10,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-15 18:02:10,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-15 18:02:10,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-15 18:02:10,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-15 18:02:10,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-15 18:02:10,508 INFO L290 TraceCheckUtils]: 23: Hoare triple {16342#(= main_~p4~0 0)} assume !(0 != ~p1~0); {16342#(= main_~p4~0 0)} is VALID [2022-04-15 18:02:10,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {16342#(= main_~p4~0 0)} assume !(0 != ~p2~0); {16342#(= main_~p4~0 0)} is VALID [2022-04-15 18:02:10,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {16342#(= main_~p4~0 0)} assume !(0 != ~p3~0); {16342#(= main_~p4~0 0)} is VALID [2022-04-15 18:02:10,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p4~0; {16338#false} is VALID [2022-04-15 18:02:10,510 INFO L290 TraceCheckUtils]: 27: Hoare triple {16338#false} assume 1 != ~lk4~0; {16338#false} is VALID [2022-04-15 18:02:10,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {16338#false} assume !false; {16338#false} is VALID [2022-04-15 18:02:10,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:02:10,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:02:10,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445604553] [2022-04-15 18:02:10,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445604553] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:10,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:10,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:10,512 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:02:10,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [714077623] [2022-04-15 18:02:10,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [714077623] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:10,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:10,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:10,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069507531] [2022-04-15 18:02:10,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:02:10,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 18:02:10,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:02:10,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:10,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:10,531 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:02:10,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:10,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:02:10,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:02:10,531 INFO L87 Difference]: Start difference. First operand 521 states and 923 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:10,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:10,835 INFO L93 Difference]: Finished difference Result 1245 states and 2221 transitions. [2022-04-15 18:02:10,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:02:10,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 18:02:10,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:02:10,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:10,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 273 transitions. [2022-04-15 18:02:10,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:10,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 273 transitions. [2022-04-15 18:02:10,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 273 transitions. [2022-04-15 18:02:11,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:11,047 INFO L225 Difference]: With dead ends: 1245 [2022-04-15 18:02:11,048 INFO L226 Difference]: Without dead ends: 739 [2022-04-15 18:02:11,049 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:02:11,049 INFO L913 BasicCegarLoop]: 134 mSDtfsCounter, 205 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:02:11,050 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 141 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 18:02:11,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2022-04-15 18:02:11,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 737. [2022-04-15 18:02:11,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:02:11,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 739 states. Second operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:11,098 INFO L74 IsIncluded]: Start isIncluded. First operand 739 states. Second operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:11,100 INFO L87 Difference]: Start difference. First operand 739 states. Second operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:11,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:11,117 INFO L93 Difference]: Finished difference Result 739 states and 1304 transitions. [2022-04-15 18:02:11,117 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1304 transitions. [2022-04-15 18:02:11,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:11,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:11,121 INFO L74 IsIncluded]: Start isIncluded. First operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 739 states. [2022-04-15 18:02:11,122 INFO L87 Difference]: Start difference. First operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 739 states. [2022-04-15 18:02:11,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:11,140 INFO L93 Difference]: Finished difference Result 739 states and 1304 transitions. [2022-04-15 18:02:11,140 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1304 transitions. [2022-04-15 18:02:11,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:11,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:11,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:02:11,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:02:11,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:11,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1303 transitions. [2022-04-15 18:02:11,165 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1303 transitions. Word has length 29 [2022-04-15 18:02:11,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:02:11,165 INFO L478 AbstractCegarLoop]: Abstraction has 737 states and 1303 transitions. [2022-04-15 18:02:11,165 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:11,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 737 states and 1303 transitions. [2022-04-15 18:02:12,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1303 edges. 1303 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:12,392 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1303 transitions. [2022-04-15 18:02:12,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 18:02:12,392 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:02:12,392 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:02:12,393 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 18:02:12,393 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:02:12,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:02:12,393 INFO L85 PathProgramCache]: Analyzing trace with hash -340135571, now seen corresponding path program 1 times [2022-04-15 18:02:12,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:12,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [204914435] [2022-04-15 18:02:12,393 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:02:12,393 INFO L85 PathProgramCache]: Analyzing trace with hash -340135571, now seen corresponding path program 2 times [2022-04-15 18:02:12,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:02:12,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154061598] [2022-04-15 18:02:12,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:02:12,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:02:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:12,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:02:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:12,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {21797#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {21791#true} is VALID [2022-04-15 18:02:12,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {21791#true} assume true; {21791#true} is VALID [2022-04-15 18:02:12,430 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21791#true} {21791#true} #285#return; {21791#true} is VALID [2022-04-15 18:02:12,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {21791#true} call ULTIMATE.init(); {21797#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:02:12,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {21797#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {21791#true} is VALID [2022-04-15 18:02:12,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {21791#true} assume true; {21791#true} is VALID [2022-04-15 18:02:12,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21791#true} {21791#true} #285#return; {21791#true} is VALID [2022-04-15 18:02:12,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {21791#true} call #t~ret20 := main(); {21791#true} is VALID [2022-04-15 18:02:12,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {21791#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {21791#true} is VALID [2022-04-15 18:02:12,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {21791#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {21791#true} is VALID [2022-04-15 18:02:12,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {21791#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {21791#true} is VALID [2022-04-15 18:02:12,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {21791#true} assume !(0 != ~p1~0); {21791#true} is VALID [2022-04-15 18:02:12,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {21791#true} assume !(0 != ~p2~0); {21791#true} is VALID [2022-04-15 18:02:12,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {21791#true} assume !(0 != ~p3~0); {21791#true} is VALID [2022-04-15 18:02:12,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {21791#true} assume 0 != ~p4~0;~lk4~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 18:02:12,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 18:02:12,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 18:02:12,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 18:02:12,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 18:02:12,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 18:02:12,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {21796#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 18:02:12,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 18:02:12,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 18:02:12,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 18:02:12,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 18:02:12,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 18:02:12,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {21796#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 18:02:12,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {21796#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 18:02:12,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {21796#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {21796#(not (= main_~p4~0 0))} is VALID [2022-04-15 18:02:12,437 INFO L290 TraceCheckUtils]: 26: Hoare triple {21796#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {21792#false} is VALID [2022-04-15 18:02:12,437 INFO L290 TraceCheckUtils]: 27: Hoare triple {21792#false} assume 0 != ~p5~0; {21792#false} is VALID [2022-04-15 18:02:12,437 INFO L290 TraceCheckUtils]: 28: Hoare triple {21792#false} assume 1 != ~lk5~0; {21792#false} is VALID [2022-04-15 18:02:12,437 INFO L290 TraceCheckUtils]: 29: Hoare triple {21792#false} assume !false; {21792#false} is VALID [2022-04-15 18:02:12,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:02:12,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:02:12,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154061598] [2022-04-15 18:02:12,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154061598] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:12,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:12,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:12,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:02:12,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [204914435] [2022-04-15 18:02:12,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [204914435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:12,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:12,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:12,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708681757] [2022-04-15 18:02:12,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:02:12,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 18:02:12,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:02:12,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:12,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:12,457 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:02:12,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:12,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:02:12,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:02:12,458 INFO L87 Difference]: Start difference. First operand 737 states and 1303 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:12,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:12,725 INFO L93 Difference]: Finished difference Result 1105 states and 1949 transitions. [2022-04-15 18:02:12,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:02:12,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 18:02:12,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:02:12,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:12,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 268 transitions. [2022-04-15 18:02:12,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:12,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 268 transitions. [2022-04-15 18:02:12,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 268 transitions. [2022-04-15 18:02:12,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 268 edges. 268 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:12,924 INFO L225 Difference]: With dead ends: 1105 [2022-04-15 18:02:12,924 INFO L226 Difference]: Without dead ends: 747 [2022-04-15 18:02:12,925 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:02:12,925 INFO L913 BasicCegarLoop]: 147 mSDtfsCounter, 193 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:02:12,926 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 154 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:02:12,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-04-15 18:02:12,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 745. [2022-04-15 18:02:12,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:02:12,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 747 states. Second operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:12,968 INFO L74 IsIncluded]: Start isIncluded. First operand 747 states. Second operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:12,968 INFO L87 Difference]: Start difference. First operand 747 states. Second operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:12,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:12,986 INFO L93 Difference]: Finished difference Result 747 states and 1304 transitions. [2022-04-15 18:02:12,986 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1304 transitions. [2022-04-15 18:02:12,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:12,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:12,988 INFO L74 IsIncluded]: Start isIncluded. First operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 747 states. [2022-04-15 18:02:12,989 INFO L87 Difference]: Start difference. First operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 747 states. [2022-04-15 18:02:13,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:13,006 INFO L93 Difference]: Finished difference Result 747 states and 1304 transitions. [2022-04-15 18:02:13,007 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1304 transitions. [2022-04-15 18:02:13,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:13,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:13,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:02:13,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:02:13,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:13,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1303 transitions. [2022-04-15 18:02:13,032 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1303 transitions. Word has length 30 [2022-04-15 18:02:13,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:02:13,032 INFO L478 AbstractCegarLoop]: Abstraction has 745 states and 1303 transitions. [2022-04-15 18:02:13,032 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:13,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 745 states and 1303 transitions. [2022-04-15 18:02:14,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1303 edges. 1303 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:14,237 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1303 transitions. [2022-04-15 18:02:14,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 18:02:14,238 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:02:14,238 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:02:14,238 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 18:02:14,239 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:02:14,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:02:14,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2029079313, now seen corresponding path program 1 times [2022-04-15 18:02:14,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:14,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1434673739] [2022-04-15 18:02:14,239 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:02:14,240 INFO L85 PathProgramCache]: Analyzing trace with hash -2029079313, now seen corresponding path program 2 times [2022-04-15 18:02:14,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:02:14,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484844324] [2022-04-15 18:02:14,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:02:14,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:02:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:14,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:02:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:14,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {27003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {26997#true} is VALID [2022-04-15 18:02:14,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {26997#true} assume true; {26997#true} is VALID [2022-04-15 18:02:14,283 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26997#true} {26997#true} #285#return; {26997#true} is VALID [2022-04-15 18:02:14,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {26997#true} call ULTIMATE.init(); {27003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:02:14,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {27003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {26997#true} is VALID [2022-04-15 18:02:14,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {26997#true} assume true; {26997#true} is VALID [2022-04-15 18:02:14,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26997#true} {26997#true} #285#return; {26997#true} is VALID [2022-04-15 18:02:14,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {26997#true} call #t~ret20 := main(); {26997#true} is VALID [2022-04-15 18:02:14,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {26997#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {26997#true} is VALID [2022-04-15 18:02:14,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {26997#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {26997#true} is VALID [2022-04-15 18:02:14,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {26997#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {26997#true} is VALID [2022-04-15 18:02:14,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {26997#true} assume !(0 != ~p1~0); {26997#true} is VALID [2022-04-15 18:02:14,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {26997#true} assume !(0 != ~p2~0); {26997#true} is VALID [2022-04-15 18:02:14,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {26997#true} assume !(0 != ~p3~0); {26997#true} is VALID [2022-04-15 18:02:14,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {26997#true} assume !(0 != ~p4~0); {26997#true} is VALID [2022-04-15 18:02:14,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {26997#true} assume 0 != ~p5~0;~lk5~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 18:02:14,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 18:02:14,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 18:02:14,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 18:02:14,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 18:02:14,287 INFO L290 TraceCheckUtils]: 17: Hoare triple {27002#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 18:02:14,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 18:02:14,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 18:02:14,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 18:02:14,288 INFO L290 TraceCheckUtils]: 21: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 18:02:14,288 INFO L290 TraceCheckUtils]: 22: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 18:02:14,289 INFO L290 TraceCheckUtils]: 23: Hoare triple {27002#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 18:02:14,289 INFO L290 TraceCheckUtils]: 24: Hoare triple {27002#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 18:02:14,289 INFO L290 TraceCheckUtils]: 25: Hoare triple {27002#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 18:02:14,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {27002#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 18:02:14,290 INFO L290 TraceCheckUtils]: 27: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p5~0; {27002#(= main_~lk5~0 1)} is VALID [2022-04-15 18:02:14,290 INFO L290 TraceCheckUtils]: 28: Hoare triple {27002#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {26998#false} is VALID [2022-04-15 18:02:14,290 INFO L290 TraceCheckUtils]: 29: Hoare triple {26998#false} assume !false; {26998#false} is VALID [2022-04-15 18:02:14,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:02:14,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:02:14,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484844324] [2022-04-15 18:02:14,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484844324] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:14,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:14,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:14,291 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:02:14,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1434673739] [2022-04-15 18:02:14,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1434673739] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:14,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:14,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:14,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383073815] [2022-04-15 18:02:14,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:02:14,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 18:02:14,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:02:14,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:14,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:14,312 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:02:14,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:14,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:02:14,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:02:14,313 INFO L87 Difference]: Start difference. First operand 745 states and 1303 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:14,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:14,688 INFO L93 Difference]: Finished difference Result 1389 states and 2465 transitions. [2022-04-15 18:02:14,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:02:14,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 18:02:14,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:02:14,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:14,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-15 18:02:14,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:14,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-15 18:02:14,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 175 transitions. [2022-04-15 18:02:14,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:14,887 INFO L225 Difference]: With dead ends: 1389 [2022-04-15 18:02:14,887 INFO L226 Difference]: Without dead ends: 1387 [2022-04-15 18:02:14,888 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:02:14,888 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 225 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:02:14,888 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 104 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 18:02:14,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2022-04-15 18:02:14,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1033. [2022-04-15 18:02:14,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:02:14,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1387 states. Second operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:14,945 INFO L74 IsIncluded]: Start isIncluded. First operand 1387 states. Second operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:14,946 INFO L87 Difference]: Start difference. First operand 1387 states. Second operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:14,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:14,997 INFO L93 Difference]: Finished difference Result 1387 states and 2448 transitions. [2022-04-15 18:02:14,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 2448 transitions. [2022-04-15 18:02:14,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:14,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:15,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1387 states. [2022-04-15 18:02:15,002 INFO L87 Difference]: Start difference. First operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1387 states. [2022-04-15 18:02:15,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:15,052 INFO L93 Difference]: Finished difference Result 1387 states and 2448 transitions. [2022-04-15 18:02:15,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 2448 transitions. [2022-04-15 18:02:15,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:15,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:15,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:02:15,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:02:15,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:15,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1775 transitions. [2022-04-15 18:02:15,102 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1775 transitions. Word has length 30 [2022-04-15 18:02:15,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:02:15,102 INFO L478 AbstractCegarLoop]: Abstraction has 1033 states and 1775 transitions. [2022-04-15 18:02:15,102 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:15,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1033 states and 1775 transitions. [2022-04-15 18:02:16,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1775 edges. 1775 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:16,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1775 transitions. [2022-04-15 18:02:16,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 18:02:16,712 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:02:16,713 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:02:16,713 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 18:02:16,713 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:02:16,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:02:16,713 INFO L85 PathProgramCache]: Analyzing trace with hash 271743277, now seen corresponding path program 1 times [2022-04-15 18:02:16,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:16,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [431059640] [2022-04-15 18:02:16,714 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:02:16,714 INFO L85 PathProgramCache]: Analyzing trace with hash 271743277, now seen corresponding path program 2 times [2022-04-15 18:02:16,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:02:16,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184311258] [2022-04-15 18:02:16,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:02:16,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:02:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:16,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:02:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:16,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {34633#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {34627#true} is VALID [2022-04-15 18:02:16,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {34627#true} assume true; {34627#true} is VALID [2022-04-15 18:02:16,756 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34627#true} {34627#true} #285#return; {34627#true} is VALID [2022-04-15 18:02:16,756 INFO L272 TraceCheckUtils]: 0: Hoare triple {34627#true} call ULTIMATE.init(); {34633#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:02:16,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {34633#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {34627#true} is VALID [2022-04-15 18:02:16,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {34627#true} assume true; {34627#true} is VALID [2022-04-15 18:02:16,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34627#true} {34627#true} #285#return; {34627#true} is VALID [2022-04-15 18:02:16,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {34627#true} call #t~ret20 := main(); {34627#true} is VALID [2022-04-15 18:02:16,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {34627#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {34627#true} is VALID [2022-04-15 18:02:16,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {34627#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {34627#true} is VALID [2022-04-15 18:02:16,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {34627#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {34627#true} is VALID [2022-04-15 18:02:16,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {34627#true} assume !(0 != ~p1~0); {34627#true} is VALID [2022-04-15 18:02:16,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {34627#true} assume !(0 != ~p2~0); {34627#true} is VALID [2022-04-15 18:02:16,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {34627#true} assume !(0 != ~p3~0); {34627#true} is VALID [2022-04-15 18:02:16,757 INFO L290 TraceCheckUtils]: 11: Hoare triple {34627#true} assume !(0 != ~p4~0); {34627#true} is VALID [2022-04-15 18:02:16,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {34627#true} assume !(0 != ~p5~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-15 18:02:16,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-15 18:02:16,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-15 18:02:16,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-15 18:02:16,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-15 18:02:16,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {34632#(= main_~p5~0 0)} assume !(0 != ~p10~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-15 18:02:16,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-15 18:02:16,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-15 18:02:16,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-15 18:02:16,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-15 18:02:16,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-15 18:02:16,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {34632#(= main_~p5~0 0)} assume !(0 != ~p1~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-15 18:02:16,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {34632#(= main_~p5~0 0)} assume !(0 != ~p2~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-15 18:02:16,761 INFO L290 TraceCheckUtils]: 25: Hoare triple {34632#(= main_~p5~0 0)} assume !(0 != ~p3~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-15 18:02:16,761 INFO L290 TraceCheckUtils]: 26: Hoare triple {34632#(= main_~p5~0 0)} assume !(0 != ~p4~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-15 18:02:16,761 INFO L290 TraceCheckUtils]: 27: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p5~0; {34628#false} is VALID [2022-04-15 18:02:16,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {34628#false} assume 1 != ~lk5~0; {34628#false} is VALID [2022-04-15 18:02:16,762 INFO L290 TraceCheckUtils]: 29: Hoare triple {34628#false} assume !false; {34628#false} is VALID [2022-04-15 18:02:16,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:02:16,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:02:16,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184311258] [2022-04-15 18:02:16,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184311258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:16,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:16,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:16,762 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:02:16,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [431059640] [2022-04-15 18:02:16,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [431059640] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:16,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:16,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:16,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518781603] [2022-04-15 18:02:16,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:02:16,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 18:02:16,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:02:16,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:16,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:16,779 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:02:16,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:16,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:02:16,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:02:16,779 INFO L87 Difference]: Start difference. First operand 1033 states and 1775 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:17,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:17,443 INFO L93 Difference]: Finished difference Result 2461 states and 4257 transitions. [2022-04-15 18:02:17,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:02:17,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 18:02:17,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:02:17,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:17,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 270 transitions. [2022-04-15 18:02:17,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:17,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 270 transitions. [2022-04-15 18:02:17,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 270 transitions. [2022-04-15 18:02:17,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:17,708 INFO L225 Difference]: With dead ends: 2461 [2022-04-15 18:02:17,708 INFO L226 Difference]: Without dead ends: 1451 [2022-04-15 18:02:17,710 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:02:17,710 INFO L913 BasicCegarLoop]: 136 mSDtfsCounter, 199 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:02:17,710 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 143 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:02:17,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2022-04-15 18:02:17,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1449. [2022-04-15 18:02:17,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:02:17,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1451 states. Second operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:17,797 INFO L74 IsIncluded]: Start isIncluded. First operand 1451 states. Second operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:17,798 INFO L87 Difference]: Start difference. First operand 1451 states. Second operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:17,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:17,853 INFO L93 Difference]: Finished difference Result 1451 states and 2488 transitions. [2022-04-15 18:02:17,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2488 transitions. [2022-04-15 18:02:17,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:17,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:17,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1451 states. [2022-04-15 18:02:17,858 INFO L87 Difference]: Start difference. First operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1451 states. [2022-04-15 18:02:17,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:17,914 INFO L93 Difference]: Finished difference Result 1451 states and 2488 transitions. [2022-04-15 18:02:17,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2488 transitions. [2022-04-15 18:02:17,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:17,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:17,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:02:17,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:02:17,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:18,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2487 transitions. [2022-04-15 18:02:18,010 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2487 transitions. Word has length 30 [2022-04-15 18:02:18,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:02:18,010 INFO L478 AbstractCegarLoop]: Abstraction has 1449 states and 2487 transitions. [2022-04-15 18:02:18,013 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:18,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1449 states and 2487 transitions. [2022-04-15 18:02:20,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2487 edges. 2487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:20,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2487 transitions. [2022-04-15 18:02:20,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 18:02:20,404 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:02:20,404 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:02:20,404 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 18:02:20,404 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:02:20,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:02:20,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1523263864, now seen corresponding path program 1 times [2022-04-15 18:02:20,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:20,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1556336731] [2022-04-15 18:02:20,405 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:02:20,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1523263864, now seen corresponding path program 2 times [2022-04-15 18:02:20,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:02:20,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968130078] [2022-04-15 18:02:20,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:02:20,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:02:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:20,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:02:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:20,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {45367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {45361#true} is VALID [2022-04-15 18:02:20,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {45361#true} assume true; {45361#true} is VALID [2022-04-15 18:02:20,449 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45361#true} {45361#true} #285#return; {45361#true} is VALID [2022-04-15 18:02:20,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {45361#true} call ULTIMATE.init(); {45367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:02:20,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {45367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {45361#true} is VALID [2022-04-15 18:02:20,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {45361#true} assume true; {45361#true} is VALID [2022-04-15 18:02:20,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45361#true} {45361#true} #285#return; {45361#true} is VALID [2022-04-15 18:02:20,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {45361#true} call #t~ret20 := main(); {45361#true} is VALID [2022-04-15 18:02:20,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {45361#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {45361#true} is VALID [2022-04-15 18:02:20,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {45361#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {45361#true} is VALID [2022-04-15 18:02:20,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {45361#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {45361#true} is VALID [2022-04-15 18:02:20,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {45361#true} assume !(0 != ~p1~0); {45361#true} is VALID [2022-04-15 18:02:20,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {45361#true} assume !(0 != ~p2~0); {45361#true} is VALID [2022-04-15 18:02:20,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {45361#true} assume !(0 != ~p3~0); {45361#true} is VALID [2022-04-15 18:02:20,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {45361#true} assume !(0 != ~p4~0); {45361#true} is VALID [2022-04-15 18:02:20,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {45361#true} assume 0 != ~p5~0;~lk5~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:02:20,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:02:20,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:02:20,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:02:20,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:02:20,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:02:20,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:02:20,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:02:20,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:02:20,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:02:20,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:02:20,454 INFO L290 TraceCheckUtils]: 23: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:02:20,454 INFO L290 TraceCheckUtils]: 24: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:02:20,454 INFO L290 TraceCheckUtils]: 25: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:02:20,454 INFO L290 TraceCheckUtils]: 26: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {45366#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:02:20,455 INFO L290 TraceCheckUtils]: 27: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {45362#false} is VALID [2022-04-15 18:02:20,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {45362#false} assume 0 != ~p6~0; {45362#false} is VALID [2022-04-15 18:02:20,455 INFO L290 TraceCheckUtils]: 29: Hoare triple {45362#false} assume 1 != ~lk6~0; {45362#false} is VALID [2022-04-15 18:02:20,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {45362#false} assume !false; {45362#false} is VALID [2022-04-15 18:02:20,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:02:20,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:02:20,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968130078] [2022-04-15 18:02:20,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968130078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:20,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:20,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:20,458 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:02:20,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1556336731] [2022-04-15 18:02:20,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1556336731] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:20,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:20,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:20,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502657492] [2022-04-15 18:02:20,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:02:20,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 18:02:20,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:02:20,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:20,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:20,494 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:02:20,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:20,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:02:20,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:02:20,495 INFO L87 Difference]: Start difference. First operand 1449 states and 2487 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:21,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:21,069 INFO L93 Difference]: Finished difference Result 2173 states and 3721 transitions. [2022-04-15 18:02:21,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:02:21,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 18:02:21,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:02:21,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:21,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 265 transitions. [2022-04-15 18:02:21,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:21,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 265 transitions. [2022-04-15 18:02:21,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 265 transitions. [2022-04-15 18:02:21,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:21,361 INFO L225 Difference]: With dead ends: 2173 [2022-04-15 18:02:21,361 INFO L226 Difference]: Without dead ends: 1467 [2022-04-15 18:02:21,363 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:02:21,363 INFO L913 BasicCegarLoop]: 144 mSDtfsCounter, 192 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:02:21,364 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 151 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 18:02:21,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2022-04-15 18:02:21,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1465. [2022-04-15 18:02:21,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:02:21,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1467 states. Second operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:21,487 INFO L74 IsIncluded]: Start isIncluded. First operand 1467 states. Second operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:21,489 INFO L87 Difference]: Start difference. First operand 1467 states. Second operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:21,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:21,570 INFO L93 Difference]: Finished difference Result 1467 states and 2488 transitions. [2022-04-15 18:02:21,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2488 transitions. [2022-04-15 18:02:21,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:21,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:21,574 INFO L74 IsIncluded]: Start isIncluded. First operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1467 states. [2022-04-15 18:02:21,576 INFO L87 Difference]: Start difference. First operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1467 states. [2022-04-15 18:02:21,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:21,655 INFO L93 Difference]: Finished difference Result 1467 states and 2488 transitions. [2022-04-15 18:02:21,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2488 transitions. [2022-04-15 18:02:21,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:21,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:21,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:02:21,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:02:21,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:21,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 2487 transitions. [2022-04-15 18:02:21,798 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 2487 transitions. Word has length 31 [2022-04-15 18:02:21,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:02:21,799 INFO L478 AbstractCegarLoop]: Abstraction has 1465 states and 2487 transitions. [2022-04-15 18:02:21,799 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:21,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1465 states and 2487 transitions. [2022-04-15 18:02:24,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2487 edges. 2487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:24,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 2487 transitions. [2022-04-15 18:02:24,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 18:02:24,228 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:02:24,228 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:02:24,228 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 18:02:24,229 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:02:24,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:02:24,229 INFO L85 PathProgramCache]: Analyzing trace with hash -165679878, now seen corresponding path program 1 times [2022-04-15 18:02:24,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:24,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [857092603] [2022-04-15 18:02:24,229 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:02:24,230 INFO L85 PathProgramCache]: Analyzing trace with hash -165679878, now seen corresponding path program 2 times [2022-04-15 18:02:24,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:02:24,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024873538] [2022-04-15 18:02:24,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:02:24,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:02:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:24,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:02:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:24,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {55589#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {55583#true} is VALID [2022-04-15 18:02:24,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {55583#true} assume true; {55583#true} is VALID [2022-04-15 18:02:24,271 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55583#true} {55583#true} #285#return; {55583#true} is VALID [2022-04-15 18:02:24,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {55583#true} call ULTIMATE.init(); {55589#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:02:24,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {55589#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {55583#true} is VALID [2022-04-15 18:02:24,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {55583#true} assume true; {55583#true} is VALID [2022-04-15 18:02:24,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55583#true} {55583#true} #285#return; {55583#true} is VALID [2022-04-15 18:02:24,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {55583#true} call #t~ret20 := main(); {55583#true} is VALID [2022-04-15 18:02:24,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {55583#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {55583#true} is VALID [2022-04-15 18:02:24,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {55583#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {55583#true} is VALID [2022-04-15 18:02:24,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {55583#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {55583#true} is VALID [2022-04-15 18:02:24,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {55583#true} assume !(0 != ~p1~0); {55583#true} is VALID [2022-04-15 18:02:24,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {55583#true} assume !(0 != ~p2~0); {55583#true} is VALID [2022-04-15 18:02:24,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {55583#true} assume !(0 != ~p3~0); {55583#true} is VALID [2022-04-15 18:02:24,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {55583#true} assume !(0 != ~p4~0); {55583#true} is VALID [2022-04-15 18:02:24,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {55583#true} assume !(0 != ~p5~0); {55583#true} is VALID [2022-04-15 18:02:24,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {55583#true} assume 0 != ~p6~0;~lk6~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 18:02:24,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 18:02:24,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 18:02:24,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 18:02:24,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 18:02:24,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 18:02:24,274 INFO L290 TraceCheckUtils]: 19: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 18:02:24,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 18:02:24,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 18:02:24,275 INFO L290 TraceCheckUtils]: 22: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 18:02:24,275 INFO L290 TraceCheckUtils]: 23: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 18:02:24,275 INFO L290 TraceCheckUtils]: 24: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 18:02:24,276 INFO L290 TraceCheckUtils]: 25: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 18:02:24,276 INFO L290 TraceCheckUtils]: 26: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 18:02:24,276 INFO L290 TraceCheckUtils]: 27: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 18:02:24,277 INFO L290 TraceCheckUtils]: 28: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p6~0; {55588#(= main_~lk6~0 1)} is VALID [2022-04-15 18:02:24,277 INFO L290 TraceCheckUtils]: 29: Hoare triple {55588#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {55584#false} is VALID [2022-04-15 18:02:24,277 INFO L290 TraceCheckUtils]: 30: Hoare triple {55584#false} assume !false; {55584#false} is VALID [2022-04-15 18:02:24,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:02:24,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:02:24,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024873538] [2022-04-15 18:02:24,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024873538] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:24,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:24,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:24,278 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:02:24,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [857092603] [2022-04-15 18:02:24,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [857092603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:24,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:24,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:24,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726041346] [2022-04-15 18:02:24,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:02:24,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 18:02:24,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:02:24,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:24,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:24,296 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:02:24,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:24,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:02:24,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:02:24,297 INFO L87 Difference]: Start difference. First operand 1465 states and 2487 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:24,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:24,922 INFO L93 Difference]: Finished difference Result 2701 states and 4665 transitions. [2022-04-15 18:02:24,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:02:24,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 18:02:24,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:02:24,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-15 18:02:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-15 18:02:24,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 171 transitions. [2022-04-15 18:02:25,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:25,313 INFO L225 Difference]: With dead ends: 2701 [2022-04-15 18:02:25,314 INFO L226 Difference]: Without dead ends: 2699 [2022-04-15 18:02:25,314 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:02:25,314 INFO L913 BasicCegarLoop]: 96 mSDtfsCounter, 218 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:02:25,315 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 103 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 18:02:25,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2022-04-15 18:02:25,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2057. [2022-04-15 18:02:25,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:02:25,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2699 states. Second operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:25,510 INFO L74 IsIncluded]: Start isIncluded. First operand 2699 states. Second operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:25,512 INFO L87 Difference]: Start difference. First operand 2699 states. Second operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:25,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:25,694 INFO L93 Difference]: Finished difference Result 2699 states and 4632 transitions. [2022-04-15 18:02:25,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4632 transitions. [2022-04-15 18:02:25,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:25,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:25,700 INFO L74 IsIncluded]: Start isIncluded. First operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2699 states. [2022-04-15 18:02:25,701 INFO L87 Difference]: Start difference. First operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2699 states. [2022-04-15 18:02:25,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:25,886 INFO L93 Difference]: Finished difference Result 2699 states and 4632 transitions. [2022-04-15 18:02:25,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4632 transitions. [2022-04-15 18:02:25,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:25,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:25,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:02:25,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:02:25,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:26,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 3415 transitions. [2022-04-15 18:02:26,095 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 3415 transitions. Word has length 31 [2022-04-15 18:02:26,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:02:26,096 INFO L478 AbstractCegarLoop]: Abstraction has 2057 states and 3415 transitions. [2022-04-15 18:02:26,096 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:26,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2057 states and 3415 transitions. [2022-04-15 18:02:29,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3415 edges. 3415 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:29,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 3415 transitions. [2022-04-15 18:02:29,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 18:02:29,500 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:02:29,500 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:02:29,500 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 18:02:29,501 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:02:29,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:02:29,501 INFO L85 PathProgramCache]: Analyzing trace with hash 2135142712, now seen corresponding path program 1 times [2022-04-15 18:02:29,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:29,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1167163832] [2022-04-15 18:02:29,501 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:02:29,502 INFO L85 PathProgramCache]: Analyzing trace with hash 2135142712, now seen corresponding path program 2 times [2022-04-15 18:02:29,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:02:29,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201986455] [2022-04-15 18:02:29,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:02:29,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:02:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:29,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:02:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:29,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {70515#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {70509#true} is VALID [2022-04-15 18:02:29,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {70509#true} assume true; {70509#true} is VALID [2022-04-15 18:02:29,555 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70509#true} {70509#true} #285#return; {70509#true} is VALID [2022-04-15 18:02:29,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {70509#true} call ULTIMATE.init(); {70515#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:02:29,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {70515#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {70509#true} is VALID [2022-04-15 18:02:29,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {70509#true} assume true; {70509#true} is VALID [2022-04-15 18:02:29,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70509#true} {70509#true} #285#return; {70509#true} is VALID [2022-04-15 18:02:29,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {70509#true} call #t~ret20 := main(); {70509#true} is VALID [2022-04-15 18:02:29,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {70509#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {70509#true} is VALID [2022-04-15 18:02:29,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {70509#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {70509#true} is VALID [2022-04-15 18:02:29,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {70509#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {70509#true} is VALID [2022-04-15 18:02:29,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {70509#true} assume !(0 != ~p1~0); {70509#true} is VALID [2022-04-15 18:02:29,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {70509#true} assume !(0 != ~p2~0); {70509#true} is VALID [2022-04-15 18:02:29,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {70509#true} assume !(0 != ~p3~0); {70509#true} is VALID [2022-04-15 18:02:29,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {70509#true} assume !(0 != ~p4~0); {70509#true} is VALID [2022-04-15 18:02:29,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {70509#true} assume !(0 != ~p5~0); {70509#true} is VALID [2022-04-15 18:02:29,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {70509#true} assume !(0 != ~p6~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-15 18:02:29,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-15 18:02:29,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-15 18:02:29,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-15 18:02:29,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p10~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-15 18:02:29,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-15 18:02:29,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-15 18:02:29,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-15 18:02:29,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-15 18:02:29,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-15 18:02:29,560 INFO L290 TraceCheckUtils]: 23: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p1~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-15 18:02:29,560 INFO L290 TraceCheckUtils]: 24: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p2~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-15 18:02:29,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p3~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-15 18:02:29,561 INFO L290 TraceCheckUtils]: 26: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p4~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-15 18:02:29,561 INFO L290 TraceCheckUtils]: 27: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p5~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-15 18:02:29,561 INFO L290 TraceCheckUtils]: 28: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p6~0; {70510#false} is VALID [2022-04-15 18:02:29,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {70510#false} assume 1 != ~lk6~0; {70510#false} is VALID [2022-04-15 18:02:29,561 INFO L290 TraceCheckUtils]: 30: Hoare triple {70510#false} assume !false; {70510#false} is VALID [2022-04-15 18:02:29,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:02:29,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:02:29,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201986455] [2022-04-15 18:02:29,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201986455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:29,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:29,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:29,567 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:02:29,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1167163832] [2022-04-15 18:02:29,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1167163832] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:29,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:29,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:29,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952429792] [2022-04-15 18:02:29,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:02:29,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 18:02:29,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:02:29,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:29,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:29,584 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:02:29,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:29,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:02:29,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:02:29,584 INFO L87 Difference]: Start difference. First operand 2057 states and 3415 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:31,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:31,071 INFO L93 Difference]: Finished difference Result 4877 states and 8153 transitions. [2022-04-15 18:02:31,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:02:31,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 18:02:31,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:02:31,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:31,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 267 transitions. [2022-04-15 18:02:31,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:31,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 267 transitions. [2022-04-15 18:02:31,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 267 transitions. [2022-04-15 18:02:31,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:31,546 INFO L225 Difference]: With dead ends: 4877 [2022-04-15 18:02:31,546 INFO L226 Difference]: Without dead ends: 2859 [2022-04-15 18:02:31,549 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:02:31,550 INFO L913 BasicCegarLoop]: 138 mSDtfsCounter, 193 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:02:31,550 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 145 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 18:02:31,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2022-04-15 18:02:31,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2857. [2022-04-15 18:02:31,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:02:31,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2859 states. Second operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:31,766 INFO L74 IsIncluded]: Start isIncluded. First operand 2859 states. Second operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:31,769 INFO L87 Difference]: Start difference. First operand 2859 states. Second operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:31,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:31,971 INFO L93 Difference]: Finished difference Result 2859 states and 4744 transitions. [2022-04-15 18:02:31,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 4744 transitions. [2022-04-15 18:02:31,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:31,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:31,977 INFO L74 IsIncluded]: Start isIncluded. First operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2859 states. [2022-04-15 18:02:31,980 INFO L87 Difference]: Start difference. First operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2859 states. [2022-04-15 18:02:32,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:32,188 INFO L93 Difference]: Finished difference Result 2859 states and 4744 transitions. [2022-04-15 18:02:32,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 4744 transitions. [2022-04-15 18:02:32,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:32,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:32,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:02:32,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:02:32,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:32,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2857 states and 4743 transitions. [2022-04-15 18:02:32,562 INFO L78 Accepts]: Start accepts. Automaton has 2857 states and 4743 transitions. Word has length 31 [2022-04-15 18:02:32,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:02:32,562 INFO L478 AbstractCegarLoop]: Abstraction has 2857 states and 4743 transitions. [2022-04-15 18:02:32,562 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:32,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2857 states and 4743 transitions. [2022-04-15 18:02:37,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4743 edges. 4743 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:37,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 4743 transitions. [2022-04-15 18:02:37,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 18:02:37,453 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:02:37,453 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:02:37,453 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 18:02:37,453 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:02:37,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:02:37,454 INFO L85 PathProgramCache]: Analyzing trace with hash -840895454, now seen corresponding path program 1 times [2022-04-15 18:02:37,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:37,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1996073117] [2022-04-15 18:02:37,454 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:02:37,454 INFO L85 PathProgramCache]: Analyzing trace with hash -840895454, now seen corresponding path program 2 times [2022-04-15 18:02:37,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:02:37,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688987862] [2022-04-15 18:02:37,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:02:37,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:02:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:37,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:02:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:37,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {91713#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {91707#true} is VALID [2022-04-15 18:02:37,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {91707#true} assume true; {91707#true} is VALID [2022-04-15 18:02:37,498 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {91707#true} {91707#true} #285#return; {91707#true} is VALID [2022-04-15 18:02:37,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {91707#true} call ULTIMATE.init(); {91713#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:02:37,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {91713#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {91707#true} is VALID [2022-04-15 18:02:37,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {91707#true} assume true; {91707#true} is VALID [2022-04-15 18:02:37,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91707#true} {91707#true} #285#return; {91707#true} is VALID [2022-04-15 18:02:37,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {91707#true} call #t~ret20 := main(); {91707#true} is VALID [2022-04-15 18:02:37,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {91707#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {91707#true} is VALID [2022-04-15 18:02:37,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {91707#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {91707#true} is VALID [2022-04-15 18:02:37,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {91707#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {91707#true} is VALID [2022-04-15 18:02:37,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {91707#true} assume !(0 != ~p1~0); {91707#true} is VALID [2022-04-15 18:02:37,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {91707#true} assume !(0 != ~p2~0); {91707#true} is VALID [2022-04-15 18:02:37,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {91707#true} assume !(0 != ~p3~0); {91707#true} is VALID [2022-04-15 18:02:37,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {91707#true} assume !(0 != ~p4~0); {91707#true} is VALID [2022-04-15 18:02:37,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {91707#true} assume !(0 != ~p5~0); {91707#true} is VALID [2022-04-15 18:02:37,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {91707#true} assume 0 != ~p6~0;~lk6~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 18:02:37,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 18:02:37,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 18:02:37,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 18:02:37,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 18:02:37,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 18:02:37,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 18:02:37,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 18:02:37,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 18:02:37,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 18:02:37,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 18:02:37,503 INFO L290 TraceCheckUtils]: 24: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 18:02:37,503 INFO L290 TraceCheckUtils]: 25: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 18:02:37,517 INFO L290 TraceCheckUtils]: 26: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 18:02:37,517 INFO L290 TraceCheckUtils]: 27: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-15 18:02:37,518 INFO L290 TraceCheckUtils]: 28: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {91708#false} is VALID [2022-04-15 18:02:37,518 INFO L290 TraceCheckUtils]: 29: Hoare triple {91708#false} assume 0 != ~p7~0; {91708#false} is VALID [2022-04-15 18:02:37,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {91708#false} assume 1 != ~lk7~0; {91708#false} is VALID [2022-04-15 18:02:37,518 INFO L290 TraceCheckUtils]: 31: Hoare triple {91708#false} assume !false; {91708#false} is VALID [2022-04-15 18:02:37,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:02:37,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:02:37,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688987862] [2022-04-15 18:02:37,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688987862] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:37,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:37,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:37,519 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:02:37,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1996073117] [2022-04-15 18:02:37,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1996073117] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:37,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:37,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:37,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129921742] [2022-04-15 18:02:37,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:02:37,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 18:02:37,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:02:37,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:37,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:37,534 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:02:37,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:37,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:02:37,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:02:37,535 INFO L87 Difference]: Start difference. First operand 2857 states and 4743 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:38,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:38,667 INFO L93 Difference]: Finished difference Result 4285 states and 7097 transitions. [2022-04-15 18:02:38,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:02:38,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 18:02:38,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:02:38,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:38,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2022-04-15 18:02:38,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:38,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2022-04-15 18:02:38,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 262 transitions. [2022-04-15 18:02:38,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:39,271 INFO L225 Difference]: With dead ends: 4285 [2022-04-15 18:02:39,271 INFO L226 Difference]: Without dead ends: 2891 [2022-04-15 18:02:39,274 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:02:39,275 INFO L913 BasicCegarLoop]: 141 mSDtfsCounter, 191 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:02:39,275 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 148 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:02:39,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2022-04-15 18:02:39,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 2889. [2022-04-15 18:02:39,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:02:39,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2891 states. Second operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:39,540 INFO L74 IsIncluded]: Start isIncluded. First operand 2891 states. Second operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:39,542 INFO L87 Difference]: Start difference. First operand 2891 states. Second operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:39,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:39,749 INFO L93 Difference]: Finished difference Result 2891 states and 4744 transitions. [2022-04-15 18:02:39,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 4744 transitions. [2022-04-15 18:02:39,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:39,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:39,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2891 states. [2022-04-15 18:02:39,758 INFO L87 Difference]: Start difference. First operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2891 states. [2022-04-15 18:02:39,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:39,971 INFO L93 Difference]: Finished difference Result 2891 states and 4744 transitions. [2022-04-15 18:02:39,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 4744 transitions. [2022-04-15 18:02:39,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:39,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:39,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:02:39,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:02:39,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:40,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 4743 transitions. [2022-04-15 18:02:40,363 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 4743 transitions. Word has length 32 [2022-04-15 18:02:40,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:02:40,363 INFO L478 AbstractCegarLoop]: Abstraction has 2889 states and 4743 transitions. [2022-04-15 18:02:40,364 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:40,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2889 states and 4743 transitions. [2022-04-15 18:02:45,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4743 edges. 4743 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:45,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 4743 transitions. [2022-04-15 18:02:45,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 18:02:45,306 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:02:45,306 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:02:45,306 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 18:02:45,306 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:02:45,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:02:45,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1765128100, now seen corresponding path program 1 times [2022-04-15 18:02:45,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:45,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [159004734] [2022-04-15 18:02:45,307 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:02:45,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1765128100, now seen corresponding path program 2 times [2022-04-15 18:02:45,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:02:45,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845813700] [2022-04-15 18:02:45,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:02:45,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:02:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:45,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:02:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:45,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {111855#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {111849#true} is VALID [2022-04-15 18:02:45,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {111849#true} assume true; {111849#true} is VALID [2022-04-15 18:02:45,372 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {111849#true} {111849#true} #285#return; {111849#true} is VALID [2022-04-15 18:02:45,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {111849#true} call ULTIMATE.init(); {111855#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:02:45,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {111855#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {111849#true} is VALID [2022-04-15 18:02:45,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {111849#true} assume true; {111849#true} is VALID [2022-04-15 18:02:45,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111849#true} {111849#true} #285#return; {111849#true} is VALID [2022-04-15 18:02:45,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {111849#true} call #t~ret20 := main(); {111849#true} is VALID [2022-04-15 18:02:45,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {111849#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {111849#true} is VALID [2022-04-15 18:02:45,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {111849#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {111849#true} is VALID [2022-04-15 18:02:45,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {111849#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {111849#true} is VALID [2022-04-15 18:02:45,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {111849#true} assume !(0 != ~p1~0); {111849#true} is VALID [2022-04-15 18:02:45,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {111849#true} assume !(0 != ~p2~0); {111849#true} is VALID [2022-04-15 18:02:45,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {111849#true} assume !(0 != ~p3~0); {111849#true} is VALID [2022-04-15 18:02:45,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {111849#true} assume !(0 != ~p4~0); {111849#true} is VALID [2022-04-15 18:02:45,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {111849#true} assume !(0 != ~p5~0); {111849#true} is VALID [2022-04-15 18:02:45,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {111849#true} assume !(0 != ~p6~0); {111849#true} is VALID [2022-04-15 18:02:45,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {111849#true} assume 0 != ~p7~0;~lk7~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 18:02:45,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 18:02:45,375 INFO L290 TraceCheckUtils]: 16: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 18:02:45,375 INFO L290 TraceCheckUtils]: 17: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 18:02:45,375 INFO L290 TraceCheckUtils]: 18: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 18:02:45,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 18:02:45,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 18:02:45,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 18:02:45,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 18:02:45,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 18:02:45,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 18:02:45,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 18:02:45,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 18:02:45,378 INFO L290 TraceCheckUtils]: 27: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 18:02:45,378 INFO L290 TraceCheckUtils]: 28: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 18:02:45,379 INFO L290 TraceCheckUtils]: 29: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p7~0; {111854#(= main_~lk7~0 1)} is VALID [2022-04-15 18:02:45,379 INFO L290 TraceCheckUtils]: 30: Hoare triple {111854#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {111850#false} is VALID [2022-04-15 18:02:45,379 INFO L290 TraceCheckUtils]: 31: Hoare triple {111850#false} assume !false; {111850#false} is VALID [2022-04-15 18:02:45,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:02:45,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:02:45,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845813700] [2022-04-15 18:02:45,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845813700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:45,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:45,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:45,381 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:02:45,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [159004734] [2022-04-15 18:02:45,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [159004734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:45,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:45,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:45,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034642433] [2022-04-15 18:02:45,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:02:45,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 18:02:45,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:02:45,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:45,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:45,400 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:02:45,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:45,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:02:45,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:02:45,402 INFO L87 Difference]: Start difference. First operand 2889 states and 4743 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:47,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:47,088 INFO L93 Difference]: Finished difference Result 5261 states and 8809 transitions. [2022-04-15 18:02:47,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:02:47,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 18:02:47,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:02:47,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:47,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2022-04-15 18:02:47,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:47,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2022-04-15 18:02:47,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 167 transitions. [2022-04-15 18:02:47,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:48,291 INFO L225 Difference]: With dead ends: 5261 [2022-04-15 18:02:48,291 INFO L226 Difference]: Without dead ends: 5259 [2022-04-15 18:02:48,292 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:02:48,292 INFO L913 BasicCegarLoop]: 95 mSDtfsCounter, 211 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:02:48,293 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 102 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 18:02:48,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2022-04-15 18:02:48,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 4105. [2022-04-15 18:02:48,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:02:48,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5259 states. Second operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:48,575 INFO L74 IsIncluded]: Start isIncluded. First operand 5259 states. Second operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:48,578 INFO L87 Difference]: Start difference. First operand 5259 states. Second operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:49,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:49,281 INFO L93 Difference]: Finished difference Result 5259 states and 8744 transitions. [2022-04-15 18:02:49,281 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 8744 transitions. [2022-04-15 18:02:49,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:49,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:49,291 INFO L74 IsIncluded]: Start isIncluded. First operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5259 states. [2022-04-15 18:02:49,293 INFO L87 Difference]: Start difference. First operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5259 states. [2022-04-15 18:02:50,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:50,041 INFO L93 Difference]: Finished difference Result 5259 states and 8744 transitions. [2022-04-15 18:02:50,041 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 8744 transitions. [2022-04-15 18:02:50,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:50,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:50,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:02:50,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:02:50,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:50,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4105 states to 4105 states and 6567 transitions. [2022-04-15 18:02:50,815 INFO L78 Accepts]: Start accepts. Automaton has 4105 states and 6567 transitions. Word has length 32 [2022-04-15 18:02:50,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:02:50,815 INFO L478 AbstractCegarLoop]: Abstraction has 4105 states and 6567 transitions. [2022-04-15 18:02:50,815 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:50,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4105 states and 6567 transitions. [2022-04-15 18:02:57,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6567 edges. 6567 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:57,671 INFO L276 IsEmpty]: Start isEmpty. Operand 4105 states and 6567 transitions. [2022-04-15 18:02:57,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 18:02:57,683 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:02:57,683 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:02:57,683 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 18:02:57,683 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:02:57,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:02:57,684 INFO L85 PathProgramCache]: Analyzing trace with hash -229016606, now seen corresponding path program 1 times [2022-04-15 18:02:57,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:57,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [332438393] [2022-04-15 18:02:57,684 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:02:57,684 INFO L85 PathProgramCache]: Analyzing trace with hash -229016606, now seen corresponding path program 2 times [2022-04-15 18:02:57,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:02:57,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131384354] [2022-04-15 18:02:57,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:02:57,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:02:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:57,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:02:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:57,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {141117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {141111#true} is VALID [2022-04-15 18:02:57,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {141111#true} assume true; {141111#true} is VALID [2022-04-15 18:02:57,724 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141111#true} {141111#true} #285#return; {141111#true} is VALID [2022-04-15 18:02:57,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {141111#true} call ULTIMATE.init(); {141117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:02:57,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {141117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {141111#true} is VALID [2022-04-15 18:02:57,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {141111#true} assume true; {141111#true} is VALID [2022-04-15 18:02:57,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141111#true} {141111#true} #285#return; {141111#true} is VALID [2022-04-15 18:02:57,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {141111#true} call #t~ret20 := main(); {141111#true} is VALID [2022-04-15 18:02:57,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {141111#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {141111#true} is VALID [2022-04-15 18:02:57,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {141111#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {141111#true} is VALID [2022-04-15 18:02:57,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {141111#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {141111#true} is VALID [2022-04-15 18:02:57,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {141111#true} assume !(0 != ~p1~0); {141111#true} is VALID [2022-04-15 18:02:57,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {141111#true} assume !(0 != ~p2~0); {141111#true} is VALID [2022-04-15 18:02:57,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {141111#true} assume !(0 != ~p3~0); {141111#true} is VALID [2022-04-15 18:02:57,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {141111#true} assume !(0 != ~p4~0); {141111#true} is VALID [2022-04-15 18:02:57,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {141111#true} assume !(0 != ~p5~0); {141111#true} is VALID [2022-04-15 18:02:57,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {141111#true} assume !(0 != ~p6~0); {141111#true} is VALID [2022-04-15 18:02:57,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {141111#true} assume !(0 != ~p7~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-15 18:02:57,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-15 18:02:57,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-15 18:02:57,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p10~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-15 18:02:57,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-15 18:02:57,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-15 18:02:57,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-15 18:02:57,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-15 18:02:57,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-15 18:02:57,730 INFO L290 TraceCheckUtils]: 23: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p1~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-15 18:02:57,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p2~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-15 18:02:57,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p3~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-15 18:02:57,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p4~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-15 18:02:57,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p5~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-15 18:02:57,731 INFO L290 TraceCheckUtils]: 28: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p6~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-15 18:02:57,732 INFO L290 TraceCheckUtils]: 29: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p7~0; {141112#false} is VALID [2022-04-15 18:02:57,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {141112#false} assume 1 != ~lk7~0; {141112#false} is VALID [2022-04-15 18:02:57,732 INFO L290 TraceCheckUtils]: 31: Hoare triple {141112#false} assume !false; {141112#false} is VALID [2022-04-15 18:02:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:02:57,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:02:57,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131384354] [2022-04-15 18:02:57,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131384354] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:57,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:57,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:57,733 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:02:57,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [332438393] [2022-04-15 18:02:57,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [332438393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:57,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:57,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:57,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111760874] [2022-04-15 18:02:57,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:02:57,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 18:02:57,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:02:57,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:57,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:57,754 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:02:57,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:57,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:02:57,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:02:57,755 INFO L87 Difference]: Start difference. First operand 4105 states and 6567 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:02,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:02,926 INFO L93 Difference]: Finished difference Result 9677 states and 15593 transitions. [2022-04-15 18:03:02,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:03:02,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 18:03:02,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:03:02,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2022-04-15 18:03:02,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:02,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2022-04-15 18:03:02,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 264 transitions. [2022-04-15 18:03:03,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:04,440 INFO L225 Difference]: With dead ends: 9677 [2022-04-15 18:03:04,440 INFO L226 Difference]: Without dead ends: 5643 [2022-04-15 18:03:04,446 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:03:04,446 INFO L913 BasicCegarLoop]: 140 mSDtfsCounter, 187 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:03:04,447 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 147 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 18:03:04,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2022-04-15 18:03:04,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5641. [2022-04-15 18:03:04,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:03:04,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5643 states. Second operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:04,876 INFO L74 IsIncluded]: Start isIncluded. First operand 5643 states. Second operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:04,880 INFO L87 Difference]: Start difference. First operand 5643 states. Second operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:05,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:05,666 INFO L93 Difference]: Finished difference Result 5643 states and 9032 transitions. [2022-04-15 18:03:05,666 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 9032 transitions. [2022-04-15 18:03:05,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:05,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:05,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5643 states. [2022-04-15 18:03:05,680 INFO L87 Difference]: Start difference. First operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5643 states. [2022-04-15 18:03:06,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:06,518 INFO L93 Difference]: Finished difference Result 5643 states and 9032 transitions. [2022-04-15 18:03:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 9032 transitions. [2022-04-15 18:03:06,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:06,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:06,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:03:06,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:03:06,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:07,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5641 states to 5641 states and 9031 transitions. [2022-04-15 18:03:07,853 INFO L78 Accepts]: Start accepts. Automaton has 5641 states and 9031 transitions. Word has length 32 [2022-04-15 18:03:07,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:03:07,853 INFO L478 AbstractCegarLoop]: Abstraction has 5641 states and 9031 transitions. [2022-04-15 18:03:07,853 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:07,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5641 states and 9031 transitions. [2022-04-15 18:03:17,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9031 edges. 9031 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:17,840 INFO L276 IsEmpty]: Start isEmpty. Operand 5641 states and 9031 transitions. [2022-04-15 18:03:17,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 18:03:17,843 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:03:17,843 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:03:17,843 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 18:03:17,844 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:03:17,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:03:17,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1115389939, now seen corresponding path program 1 times [2022-04-15 18:03:17,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:17,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1486851287] [2022-04-15 18:03:17,844 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:03:17,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1115389939, now seen corresponding path program 2 times [2022-04-15 18:03:17,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:03:17,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225530254] [2022-04-15 18:03:17,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:03:17,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:03:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:17,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:03:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:17,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {183051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {183045#true} is VALID [2022-04-15 18:03:17,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {183045#true} assume true; {183045#true} is VALID [2022-04-15 18:03:17,878 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {183045#true} {183045#true} #285#return; {183045#true} is VALID [2022-04-15 18:03:17,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {183045#true} call ULTIMATE.init(); {183051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:03:17,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {183051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {183045#true} is VALID [2022-04-15 18:03:17,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {183045#true} assume true; {183045#true} is VALID [2022-04-15 18:03:17,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183045#true} {183045#true} #285#return; {183045#true} is VALID [2022-04-15 18:03:17,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {183045#true} call #t~ret20 := main(); {183045#true} is VALID [2022-04-15 18:03:17,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {183045#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {183045#true} is VALID [2022-04-15 18:03:17,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {183045#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {183045#true} is VALID [2022-04-15 18:03:17,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {183045#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {183045#true} is VALID [2022-04-15 18:03:17,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {183045#true} assume !(0 != ~p1~0); {183045#true} is VALID [2022-04-15 18:03:17,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {183045#true} assume !(0 != ~p2~0); {183045#true} is VALID [2022-04-15 18:03:17,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {183045#true} assume !(0 != ~p3~0); {183045#true} is VALID [2022-04-15 18:03:17,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {183045#true} assume !(0 != ~p4~0); {183045#true} is VALID [2022-04-15 18:03:17,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {183045#true} assume !(0 != ~p5~0); {183045#true} is VALID [2022-04-15 18:03:17,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {183045#true} assume !(0 != ~p6~0); {183045#true} is VALID [2022-04-15 18:03:17,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {183045#true} assume 0 != ~p7~0;~lk7~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 18:03:17,888 INFO L290 TraceCheckUtils]: 15: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 18:03:17,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 18:03:17,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 18:03:17,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 18:03:17,889 INFO L290 TraceCheckUtils]: 19: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 18:03:17,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 18:03:17,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 18:03:17,890 INFO L290 TraceCheckUtils]: 22: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 18:03:17,890 INFO L290 TraceCheckUtils]: 23: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 18:03:17,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 18:03:17,891 INFO L290 TraceCheckUtils]: 25: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 18:03:17,892 INFO L290 TraceCheckUtils]: 26: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 18:03:17,892 INFO L290 TraceCheckUtils]: 27: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 18:03:17,892 INFO L290 TraceCheckUtils]: 28: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-15 18:03:17,892 INFO L290 TraceCheckUtils]: 29: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {183046#false} is VALID [2022-04-15 18:03:17,893 INFO L290 TraceCheckUtils]: 30: Hoare triple {183046#false} assume 0 != ~p8~0; {183046#false} is VALID [2022-04-15 18:03:17,893 INFO L290 TraceCheckUtils]: 31: Hoare triple {183046#false} assume 1 != ~lk8~0; {183046#false} is VALID [2022-04-15 18:03:17,893 INFO L290 TraceCheckUtils]: 32: Hoare triple {183046#false} assume !false; {183046#false} is VALID [2022-04-15 18:03:17,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:03:17,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:03:17,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225530254] [2022-04-15 18:03:17,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225530254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:17,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:17,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:17,894 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:03:17,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1486851287] [2022-04-15 18:03:17,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1486851287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:17,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:17,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:17,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117435518] [2022-04-15 18:03:17,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:03:17,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 18:03:17,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:03:17,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:17,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:17,915 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:03:17,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:17,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:03:17,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:03:17,915 INFO L87 Difference]: Start difference. First operand 5641 states and 9031 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:22,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:22,331 INFO L93 Difference]: Finished difference Result 8461 states and 13513 transitions. [2022-04-15 18:03:22,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:03:22,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 18:03:22,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:03:22,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:22,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2022-04-15 18:03:22,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:22,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2022-04-15 18:03:22,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 259 transitions. [2022-04-15 18:03:22,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:23,730 INFO L225 Difference]: With dead ends: 8461 [2022-04-15 18:03:23,731 INFO L226 Difference]: Without dead ends: 5707 [2022-04-15 18:03:23,734 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:03:23,734 INFO L913 BasicCegarLoop]: 138 mSDtfsCounter, 190 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:03:23,734 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 145 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:03:23,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5707 states. [2022-04-15 18:03:24,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5707 to 5705. [2022-04-15 18:03:24,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:03:24,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5707 states. Second operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:24,192 INFO L74 IsIncluded]: Start isIncluded. First operand 5707 states. Second operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:24,201 INFO L87 Difference]: Start difference. First operand 5707 states. Second operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:25,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:25,028 INFO L93 Difference]: Finished difference Result 5707 states and 9032 transitions. [2022-04-15 18:03:25,028 INFO L276 IsEmpty]: Start isEmpty. Operand 5707 states and 9032 transitions. [2022-04-15 18:03:25,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:25,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:25,040 INFO L74 IsIncluded]: Start isIncluded. First operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5707 states. [2022-04-15 18:03:25,048 INFO L87 Difference]: Start difference. First operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5707 states. [2022-04-15 18:03:25,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:25,919 INFO L93 Difference]: Finished difference Result 5707 states and 9032 transitions. [2022-04-15 18:03:25,919 INFO L276 IsEmpty]: Start isEmpty. Operand 5707 states and 9032 transitions. [2022-04-15 18:03:25,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:25,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:25,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:03:25,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:03:25,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:27,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5705 states to 5705 states and 9031 transitions. [2022-04-15 18:03:27,381 INFO L78 Accepts]: Start accepts. Automaton has 5705 states and 9031 transitions. Word has length 33 [2022-04-15 18:03:27,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:03:27,381 INFO L478 AbstractCegarLoop]: Abstraction has 5705 states and 9031 transitions. [2022-04-15 18:03:27,381 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:27,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5705 states and 9031 transitions. [2022-04-15 18:03:37,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9031 edges. 9031 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:37,217 INFO L276 IsEmpty]: Start isEmpty. Operand 5705 states and 9031 transitions. [2022-04-15 18:03:37,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 18:03:37,220 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:03:37,220 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:03:37,221 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 18:03:37,221 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:03:37,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:03:37,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1490633615, now seen corresponding path program 1 times [2022-04-15 18:03:37,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:37,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [279786063] [2022-04-15 18:03:37,221 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:03:37,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1490633615, now seen corresponding path program 2 times [2022-04-15 18:03:37,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:03:37,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397908985] [2022-04-15 18:03:37,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:03:37,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:03:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:37,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:03:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:37,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {222809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {222803#true} is VALID [2022-04-15 18:03:37,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {222803#true} assume true; {222803#true} is VALID [2022-04-15 18:03:37,253 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {222803#true} {222803#true} #285#return; {222803#true} is VALID [2022-04-15 18:03:37,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {222803#true} call ULTIMATE.init(); {222809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:03:37,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {222809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {222803#true} is VALID [2022-04-15 18:03:37,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {222803#true} assume true; {222803#true} is VALID [2022-04-15 18:03:37,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {222803#true} {222803#true} #285#return; {222803#true} is VALID [2022-04-15 18:03:37,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {222803#true} call #t~ret20 := main(); {222803#true} is VALID [2022-04-15 18:03:37,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {222803#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {222803#true} is VALID [2022-04-15 18:03:37,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {222803#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {222803#true} is VALID [2022-04-15 18:03:37,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {222803#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {222803#true} is VALID [2022-04-15 18:03:37,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {222803#true} assume !(0 != ~p1~0); {222803#true} is VALID [2022-04-15 18:03:37,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {222803#true} assume !(0 != ~p2~0); {222803#true} is VALID [2022-04-15 18:03:37,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {222803#true} assume !(0 != ~p3~0); {222803#true} is VALID [2022-04-15 18:03:37,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {222803#true} assume !(0 != ~p4~0); {222803#true} is VALID [2022-04-15 18:03:37,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {222803#true} assume !(0 != ~p5~0); {222803#true} is VALID [2022-04-15 18:03:37,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {222803#true} assume !(0 != ~p6~0); {222803#true} is VALID [2022-04-15 18:03:37,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {222803#true} assume !(0 != ~p7~0); {222803#true} is VALID [2022-04-15 18:03:37,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {222803#true} assume 0 != ~p8~0;~lk8~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 18:03:37,255 INFO L290 TraceCheckUtils]: 16: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 18:03:37,256 INFO L290 TraceCheckUtils]: 17: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 18:03:37,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 18:03:37,256 INFO L290 TraceCheckUtils]: 19: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 18:03:37,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 18:03:37,257 INFO L290 TraceCheckUtils]: 21: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 18:03:37,275 INFO L290 TraceCheckUtils]: 22: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 18:03:37,276 INFO L290 TraceCheckUtils]: 23: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 18:03:37,276 INFO L290 TraceCheckUtils]: 24: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 18:03:37,276 INFO L290 TraceCheckUtils]: 25: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 18:03:37,277 INFO L290 TraceCheckUtils]: 26: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 18:03:37,277 INFO L290 TraceCheckUtils]: 27: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 18:03:37,277 INFO L290 TraceCheckUtils]: 28: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 18:03:37,277 INFO L290 TraceCheckUtils]: 29: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 18:03:37,278 INFO L290 TraceCheckUtils]: 30: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p8~0; {222808#(= main_~lk8~0 1)} is VALID [2022-04-15 18:03:37,278 INFO L290 TraceCheckUtils]: 31: Hoare triple {222808#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {222804#false} is VALID [2022-04-15 18:03:37,278 INFO L290 TraceCheckUtils]: 32: Hoare triple {222804#false} assume !false; {222804#false} is VALID [2022-04-15 18:03:37,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:03:37,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:03:37,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397908985] [2022-04-15 18:03:37,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397908985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:37,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:37,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:37,279 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:03:37,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [279786063] [2022-04-15 18:03:37,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [279786063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:37,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:37,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:37,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50250109] [2022-04-15 18:03:37,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:03:37,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 18:03:37,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:03:37,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:37,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:37,298 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:03:37,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:37,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:03:37,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:03:37,298 INFO L87 Difference]: Start difference. First operand 5705 states and 9031 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:42,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:42,557 INFO L93 Difference]: Finished difference Result 10253 states and 16585 transitions. [2022-04-15 18:03:42,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:03:42,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 18:03:42,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:03:42,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:42,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-15 18:03:42,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:42,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-15 18:03:42,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-15 18:03:42,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:46,845 INFO L225 Difference]: With dead ends: 10253 [2022-04-15 18:03:46,846 INFO L226 Difference]: Without dead ends: 10251 [2022-04-15 18:03:46,848 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:03:46,848 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 204 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:03:46,848 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 101 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 18:03:46,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10251 states. [2022-04-15 18:03:47,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10251 to 8201. [2022-04-15 18:03:47,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:03:47,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10251 states. Second operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:47,610 INFO L74 IsIncluded]: Start isIncluded. First operand 10251 states. Second operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:47,618 INFO L87 Difference]: Start difference. First operand 10251 states. Second operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:50,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:50,298 INFO L93 Difference]: Finished difference Result 10251 states and 16456 transitions. [2022-04-15 18:03:50,298 INFO L276 IsEmpty]: Start isEmpty. Operand 10251 states and 16456 transitions. [2022-04-15 18:03:50,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:50,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:50,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 10251 states. [2022-04-15 18:03:50,327 INFO L87 Difference]: Start difference. First operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 10251 states. [2022-04-15 18:03:53,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:53,011 INFO L93 Difference]: Finished difference Result 10251 states and 16456 transitions. [2022-04-15 18:03:53,011 INFO L276 IsEmpty]: Start isEmpty. Operand 10251 states and 16456 transitions. [2022-04-15 18:03:53,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:53,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:53,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:03:53,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:03:53,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:56,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8201 states to 8201 states and 12615 transitions. [2022-04-15 18:03:56,138 INFO L78 Accepts]: Start accepts. Automaton has 8201 states and 12615 transitions. Word has length 33 [2022-04-15 18:03:56,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:03:56,139 INFO L478 AbstractCegarLoop]: Abstraction has 8201 states and 12615 transitions. [2022-04-15 18:03:56,139 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:56,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8201 states and 12615 transitions. [2022-04-15 18:04:09,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12615 edges. 12615 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:04:09,580 INFO L276 IsEmpty]: Start isEmpty. Operand 8201 states and 12615 transitions. [2022-04-15 18:04:09,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 18:04:09,585 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:04:09,586 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:04:09,586 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 18:04:09,586 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:04:09,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:04:09,586 INFO L85 PathProgramCache]: Analyzing trace with hash -503511091, now seen corresponding path program 1 times [2022-04-15 18:04:09,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:09,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1356167908] [2022-04-15 18:04:09,586 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:04:09,587 INFO L85 PathProgramCache]: Analyzing trace with hash -503511091, now seen corresponding path program 2 times [2022-04-15 18:04:09,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:04:09,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944641139] [2022-04-15 18:04:09,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:04:09,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:04:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:09,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:04:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:09,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {280231#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {280225#true} is VALID [2022-04-15 18:04:09,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {280225#true} assume true; {280225#true} is VALID [2022-04-15 18:04:09,642 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {280225#true} {280225#true} #285#return; {280225#true} is VALID [2022-04-15 18:04:09,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {280225#true} call ULTIMATE.init(); {280231#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:04:09,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {280231#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {280225#true} is VALID [2022-04-15 18:04:09,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {280225#true} assume true; {280225#true} is VALID [2022-04-15 18:04:09,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {280225#true} {280225#true} #285#return; {280225#true} is VALID [2022-04-15 18:04:09,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {280225#true} call #t~ret20 := main(); {280225#true} is VALID [2022-04-15 18:04:09,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {280225#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {280225#true} is VALID [2022-04-15 18:04:09,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {280225#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {280225#true} is VALID [2022-04-15 18:04:09,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {280225#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {280225#true} is VALID [2022-04-15 18:04:09,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {280225#true} assume !(0 != ~p1~0); {280225#true} is VALID [2022-04-15 18:04:09,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {280225#true} assume !(0 != ~p2~0); {280225#true} is VALID [2022-04-15 18:04:09,644 INFO L290 TraceCheckUtils]: 10: Hoare triple {280225#true} assume !(0 != ~p3~0); {280225#true} is VALID [2022-04-15 18:04:09,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {280225#true} assume !(0 != ~p4~0); {280225#true} is VALID [2022-04-15 18:04:09,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {280225#true} assume !(0 != ~p5~0); {280225#true} is VALID [2022-04-15 18:04:09,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {280225#true} assume !(0 != ~p6~0); {280225#true} is VALID [2022-04-15 18:04:09,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {280225#true} assume !(0 != ~p7~0); {280225#true} is VALID [2022-04-15 18:04:09,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {280225#true} assume !(0 != ~p8~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-15 18:04:09,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-15 18:04:09,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p10~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-15 18:04:09,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-15 18:04:09,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-15 18:04:09,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-15 18:04:09,646 INFO L290 TraceCheckUtils]: 21: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-15 18:04:09,646 INFO L290 TraceCheckUtils]: 22: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-15 18:04:09,646 INFO L290 TraceCheckUtils]: 23: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p1~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-15 18:04:09,647 INFO L290 TraceCheckUtils]: 24: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p2~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-15 18:04:09,647 INFO L290 TraceCheckUtils]: 25: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p3~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-15 18:04:09,647 INFO L290 TraceCheckUtils]: 26: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p4~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-15 18:04:09,647 INFO L290 TraceCheckUtils]: 27: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p5~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-15 18:04:09,648 INFO L290 TraceCheckUtils]: 28: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p6~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-15 18:04:09,648 INFO L290 TraceCheckUtils]: 29: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p7~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-15 18:04:09,648 INFO L290 TraceCheckUtils]: 30: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p8~0; {280226#false} is VALID [2022-04-15 18:04:09,648 INFO L290 TraceCheckUtils]: 31: Hoare triple {280226#false} assume 1 != ~lk8~0; {280226#false} is VALID [2022-04-15 18:04:09,648 INFO L290 TraceCheckUtils]: 32: Hoare triple {280226#false} assume !false; {280226#false} is VALID [2022-04-15 18:04:09,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:04:09,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:04:09,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944641139] [2022-04-15 18:04:09,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944641139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:09,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:09,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:09,649 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:04:09,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1356167908] [2022-04-15 18:04:09,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1356167908] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:09,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:09,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:09,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217877526] [2022-04-15 18:04:09,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:04:09,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 18:04:09,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:04:09,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:04:09,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:04:09,668 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:04:09,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:09,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:04:09,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:04:09,669 INFO L87 Difference]: Start difference. First operand 8201 states and 12615 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:04:26,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:26,193 INFO L93 Difference]: Finished difference Result 19213 states and 29769 transitions. [2022-04-15 18:04:26,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:04:26,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 18:04:26,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:04:26,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:04:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 261 transitions. [2022-04-15 18:04:26,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:04:26,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 261 transitions. [2022-04-15 18:04:26,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 261 transitions. [2022-04-15 18:04:26,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:04:31,087 INFO L225 Difference]: With dead ends: 19213 [2022-04-15 18:04:31,087 INFO L226 Difference]: Without dead ends: 11147 [2022-04-15 18:04:31,096 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:04:31,097 INFO L913 BasicCegarLoop]: 142 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:04:31,097 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 149 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 18:04:31,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11147 states. [2022-04-15 18:04:31,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11147 to 11145. [2022-04-15 18:04:31,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:04:32,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11147 states. Second operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:04:32,013 INFO L74 IsIncluded]: Start isIncluded. First operand 11147 states. Second operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:04:32,025 INFO L87 Difference]: Start difference. First operand 11147 states. Second operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:04:35,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:35,265 INFO L93 Difference]: Finished difference Result 11147 states and 17160 transitions. [2022-04-15 18:04:35,265 INFO L276 IsEmpty]: Start isEmpty. Operand 11147 states and 17160 transitions. [2022-04-15 18:04:35,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:35,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:35,285 INFO L74 IsIncluded]: Start isIncluded. First operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 11147 states. [2022-04-15 18:04:35,294 INFO L87 Difference]: Start difference. First operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 11147 states. [2022-04-15 18:04:38,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:38,563 INFO L93 Difference]: Finished difference Result 11147 states and 17160 transitions. [2022-04-15 18:04:38,563 INFO L276 IsEmpty]: Start isEmpty. Operand 11147 states and 17160 transitions. [2022-04-15 18:04:38,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:38,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:38,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:04:38,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:04:38,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:04:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11145 states to 11145 states and 17159 transitions. [2022-04-15 18:04:43,767 INFO L78 Accepts]: Start accepts. Automaton has 11145 states and 17159 transitions. Word has length 33 [2022-04-15 18:04:43,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:04:43,767 INFO L478 AbstractCegarLoop]: Abstraction has 11145 states and 17159 transitions. [2022-04-15 18:04:43,767 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:04:43,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11145 states and 17159 transitions. [2022-04-15 18:05:02,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17159 edges. 17159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:05:02,633 INFO L276 IsEmpty]: Start isEmpty. Operand 11145 states and 17159 transitions. [2022-04-15 18:05:02,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 18:05:02,639 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:05:02,640 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:05:02,640 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 18:05:02,640 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:05:02,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:05:02,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1034784041, now seen corresponding path program 1 times [2022-04-15 18:05:02,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:05:02,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1667271214] [2022-04-15 18:05:02,640 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:05:02,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1034784041, now seen corresponding path program 2 times [2022-04-15 18:05:02,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:05:02,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956575648] [2022-04-15 18:05:02,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:05:02,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:05:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:05:02,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:05:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:05:02,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {363253#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {363247#true} is VALID [2022-04-15 18:05:02,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {363247#true} assume true; {363247#true} is VALID [2022-04-15 18:05:02,692 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {363247#true} {363247#true} #285#return; {363247#true} is VALID [2022-04-15 18:05:02,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {363247#true} call ULTIMATE.init(); {363253#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:05:02,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {363253#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {363247#true} is VALID [2022-04-15 18:05:02,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {363247#true} assume true; {363247#true} is VALID [2022-04-15 18:05:02,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {363247#true} {363247#true} #285#return; {363247#true} is VALID [2022-04-15 18:05:02,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {363247#true} call #t~ret20 := main(); {363247#true} is VALID [2022-04-15 18:05:02,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {363247#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {363247#true} is VALID [2022-04-15 18:05:02,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {363247#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {363247#true} is VALID [2022-04-15 18:05:02,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {363247#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {363247#true} is VALID [2022-04-15 18:05:02,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {363247#true} assume !(0 != ~p1~0); {363247#true} is VALID [2022-04-15 18:05:02,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {363247#true} assume !(0 != ~p2~0); {363247#true} is VALID [2022-04-15 18:05:02,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {363247#true} assume !(0 != ~p3~0); {363247#true} is VALID [2022-04-15 18:05:02,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {363247#true} assume !(0 != ~p4~0); {363247#true} is VALID [2022-04-15 18:05:02,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {363247#true} assume !(0 != ~p5~0); {363247#true} is VALID [2022-04-15 18:05:02,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {363247#true} assume !(0 != ~p6~0); {363247#true} is VALID [2022-04-15 18:05:02,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {363247#true} assume !(0 != ~p7~0); {363247#true} is VALID [2022-04-15 18:05:02,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {363247#true} assume 0 != ~p8~0;~lk8~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:05:02,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:05:02,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:05:02,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:05:02,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:05:02,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:05:02,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:05:02,696 INFO L290 TraceCheckUtils]: 22: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:05:02,696 INFO L290 TraceCheckUtils]: 23: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:05:02,696 INFO L290 TraceCheckUtils]: 24: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:05:02,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:05:02,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:05:02,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:05:02,697 INFO L290 TraceCheckUtils]: 28: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:05:02,698 INFO L290 TraceCheckUtils]: 29: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:05:02,698 INFO L290 TraceCheckUtils]: 30: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {363248#false} is VALID [2022-04-15 18:05:02,698 INFO L290 TraceCheckUtils]: 31: Hoare triple {363248#false} assume 0 != ~p9~0; {363248#false} is VALID [2022-04-15 18:05:02,698 INFO L290 TraceCheckUtils]: 32: Hoare triple {363248#false} assume 1 != ~lk9~0; {363248#false} is VALID [2022-04-15 18:05:02,698 INFO L290 TraceCheckUtils]: 33: Hoare triple {363248#false} assume !false; {363248#false} is VALID [2022-04-15 18:05:02,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:05:02,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:05:02,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956575648] [2022-04-15 18:05:02,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956575648] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:05:02,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:05:02,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:05:02,699 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:05:02,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1667271214] [2022-04-15 18:05:02,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1667271214] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:05:02,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:05:02,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:05:02,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184498005] [2022-04-15 18:05:02,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:05:02,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 18:05:02,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:05:02,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:05:02,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:05:02,718 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:05:02,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:05:02,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:05:02,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:05:02,719 INFO L87 Difference]: Start difference. First operand 11145 states and 17159 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:05:16,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:05:16,447 INFO L93 Difference]: Finished difference Result 16717 states and 25673 transitions. [2022-04-15 18:05:16,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:05:16,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 18:05:16,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:05:16,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:05:16,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 256 transitions. [2022-04-15 18:05:16,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:05:16,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 256 transitions. [2022-04-15 18:05:16,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 256 transitions. [2022-04-15 18:05:16,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:05:22,075 INFO L225 Difference]: With dead ends: 16717 [2022-04-15 18:05:22,076 INFO L226 Difference]: Without dead ends: 11275 [2022-04-15 18:05:22,084 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:05:22,085 INFO L913 BasicCegarLoop]: 135 mSDtfsCounter, 189 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:05:22,085 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 142 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:05:22,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11275 states. [2022-04-15 18:05:23,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11275 to 11273. [2022-04-15 18:05:23,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:05:23,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11275 states. Second operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:05:23,125 INFO L74 IsIncluded]: Start isIncluded. First operand 11275 states. Second operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:05:23,134 INFO L87 Difference]: Start difference. First operand 11275 states. Second operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:05:26,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:05:26,502 INFO L93 Difference]: Finished difference Result 11275 states and 17160 transitions. [2022-04-15 18:05:26,502 INFO L276 IsEmpty]: Start isEmpty. Operand 11275 states and 17160 transitions. [2022-04-15 18:05:26,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:05:26,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:05:26,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 11275 states. [2022-04-15 18:05:26,532 INFO L87 Difference]: Start difference. First operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 11275 states. [2022-04-15 18:05:29,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:05:29,966 INFO L93 Difference]: Finished difference Result 11275 states and 17160 transitions. [2022-04-15 18:05:29,966 INFO L276 IsEmpty]: Start isEmpty. Operand 11275 states and 17160 transitions. [2022-04-15 18:05:29,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:05:29,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:05:29,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:05:29,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:05:29,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:05:35,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11273 states to 11273 states and 17159 transitions. [2022-04-15 18:05:35,256 INFO L78 Accepts]: Start accepts. Automaton has 11273 states and 17159 transitions. Word has length 34 [2022-04-15 18:05:35,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:05:35,256 INFO L478 AbstractCegarLoop]: Abstraction has 11273 states and 17159 transitions. [2022-04-15 18:05:35,256 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:05:35,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11273 states and 17159 transitions. [2022-04-15 18:05:54,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17159 edges. 17159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:05:54,116 INFO L276 IsEmpty]: Start isEmpty. Operand 11273 states and 17159 transitions. [2022-04-15 18:05:54,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 18:05:54,122 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:05:54,122 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:05:54,122 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 18:05:54,122 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:05:54,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:05:54,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1571239513, now seen corresponding path program 1 times [2022-04-15 18:05:54,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:05:54,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1832565764] [2022-04-15 18:05:54,123 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:05:54,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1571239513, now seen corresponding path program 2 times [2022-04-15 18:05:54,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:05:54,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389963272] [2022-04-15 18:05:54,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:05:54,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:05:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:05:54,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:05:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:05:54,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {441795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {441789#true} is VALID [2022-04-15 18:05:54,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {441789#true} assume true; {441789#true} is VALID [2022-04-15 18:05:54,157 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {441789#true} {441789#true} #285#return; {441789#true} is VALID [2022-04-15 18:05:54,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {441789#true} call ULTIMATE.init(); {441795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:05:54,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {441795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {441789#true} is VALID [2022-04-15 18:05:54,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {441789#true} assume true; {441789#true} is VALID [2022-04-15 18:05:54,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {441789#true} {441789#true} #285#return; {441789#true} is VALID [2022-04-15 18:05:54,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {441789#true} call #t~ret20 := main(); {441789#true} is VALID [2022-04-15 18:05:54,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {441789#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {441789#true} is VALID [2022-04-15 18:05:54,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {441789#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {441789#true} is VALID [2022-04-15 18:05:54,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {441789#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {441789#true} is VALID [2022-04-15 18:05:54,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {441789#true} assume !(0 != ~p1~0); {441789#true} is VALID [2022-04-15 18:05:54,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {441789#true} assume !(0 != ~p2~0); {441789#true} is VALID [2022-04-15 18:05:54,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {441789#true} assume !(0 != ~p3~0); {441789#true} is VALID [2022-04-15 18:05:54,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {441789#true} assume !(0 != ~p4~0); {441789#true} is VALID [2022-04-15 18:05:54,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {441789#true} assume !(0 != ~p5~0); {441789#true} is VALID [2022-04-15 18:05:54,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {441789#true} assume !(0 != ~p6~0); {441789#true} is VALID [2022-04-15 18:05:54,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {441789#true} assume !(0 != ~p7~0); {441789#true} is VALID [2022-04-15 18:05:54,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {441789#true} assume !(0 != ~p8~0); {441789#true} is VALID [2022-04-15 18:05:54,159 INFO L290 TraceCheckUtils]: 16: Hoare triple {441789#true} assume 0 != ~p9~0;~lk9~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 18:05:54,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 18:05:54,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 18:05:54,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 18:05:54,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 18:05:54,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 18:05:54,160 INFO L290 TraceCheckUtils]: 22: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 18:05:54,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 18:05:54,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 18:05:54,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 18:05:54,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 18:05:54,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 18:05:54,162 INFO L290 TraceCheckUtils]: 28: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 18:05:54,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 18:05:54,162 INFO L290 TraceCheckUtils]: 30: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 18:05:54,162 INFO L290 TraceCheckUtils]: 31: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p9~0; {441794#(= main_~lk9~0 1)} is VALID [2022-04-15 18:05:54,163 INFO L290 TraceCheckUtils]: 32: Hoare triple {441794#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {441790#false} is VALID [2022-04-15 18:05:54,163 INFO L290 TraceCheckUtils]: 33: Hoare triple {441790#false} assume !false; {441790#false} is VALID [2022-04-15 18:05:54,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:05:54,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:05:54,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389963272] [2022-04-15 18:05:54,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389963272] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:05:54,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:05:54,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:05:54,164 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:05:54,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1832565764] [2022-04-15 18:05:54,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1832565764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:05:54,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:05:54,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:05:54,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109698224] [2022-04-15 18:05:54,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:05:54,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 18:05:54,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:05:54,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:05:54,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:05:54,180 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:05:54,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:05:54,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:05:54,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:05:54,181 INFO L87 Difference]: Start difference. First operand 11273 states and 17159 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:06:13,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:06:13,265 INFO L93 Difference]: Finished difference Result 19981 states and 31113 transitions. [2022-04-15 18:06:13,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:06:13,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 18:06:13,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:06:13,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:06:13,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-15 18:06:13,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:06:13,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-15 18:06:13,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-04-15 18:06:13,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:06:29,508 INFO L225 Difference]: With dead ends: 19981 [2022-04-15 18:06:29,508 INFO L226 Difference]: Without dead ends: 19979 [2022-04-15 18:06:29,512 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:06:29,512 INFO L913 BasicCegarLoop]: 93 mSDtfsCounter, 197 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:06:29,512 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 100 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:06:29,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19979 states. [2022-04-15 18:06:30,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19979 to 16393. [2022-04-15 18:06:30,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:06:30,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19979 states. Second operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:06:30,897 INFO L74 IsIncluded]: Start isIncluded. First operand 19979 states. Second operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:06:30,916 INFO L87 Difference]: Start difference. First operand 19979 states. Second operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:06:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:06:39,930 INFO L93 Difference]: Finished difference Result 19979 states and 30856 transitions. [2022-04-15 18:06:39,930 INFO L276 IsEmpty]: Start isEmpty. Operand 19979 states and 30856 transitions. [2022-04-15 18:06:39,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:06:39,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:06:39,958 INFO L74 IsIncluded]: Start isIncluded. First operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19979 states. [2022-04-15 18:06:39,971 INFO L87 Difference]: Start difference. First operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19979 states. [2022-04-15 18:06:49,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:06:49,857 INFO L93 Difference]: Finished difference Result 19979 states and 30856 transitions. [2022-04-15 18:06:49,857 INFO L276 IsEmpty]: Start isEmpty. Operand 19979 states and 30856 transitions. [2022-04-15 18:06:49,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:06:49,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:06:49,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:06:49,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:06:49,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:07:01,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16393 states to 16393 states and 24199 transitions. [2022-04-15 18:07:01,824 INFO L78 Accepts]: Start accepts. Automaton has 16393 states and 24199 transitions. Word has length 34 [2022-04-15 18:07:01,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:07:01,825 INFO L478 AbstractCegarLoop]: Abstraction has 16393 states and 24199 transitions. [2022-04-15 18:07:01,825 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:07:01,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16393 states and 24199 transitions. [2022-04-15 18:07:28,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24199 edges. 24199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:07:28,418 INFO L276 IsEmpty]: Start isEmpty. Operand 16393 states and 24199 transitions. [2022-04-15 18:07:28,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 18:07:28,428 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:07:28,428 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:07:28,428 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 18:07:28,428 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:07:28,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:07:28,429 INFO L85 PathProgramCache]: Analyzing trace with hash -422905193, now seen corresponding path program 1 times [2022-04-15 18:07:28,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:07:28,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1028833878] [2022-04-15 18:07:28,431 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:07:28,431 INFO L85 PathProgramCache]: Analyzing trace with hash -422905193, now seen corresponding path program 2 times [2022-04-15 18:07:28,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:07:28,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161821772] [2022-04-15 18:07:28,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:07:28,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:07:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:07:28,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:07:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:07:28,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {554513#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {554507#true} is VALID [2022-04-15 18:07:28,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {554507#true} assume true; {554507#true} is VALID [2022-04-15 18:07:28,461 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {554507#true} {554507#true} #285#return; {554507#true} is VALID [2022-04-15 18:07:28,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {554507#true} call ULTIMATE.init(); {554513#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:07:28,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {554513#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {554507#true} is VALID [2022-04-15 18:07:28,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {554507#true} assume true; {554507#true} is VALID [2022-04-15 18:07:28,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554507#true} {554507#true} #285#return; {554507#true} is VALID [2022-04-15 18:07:28,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {554507#true} call #t~ret20 := main(); {554507#true} is VALID [2022-04-15 18:07:28,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {554507#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {554507#true} is VALID [2022-04-15 18:07:28,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {554507#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {554507#true} is VALID [2022-04-15 18:07:28,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {554507#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {554507#true} is VALID [2022-04-15 18:07:28,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {554507#true} assume !(0 != ~p1~0); {554507#true} is VALID [2022-04-15 18:07:28,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {554507#true} assume !(0 != ~p2~0); {554507#true} is VALID [2022-04-15 18:07:28,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {554507#true} assume !(0 != ~p3~0); {554507#true} is VALID [2022-04-15 18:07:28,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {554507#true} assume !(0 != ~p4~0); {554507#true} is VALID [2022-04-15 18:07:28,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {554507#true} assume !(0 != ~p5~0); {554507#true} is VALID [2022-04-15 18:07:28,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {554507#true} assume !(0 != ~p6~0); {554507#true} is VALID [2022-04-15 18:07:28,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {554507#true} assume !(0 != ~p7~0); {554507#true} is VALID [2022-04-15 18:07:28,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {554507#true} assume !(0 != ~p8~0); {554507#true} is VALID [2022-04-15 18:07:28,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {554507#true} assume !(0 != ~p9~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-15 18:07:28,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p10~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-15 18:07:28,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {554512#(= main_~p9~0 0)} is VALID [2022-04-15 18:07:28,469 INFO L290 TraceCheckUtils]: 19: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {554512#(= main_~p9~0 0)} is VALID [2022-04-15 18:07:28,470 INFO L290 TraceCheckUtils]: 20: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {554512#(= main_~p9~0 0)} is VALID [2022-04-15 18:07:28,470 INFO L290 TraceCheckUtils]: 21: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {554512#(= main_~p9~0 0)} is VALID [2022-04-15 18:07:28,470 INFO L290 TraceCheckUtils]: 22: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {554512#(= main_~p9~0 0)} is VALID [2022-04-15 18:07:28,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p1~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-15 18:07:28,471 INFO L290 TraceCheckUtils]: 24: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p2~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-15 18:07:28,471 INFO L290 TraceCheckUtils]: 25: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p3~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-15 18:07:28,471 INFO L290 TraceCheckUtils]: 26: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p4~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-15 18:07:28,472 INFO L290 TraceCheckUtils]: 27: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p5~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-15 18:07:28,472 INFO L290 TraceCheckUtils]: 28: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p6~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-15 18:07:28,472 INFO L290 TraceCheckUtils]: 29: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p7~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-15 18:07:28,472 INFO L290 TraceCheckUtils]: 30: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p8~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-15 18:07:28,473 INFO L290 TraceCheckUtils]: 31: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p9~0; {554508#false} is VALID [2022-04-15 18:07:28,473 INFO L290 TraceCheckUtils]: 32: Hoare triple {554508#false} assume 1 != ~lk9~0; {554508#false} is VALID [2022-04-15 18:07:28,473 INFO L290 TraceCheckUtils]: 33: Hoare triple {554508#false} assume !false; {554508#false} is VALID [2022-04-15 18:07:28,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:07:28,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:07:28,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161821772] [2022-04-15 18:07:28,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161821772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:07:28,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:07:28,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:07:28,473 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:07:28,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1028833878] [2022-04-15 18:07:28,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1028833878] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:07:28,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:07:28,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:07:28,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57325001] [2022-04-15 18:07:28,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:07:28,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 18:07:28,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:07:28,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:07:28,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:07:28,491 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:07:28,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:07:28,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:07:28,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:07:28,492 INFO L87 Difference]: Start difference. First operand 16393 states and 24199 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:08:44,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:08:44,874 INFO L93 Difference]: Finished difference Result 38157 states and 56713 transitions. [2022-04-15 18:08:44,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:08:44,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 18:08:44,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:08:44,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:08:44,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2022-04-15 18:08:44,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:08:44,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2022-04-15 18:08:44,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 258 transitions. [2022-04-15 18:08:45,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:09:03,645 INFO L225 Difference]: With dead ends: 38157 [2022-04-15 18:09:03,645 INFO L226 Difference]: Without dead ends: 22027 [2022-04-15 18:09:03,665 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:09:03,666 INFO L913 BasicCegarLoop]: 144 mSDtfsCounter, 175 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:09:03,666 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 151 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:09:03,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22027 states. [2022-04-15 18:09:05,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22027 to 22025. [2022-04-15 18:09:05,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:09:05,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22027 states. Second operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:09:05,681 INFO L74 IsIncluded]: Start isIncluded. First operand 22027 states. Second operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:09:05,707 INFO L87 Difference]: Start difference. First operand 22027 states. Second operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:09:18,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:09:18,279 INFO L93 Difference]: Finished difference Result 22027 states and 32520 transitions. [2022-04-15 18:09:18,279 INFO L276 IsEmpty]: Start isEmpty. Operand 22027 states and 32520 transitions. [2022-04-15 18:09:18,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:09:18,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:09:18,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22027 states. [2022-04-15 18:09:18,344 INFO L87 Difference]: Start difference. First operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22027 states. [2022-04-15 18:09:30,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:09:30,998 INFO L93 Difference]: Finished difference Result 22027 states and 32520 transitions. [2022-04-15 18:09:30,998 INFO L276 IsEmpty]: Start isEmpty. Operand 22027 states and 32520 transitions. [2022-04-15 18:09:31,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:09:31,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:09:31,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:09:31,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:09:31,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:09:51,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22025 states to 22025 states and 32519 transitions. [2022-04-15 18:09:51,403 INFO L78 Accepts]: Start accepts. Automaton has 22025 states and 32519 transitions. Word has length 34 [2022-04-15 18:09:51,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:09:51,403 INFO L478 AbstractCegarLoop]: Abstraction has 22025 states and 32519 transitions. [2022-04-15 18:09:51,403 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:09:51,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22025 states and 32519 transitions. [2022-04-15 18:10:27,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32519 edges. 32519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:10:27,852 INFO L276 IsEmpty]: Start isEmpty. Operand 22025 states and 32519 transitions. [2022-04-15 18:10:27,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 18:10:27,862 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:10:27,862 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:10:27,862 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 18:10:27,862 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:10:27,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:10:27,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1463999138, now seen corresponding path program 1 times [2022-04-15 18:10:27,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:10:27,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2054379062] [2022-04-15 18:10:27,863 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:10:27,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1463999138, now seen corresponding path program 2 times [2022-04-15 18:10:27,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:10:27,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919409331] [2022-04-15 18:10:27,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:10:27,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:10:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:10:27,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:10:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:10:27,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {718943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {718937#true} is VALID [2022-04-15 18:10:27,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {718937#true} assume true; {718937#true} is VALID [2022-04-15 18:10:27,896 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {718937#true} {718937#true} #285#return; {718937#true} is VALID [2022-04-15 18:10:27,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {718937#true} call ULTIMATE.init(); {718943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:10:27,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {718943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {718937#true} is VALID [2022-04-15 18:10:27,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {718937#true} assume true; {718937#true} is VALID [2022-04-15 18:10:27,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {718937#true} {718937#true} #285#return; {718937#true} is VALID [2022-04-15 18:10:27,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {718937#true} call #t~ret20 := main(); {718937#true} is VALID [2022-04-15 18:10:27,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {718937#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {718937#true} is VALID [2022-04-15 18:10:27,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {718937#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {718937#true} is VALID [2022-04-15 18:10:27,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {718937#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {718937#true} is VALID [2022-04-15 18:10:27,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {718937#true} assume !(0 != ~p1~0); {718937#true} is VALID [2022-04-15 18:10:27,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {718937#true} assume !(0 != ~p2~0); {718937#true} is VALID [2022-04-15 18:10:27,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {718937#true} assume !(0 != ~p3~0); {718937#true} is VALID [2022-04-15 18:10:27,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {718937#true} assume !(0 != ~p4~0); {718937#true} is VALID [2022-04-15 18:10:27,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {718937#true} assume !(0 != ~p5~0); {718937#true} is VALID [2022-04-15 18:10:27,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {718937#true} assume !(0 != ~p6~0); {718937#true} is VALID [2022-04-15 18:10:27,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {718937#true} assume !(0 != ~p7~0); {718937#true} is VALID [2022-04-15 18:10:27,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {718937#true} assume !(0 != ~p8~0); {718937#true} is VALID [2022-04-15 18:10:27,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {718937#true} assume 0 != ~p9~0;~lk9~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:10:27,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:10:27,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {718942#(not (= main_~p9~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:10:27,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {718942#(not (= main_~p9~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:10:27,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {718942#(not (= main_~p9~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:10:27,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {718942#(not (= main_~p9~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:10:27,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {718942#(not (= main_~p9~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:10:27,899 INFO L290 TraceCheckUtils]: 23: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:10:27,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:10:27,900 INFO L290 TraceCheckUtils]: 25: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:10:27,900 INFO L290 TraceCheckUtils]: 26: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:10:27,900 INFO L290 TraceCheckUtils]: 27: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:10:27,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:10:27,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:10:27,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:10:27,901 INFO L290 TraceCheckUtils]: 31: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {718938#false} is VALID [2022-04-15 18:10:27,901 INFO L290 TraceCheckUtils]: 32: Hoare triple {718938#false} assume 0 != ~p10~0; {718938#false} is VALID [2022-04-15 18:10:27,901 INFO L290 TraceCheckUtils]: 33: Hoare triple {718938#false} assume 1 != ~lk10~0; {718938#false} is VALID [2022-04-15 18:10:27,901 INFO L290 TraceCheckUtils]: 34: Hoare triple {718938#false} assume !false; {718938#false} is VALID [2022-04-15 18:10:27,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:10:27,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:10:27,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919409331] [2022-04-15 18:10:27,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919409331] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:10:27,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:10:27,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:10:27,902 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:10:27,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2054379062] [2022-04-15 18:10:27,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2054379062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:10:27,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:10:27,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:10:27,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163507410] [2022-04-15 18:10:27,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:10:27,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 18:10:27,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:10:27,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:10:27,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:10:27,919 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:10:27,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:10:27,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:10:27,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:10:27,920 INFO L87 Difference]: Start difference. First operand 22025 states and 32519 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:11:22,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:11:22,204 INFO L93 Difference]: Finished difference Result 33037 states and 48649 transitions. [2022-04-15 18:11:22,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:11:22,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 18:11:22,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:11:22,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:11:22,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2022-04-15 18:11:22,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:11:22,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2022-04-15 18:11:22,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 253 transitions. [2022-04-15 18:11:22,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:11:42,967 INFO L225 Difference]: With dead ends: 33037 [2022-04-15 18:11:42,967 INFO L226 Difference]: Without dead ends: 22283 [2022-04-15 18:11:42,984 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:11:42,985 INFO L913 BasicCegarLoop]: 132 mSDtfsCounter, 188 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:11:42,985 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 139 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:11:42,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22283 states. [2022-04-15 18:11:45,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22283 to 22281. [2022-04-15 18:11:45,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:11:45,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22283 states. Second operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:11:45,301 INFO L74 IsIncluded]: Start isIncluded. First operand 22283 states. Second operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:11:45,331 INFO L87 Difference]: Start difference. First operand 22283 states. Second operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:11:57,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:11:57,754 INFO L93 Difference]: Finished difference Result 22283 states and 32520 transitions. [2022-04-15 18:11:57,754 INFO L276 IsEmpty]: Start isEmpty. Operand 22283 states and 32520 transitions. [2022-04-15 18:11:57,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:11:57,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:11:57,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22283 states. [2022-04-15 18:11:57,830 INFO L87 Difference]: Start difference. First operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22283 states. [2022-04-15 18:12:10,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:12:10,936 INFO L93 Difference]: Finished difference Result 22283 states and 32520 transitions. [2022-04-15 18:12:10,936 INFO L276 IsEmpty]: Start isEmpty. Operand 22283 states and 32520 transitions. [2022-04-15 18:12:10,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:12:10,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:12:10,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:12:10,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:12:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:32,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22281 states to 22281 states and 32519 transitions. [2022-04-15 18:12:32,859 INFO L78 Accepts]: Start accepts. Automaton has 22281 states and 32519 transitions. Word has length 35 [2022-04-15 18:12:32,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:12:32,859 INFO L478 AbstractCegarLoop]: Abstraction has 22281 states and 32519 transitions. [2022-04-15 18:12:32,859 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:32,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22281 states and 32519 transitions. [2022-04-15 18:13:11,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32519 edges. 32519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:13:11,416 INFO L276 IsEmpty]: Start isEmpty. Operand 22281 states and 32519 transitions. [2022-04-15 18:13:11,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 18:13:11,426 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:13:11,426 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:13:11,426 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 18:13:11,426 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:13:11,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:13:11,427 INFO L85 PathProgramCache]: Analyzing trace with hash -224944604, now seen corresponding path program 1 times [2022-04-15 18:13:11,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:13:11,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2025755910] [2022-04-15 18:13:11,427 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:13:11,427 INFO L85 PathProgramCache]: Analyzing trace with hash -224944604, now seen corresponding path program 2 times [2022-04-15 18:13:11,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:13:11,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844391945] [2022-04-15 18:13:11,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:13:11,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:13:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:13:11,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:13:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:13:11,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {874157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {874151#true} is VALID [2022-04-15 18:13:11,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {874151#true} assume true; {874151#true} is VALID [2022-04-15 18:13:11,455 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {874151#true} {874151#true} #285#return; {874151#true} is VALID [2022-04-15 18:13:11,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {874151#true} call ULTIMATE.init(); {874157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:13:11,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {874157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {874151#true} is VALID [2022-04-15 18:13:11,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {874151#true} assume true; {874151#true} is VALID [2022-04-15 18:13:11,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {874151#true} {874151#true} #285#return; {874151#true} is VALID [2022-04-15 18:13:11,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {874151#true} call #t~ret20 := main(); {874151#true} is VALID [2022-04-15 18:13:11,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {874151#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {874151#true} is VALID [2022-04-15 18:13:11,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {874151#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {874151#true} is VALID [2022-04-15 18:13:11,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {874151#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {874151#true} is VALID [2022-04-15 18:13:11,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {874151#true} assume !(0 != ~p1~0); {874151#true} is VALID [2022-04-15 18:13:11,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {874151#true} assume !(0 != ~p2~0); {874151#true} is VALID [2022-04-15 18:13:11,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {874151#true} assume !(0 != ~p3~0); {874151#true} is VALID [2022-04-15 18:13:11,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {874151#true} assume !(0 != ~p4~0); {874151#true} is VALID [2022-04-15 18:13:11,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {874151#true} assume !(0 != ~p5~0); {874151#true} is VALID [2022-04-15 18:13:11,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {874151#true} assume !(0 != ~p6~0); {874151#true} is VALID [2022-04-15 18:13:11,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {874151#true} assume !(0 != ~p7~0); {874151#true} is VALID [2022-04-15 18:13:11,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {874151#true} assume !(0 != ~p8~0); {874151#true} is VALID [2022-04-15 18:13:11,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {874151#true} assume !(0 != ~p9~0); {874151#true} is VALID [2022-04-15 18:13:11,457 INFO L290 TraceCheckUtils]: 17: Hoare triple {874151#true} assume !(0 != ~p10~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-15 18:13:11,457 INFO L290 TraceCheckUtils]: 18: Hoare triple {874156#(= main_~p10~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {874156#(= main_~p10~0 0)} is VALID [2022-04-15 18:13:11,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {874156#(= main_~p10~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {874156#(= main_~p10~0 0)} is VALID [2022-04-15 18:13:11,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {874156#(= main_~p10~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {874156#(= main_~p10~0 0)} is VALID [2022-04-15 18:13:11,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {874156#(= main_~p10~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {874156#(= main_~p10~0 0)} is VALID [2022-04-15 18:13:11,458 INFO L290 TraceCheckUtils]: 22: Hoare triple {874156#(= main_~p10~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {874156#(= main_~p10~0 0)} is VALID [2022-04-15 18:13:11,459 INFO L290 TraceCheckUtils]: 23: Hoare triple {874156#(= main_~p10~0 0)} assume !(0 != ~p1~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-15 18:13:11,459 INFO L290 TraceCheckUtils]: 24: Hoare triple {874156#(= main_~p10~0 0)} assume !(0 != ~p2~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-15 18:13:11,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {874156#(= main_~p10~0 0)} assume !(0 != ~p3~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-15 18:13:11,459 INFO L290 TraceCheckUtils]: 26: Hoare triple {874156#(= main_~p10~0 0)} assume !(0 != ~p4~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-15 18:13:11,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {874156#(= main_~p10~0 0)} assume !(0 != ~p5~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-15 18:13:11,460 INFO L290 TraceCheckUtils]: 28: Hoare triple {874156#(= main_~p10~0 0)} assume !(0 != ~p6~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-15 18:13:11,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {874156#(= main_~p10~0 0)} assume !(0 != ~p7~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-15 18:13:11,461 INFO L290 TraceCheckUtils]: 30: Hoare triple {874156#(= main_~p10~0 0)} assume !(0 != ~p8~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-15 18:13:11,461 INFO L290 TraceCheckUtils]: 31: Hoare triple {874156#(= main_~p10~0 0)} assume !(0 != ~p9~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-15 18:13:11,461 INFO L290 TraceCheckUtils]: 32: Hoare triple {874156#(= main_~p10~0 0)} assume 0 != ~p10~0; {874152#false} is VALID [2022-04-15 18:13:11,461 INFO L290 TraceCheckUtils]: 33: Hoare triple {874152#false} assume 1 != ~lk10~0; {874152#false} is VALID [2022-04-15 18:13:11,461 INFO L290 TraceCheckUtils]: 34: Hoare triple {874152#false} assume !false; {874152#false} is VALID [2022-04-15 18:13:11,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:13:11,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:13:11,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844391945] [2022-04-15 18:13:11,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844391945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:13:11,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:13:11,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:13:11,462 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:13:11,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2025755910] [2022-04-15 18:13:11,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2025755910] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:13:11,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:13:11,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:13:11,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177456270] [2022-04-15 18:13:11,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:13:11,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 18:13:11,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:13:11,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:13:11,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:13:11,483 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:13:11,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:13:11,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:13:11,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:13:11,484 INFO L87 Difference]: Start difference. First operand 22281 states and 32519 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)