/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_10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 17:53:55,980 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 17:53:55,982 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 17:53:56,025 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 17:53:56,026 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 17:53:56,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 17:53:56,030 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 17:53:56,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 17:53:56,034 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 17:53:56,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 17:53:56,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 17:53:56,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 17:53:56,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 17:53:56,042 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 17:53:56,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 17:53:56,045 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 17:53:56,046 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 17:53:56,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 17:53:56,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 17:53:56,053 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 17:53:56,055 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 17:53:56,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 17:53:56,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 17:53:56,058 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 17:53:56,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 17:53:56,065 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 17:53:56,065 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 17:53:56,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 17:53:56,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 17:53:56,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 17:53:56,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 17:53:56,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 17:53:56,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 17:53:56,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 17:53:56,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 17:53:56,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 17:53:56,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 17:53:56,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 17:53:56,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 17:53:56,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 17:53:56,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 17:53:56,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 17:53:56,075 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 17:53:56,085 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 17:53:56,085 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 17:53:56,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 17:53:56,087 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 17:53:56,087 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 17:53:56,087 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 17:53:56,087 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 17:53:56,087 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 17:53:56,087 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 17:53:56,088 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 17:53:56,088 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 17:53:56,089 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 17:53:56,089 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 17:53:56,089 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 17:53:56,089 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 17:53:56,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 17:53:56,089 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 17:53:56,090 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 17:53:56,090 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 17:53:56,090 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 17:53:56,090 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 17:53:56,090 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 17:53:56,090 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 17:53:56,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 17:53:56,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 17:53:56,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 17:53:56,313 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 17:53:56,313 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 17:53:56,314 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10.c [2022-04-15 17:53:56,371 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb36d3b3a/b1f1e3af38d14cbd9fd457cf83abdb42/FLAG2ea802b3c [2022-04-15 17:53:56,735 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 17:53:56,736 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c [2022-04-15 17:53:56,742 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb36d3b3a/b1f1e3af38d14cbd9fd457cf83abdb42/FLAG2ea802b3c [2022-04-15 17:53:56,759 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb36d3b3a/b1f1e3af38d14cbd9fd457cf83abdb42 [2022-04-15 17:53:56,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 17:53:56,763 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 17:53:56,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 17:53:56,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 17:53:56,769 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 17:53:56,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:53:56" (1/1) ... [2022-04-15 17:53:56,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b81dc0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:56, skipping insertion in model container [2022-04-15 17:53:56,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:53:56" (1/1) ... [2022-04-15 17:53:56,777 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 17:53:56,797 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 17:53:56,987 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_10.c[3901,3914] [2022-04-15 17:53:56,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 17:53:57,003 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 17:53:57,042 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_10.c[3901,3914] [2022-04-15 17:53:57,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 17:53:57,055 INFO L208 MainTranslator]: Completed translation [2022-04-15 17:53:57,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:57 WrapperNode [2022-04-15 17:53:57,056 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 17:53:57,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 17:53:57,057 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 17:53:57,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 17:53:57,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:57" (1/1) ... [2022-04-15 17:53:57,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:57" (1/1) ... [2022-04-15 17:53:57,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:57" (1/1) ... [2022-04-15 17:53:57,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:57" (1/1) ... [2022-04-15 17:53:57,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:57" (1/1) ... [2022-04-15 17:53:57,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:57" (1/1) ... [2022-04-15 17:53:57,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:57" (1/1) ... [2022-04-15 17:53:57,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 17:53:57,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 17:53:57,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 17:53:57,109 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 17:53:57,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:57" (1/1) ... [2022-04-15 17:53:57,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 17:53:57,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:53:57,136 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 17:53:57,160 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 17:53:57,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 17:53:57,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 17:53:57,181 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 17:53:57,181 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 17:53:57,182 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 17:53:57,182 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 17:53:57,182 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 17:53:57,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 17:53:57,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 17:53:57,182 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 17:53:57,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 17:53:57,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 17:53:57,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 17:53:57,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 17:53:57,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 17:53:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 17:53:57,276 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 17:53:57,277 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 17:53:57,548 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 17:53:57,554 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 17:53:57,554 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 17:53:57,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:53:57 BoogieIcfgContainer [2022-04-15 17:53:57,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 17:53:57,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 17:53:57,557 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 17:53:57,560 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 17:53:57,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:53:56" (1/3) ... [2022-04-15 17:53:57,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c8f6cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:53:57, skipping insertion in model container [2022-04-15 17:53:57,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:57" (2/3) ... [2022-04-15 17:53:57,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c8f6cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:53:57, skipping insertion in model container [2022-04-15 17:53:57,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:53:57" (3/3) ... [2022-04-15 17:53:57,562 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2022-04-15 17:53:57,566 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 17:53:57,566 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 17:53:57,601 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 17:53:57,606 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 17:53:57,606 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 17:53:57,621 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 40 states have internal predecessors, (73), 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 17:53:57,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 17:53:57,629 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:53:57,629 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] [2022-04-15 17:53:57,630 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:53:57,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:53:57,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1465526181, now seen corresponding path program 1 times [2022-04-15 17:53:57,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:53:57,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [611370202] [2022-04-15 17:53:57,650 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:53:57,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1465526181, now seen corresponding path program 2 times [2022-04-15 17:53:57,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:53:57,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741160608] [2022-04-15 17:53:57,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:53:57,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:53:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:53:57,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:53:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:53:57,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {48#true} is VALID [2022-04-15 17:53:57,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#true} assume true; {48#true} is VALID [2022-04-15 17:53:57,936 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48#true} {48#true} #200#return; {48#true} is VALID [2022-04-15 17:53:57,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:53:57,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {48#true} is VALID [2022-04-15 17:53:57,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {48#true} assume true; {48#true} is VALID [2022-04-15 17:53:57,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48#true} {48#true} #200#return; {48#true} is VALID [2022-04-15 17:53:57,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {48#true} call #t~ret15 := main(); {48#true} is VALID [2022-04-15 17:53:57,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {48#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;havoc ~cond~0; {48#true} is VALID [2022-04-15 17:53:57,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {48#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {48#true} is VALID [2022-04-15 17:53:57,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {48#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; {48#true} is VALID [2022-04-15 17:53:57,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {48#true} assume 0 != ~p1~0;~lk1~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-15 17:53:57,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {53#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {53#(= main_~lk1~0 1)} is VALID [2022-04-15 17:53:57,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-15 17:53:57,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-15 17:53:57,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-15 17:53:57,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-15 17:53:57,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-15 17:53:57,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-15 17:53:57,949 INFO L290 TraceCheckUtils]: 16: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-15 17:53:57,953 INFO L290 TraceCheckUtils]: 17: Hoare triple {53#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {53#(= main_~lk1~0 1)} is VALID [2022-04-15 17:53:57,953 INFO L290 TraceCheckUtils]: 18: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p1~0; {53#(= main_~lk1~0 1)} is VALID [2022-04-15 17:53:57,954 INFO L290 TraceCheckUtils]: 19: Hoare triple {53#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {49#false} is VALID [2022-04-15 17:53:57,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {49#false} assume !false; {49#false} is VALID [2022-04-15 17:53:57,955 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 17:53:57,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:53:57,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741160608] [2022-04-15 17:53:57,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741160608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:53:57,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:53:57,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:53:57,961 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:53:57,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [611370202] [2022-04-15 17:53:57,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [611370202] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:53:57,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:53:57,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:53:57,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810038450] [2022-04-15 17:53:57,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:53:57,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 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 21 [2022-04-15 17:53:57,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:53:57,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:53:58,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:53:58,024 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:53:58,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:53:58,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:53:58,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:53:58,043 INFO L87 Difference]: Start difference. First operand has 45 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 40 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:53:58,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:53:58,421 INFO L93 Difference]: Finished difference Result 88 states and 151 transitions. [2022-04-15 17:53:58,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:53:58,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 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 21 [2022-04-15 17:53:58,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:53:58,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:53:58,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-15 17:53:58,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:53:58,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-15 17:53:58,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-15 17:53:58,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:53:58,598 INFO L225 Difference]: With dead ends: 88 [2022-04-15 17:53:58,598 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 17:53:58,601 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 17:53:58,605 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 174 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:53:58,607 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 89 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:53:58,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 17:53:58,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2022-04-15 17:53:58,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:53:58,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:53:58,654 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:53:58,655 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:53:58,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:53:58,666 INFO L93 Difference]: Finished difference Result 73 states and 129 transitions. [2022-04-15 17:53:58,666 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 129 transitions. [2022-04-15 17:53:58,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:53:58,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:53:58,670 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 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 73 states. [2022-04-15 17:53:58,671 INFO L87 Difference]: Start difference. First operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 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 73 states. [2022-04-15 17:53:58,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:53:58,678 INFO L93 Difference]: Finished difference Result 73 states and 129 transitions. [2022-04-15 17:53:58,678 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 129 transitions. [2022-04-15 17:53:58,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:53:58,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:53:58,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:53:58,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:53:58,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:53:58,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 90 transitions. [2022-04-15 17:53:58,692 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 90 transitions. Word has length 21 [2022-04-15 17:53:58,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:53:58,696 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 90 transitions. [2022-04-15 17:53:58,697 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:53:58,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 90 transitions. [2022-04-15 17:53:58,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:53:58,793 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 90 transitions. [2022-04-15 17:53:58,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 17:53:58,795 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:53:58,795 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] [2022-04-15 17:53:58,795 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 17:53:58,796 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:53:58,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:53:58,797 INFO L85 PathProgramCache]: Analyzing trace with hash -2052332195, now seen corresponding path program 1 times [2022-04-15 17:53:58,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:53:58,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1935285556] [2022-04-15 17:53:58,799 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:53:58,800 INFO L85 PathProgramCache]: Analyzing trace with hash -2052332195, now seen corresponding path program 2 times [2022-04-15 17:53:58,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:53:58,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458388669] [2022-04-15 17:53:58,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:53:58,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:53:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:53:58,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:53:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:53:58,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {484#true} is VALID [2022-04-15 17:53:58,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {484#true} assume true; {484#true} is VALID [2022-04-15 17:53:58,917 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {484#true} {484#true} #200#return; {484#true} is VALID [2022-04-15 17:53:58,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {484#true} call ULTIMATE.init(); {490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:53:58,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {484#true} is VALID [2022-04-15 17:53:58,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {484#true} assume true; {484#true} is VALID [2022-04-15 17:53:58,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {484#true} {484#true} #200#return; {484#true} is VALID [2022-04-15 17:53:58,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {484#true} call #t~ret15 := main(); {484#true} is VALID [2022-04-15 17:53:58,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {484#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;havoc ~cond~0; {484#true} is VALID [2022-04-15 17:53:58,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {484#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {484#true} is VALID [2022-04-15 17:53:58,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {484#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; {484#true} is VALID [2022-04-15 17:53:58,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {484#true} assume !(0 != ~p1~0); {489#(= main_~p1~0 0)} is VALID [2022-04-15 17:53:58,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {489#(= main_~p1~0 0)} assume !(0 != ~p2~0); {489#(= main_~p1~0 0)} is VALID [2022-04-15 17:53:58,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {489#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {489#(= main_~p1~0 0)} is VALID [2022-04-15 17:53:58,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {489#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {489#(= main_~p1~0 0)} is VALID [2022-04-15 17:53:58,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {489#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {489#(= main_~p1~0 0)} is VALID [2022-04-15 17:53:58,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {489#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {489#(= main_~p1~0 0)} is VALID [2022-04-15 17:53:58,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {489#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {489#(= main_~p1~0 0)} is VALID [2022-04-15 17:53:58,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {489#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {489#(= main_~p1~0 0)} is VALID [2022-04-15 17:53:58,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {489#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {489#(= main_~p1~0 0)} is VALID [2022-04-15 17:53:58,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {489#(= main_~p1~0 0)} assume !(0 != ~p10~0); {489#(= main_~p1~0 0)} is VALID [2022-04-15 17:53:58,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {489#(= main_~p1~0 0)} assume 0 != ~p1~0; {485#false} is VALID [2022-04-15 17:53:58,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {485#false} assume 1 != ~lk1~0; {485#false} is VALID [2022-04-15 17:53:58,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {485#false} assume !false; {485#false} is VALID [2022-04-15 17:53:58,927 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 17:53:58,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:53:58,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458388669] [2022-04-15 17:53:58,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458388669] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:53:58,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:53:58,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:53:58,931 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:53:58,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1935285556] [2022-04-15 17:53:58,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1935285556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:53:58,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:53:58,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:53:58,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600666843] [2022-04-15 17:53:58,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:53:58,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 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 21 [2022-04-15 17:53:58,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:53:58,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:53:58,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:53:58,952 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:53:58,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:53:58,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:53:58,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:53:58,954 INFO L87 Difference]: Start difference. First operand 51 states and 90 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:53:59,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:53:59,168 INFO L93 Difference]: Finished difference Result 118 states and 213 transitions. [2022-04-15 17:53:59,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:53:59,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 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 21 [2022-04-15 17:53:59,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:53:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:53:59,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-04-15 17:53:59,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:53:59,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-04-15 17:53:59,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 192 transitions. [2022-04-15 17:53:59,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:53:59,345 INFO L225 Difference]: With dead ends: 118 [2022-04-15 17:53:59,346 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 17:53:59,346 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 17:53:59,347 INFO L913 BasicCegarLoop]: 88 mSDtfsCounter, 148 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:53:59,348 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 95 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:53:59,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 17:53:59,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-04-15 17:53:59,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:53:59,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:53:59,359 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:53:59,359 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:53:59,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:53:59,362 INFO L93 Difference]: Finished difference Result 73 states and 127 transitions. [2022-04-15 17:53:59,362 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2022-04-15 17:53:59,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:53:59,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:53:59,363 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 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 73 states. [2022-04-15 17:53:59,364 INFO L87 Difference]: Start difference. First operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 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 73 states. [2022-04-15 17:53:59,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:53:59,366 INFO L93 Difference]: Finished difference Result 73 states and 127 transitions. [2022-04-15 17:53:59,366 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2022-04-15 17:53:59,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:53:59,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:53:59,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:53:59,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:53:59,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:53:59,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 126 transitions. [2022-04-15 17:53:59,370 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 126 transitions. Word has length 21 [2022-04-15 17:53:59,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:53:59,370 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 126 transitions. [2022-04-15 17:53:59,371 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:53:59,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 126 transitions. [2022-04-15 17:53:59,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:53:59,502 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 126 transitions. [2022-04-15 17:53:59,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 17:53:59,502 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:53:59,503 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:53:59,503 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 17:53:59,503 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:53:59,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:53:59,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1813542028, now seen corresponding path program 1 times [2022-04-15 17:53:59,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:53:59,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1354244905] [2022-04-15 17:53:59,504 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:53:59,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1813542028, now seen corresponding path program 2 times [2022-04-15 17:53:59,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:53:59,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689987914] [2022-04-15 17:53:59,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:53:59,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:53:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:53:59,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:53:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:53:59,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {1026#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1020#true} is VALID [2022-04-15 17:53:59,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {1020#true} assume true; {1020#true} is VALID [2022-04-15 17:53:59,585 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1020#true} {1020#true} #200#return; {1020#true} is VALID [2022-04-15 17:53:59,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {1020#true} call ULTIMATE.init(); {1026#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:53:59,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {1026#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1020#true} is VALID [2022-04-15 17:53:59,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {1020#true} assume true; {1020#true} is VALID [2022-04-15 17:53:59,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1020#true} {1020#true} #200#return; {1020#true} is VALID [2022-04-15 17:53:59,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {1020#true} call #t~ret15 := main(); {1020#true} is VALID [2022-04-15 17:53:59,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {1020#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;havoc ~cond~0; {1020#true} is VALID [2022-04-15 17:53:59,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {1020#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {1020#true} is VALID [2022-04-15 17:53:59,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {1020#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; {1020#true} is VALID [2022-04-15 17:53:59,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {1020#true} assume 0 != ~p1~0;~lk1~0 := 1; {1025#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:53:59,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {1025#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {1025#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:53:59,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {1025#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1025#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:53:59,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {1025#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1025#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:53:59,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {1025#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1025#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:53:59,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {1025#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1025#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:53:59,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {1025#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1025#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:53:59,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {1025#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {1025#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:53:59,597 INFO L290 TraceCheckUtils]: 16: Hoare triple {1025#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {1025#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:53:59,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {1025#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {1025#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:53:59,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {1025#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1021#false} is VALID [2022-04-15 17:53:59,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {1021#false} assume 0 != ~p2~0; {1021#false} is VALID [2022-04-15 17:53:59,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {1021#false} assume 1 != ~lk2~0; {1021#false} is VALID [2022-04-15 17:53:59,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {1021#false} assume !false; {1021#false} is VALID [2022-04-15 17:53:59,599 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 17:53:59,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:53:59,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689987914] [2022-04-15 17:53:59,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689987914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:53:59,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:53:59,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:53:59,600 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:53:59,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1354244905] [2022-04-15 17:53:59,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1354244905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:53:59,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:53:59,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:53:59,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815789793] [2022-04-15 17:53:59,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:53:59,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 17:53:59,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:53:59,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:53:59,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:53:59,616 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:53:59,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:53:59,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:53:59,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:53:59,617 INFO L87 Difference]: Start difference. First operand 71 states and 126 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:53:59,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:53:59,808 INFO L93 Difference]: Finished difference Result 109 states and 190 transitions. [2022-04-15 17:53:59,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:53:59,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 17:53:59,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:53:59,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:53:59,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-15 17:53:59,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:53:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-15 17:53:59,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 187 transitions. [2022-04-15 17:53:59,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:53:59,974 INFO L225 Difference]: With dead ends: 109 [2022-04-15 17:53:59,975 INFO L226 Difference]: Without dead ends: 76 [2022-04-15 17:53:59,975 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 17:53:59,976 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 131 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:53:59,976 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 113 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:53:59,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-15 17:53:59,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2022-04-15 17:53:59,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:53:59,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:53:59,986 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:53:59,986 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:53:59,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:53:59,989 INFO L93 Difference]: Finished difference Result 76 states and 129 transitions. [2022-04-15 17:53:59,989 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 129 transitions. [2022-04-15 17:53:59,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:53:59,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:53:59,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 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 76 states. [2022-04-15 17:53:59,990 INFO L87 Difference]: Start difference. First operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 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 76 states. [2022-04-15 17:53:59,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:53:59,992 INFO L93 Difference]: Finished difference Result 76 states and 129 transitions. [2022-04-15 17:53:59,992 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 129 transitions. [2022-04-15 17:53:59,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:53:59,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:53:59,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:53:59,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:53:59,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:53:59,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 128 transitions. [2022-04-15 17:53:59,996 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 128 transitions. Word has length 22 [2022-04-15 17:53:59,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:53:59,996 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 128 transitions. [2022-04-15 17:53:59,996 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:53:59,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 128 transitions. [2022-04-15 17:54:00,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:00,117 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 128 transitions. [2022-04-15 17:54:00,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 17:54:00,118 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:54:00,118 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:54:00,118 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 17:54:00,118 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:54:00,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:54:00,118 INFO L85 PathProgramCache]: Analyzing trace with hash 802424778, now seen corresponding path program 1 times [2022-04-15 17:54:00,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:00,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2112700808] [2022-04-15 17:54:00,119 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:54:00,119 INFO L85 PathProgramCache]: Analyzing trace with hash 802424778, now seen corresponding path program 2 times [2022-04-15 17:54:00,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:54:00,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745083020] [2022-04-15 17:54:00,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:54:00,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:54:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:00,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:54:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:00,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {1556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1550#true} is VALID [2022-04-15 17:54:00,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {1550#true} assume true; {1550#true} is VALID [2022-04-15 17:54:00,173 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1550#true} {1550#true} #200#return; {1550#true} is VALID [2022-04-15 17:54:00,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {1550#true} call ULTIMATE.init(); {1556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:54:00,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {1556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1550#true} is VALID [2022-04-15 17:54:00,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {1550#true} assume true; {1550#true} is VALID [2022-04-15 17:54:00,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1550#true} {1550#true} #200#return; {1550#true} is VALID [2022-04-15 17:54:00,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {1550#true} call #t~ret15 := main(); {1550#true} is VALID [2022-04-15 17:54:00,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {1550#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;havoc ~cond~0; {1550#true} is VALID [2022-04-15 17:54:00,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {1550#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {1550#true} is VALID [2022-04-15 17:54:00,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {1550#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; {1550#true} is VALID [2022-04-15 17:54:00,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {1550#true} assume !(0 != ~p1~0); {1550#true} is VALID [2022-04-15 17:54:00,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {1550#true} assume !(0 != ~p2~0); {1555#(= main_~p2~0 0)} is VALID [2022-04-15 17:54:00,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {1555#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1555#(= main_~p2~0 0)} is VALID [2022-04-15 17:54:00,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {1555#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1555#(= main_~p2~0 0)} is VALID [2022-04-15 17:54:00,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {1555#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1555#(= main_~p2~0 0)} is VALID [2022-04-15 17:54:00,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {1555#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1555#(= main_~p2~0 0)} is VALID [2022-04-15 17:54:00,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {1555#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1555#(= main_~p2~0 0)} is VALID [2022-04-15 17:54:00,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {1555#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1555#(= main_~p2~0 0)} is VALID [2022-04-15 17:54:00,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {1555#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1555#(= main_~p2~0 0)} is VALID [2022-04-15 17:54:00,178 INFO L290 TraceCheckUtils]: 17: Hoare triple {1555#(= main_~p2~0 0)} assume !(0 != ~p10~0); {1555#(= main_~p2~0 0)} is VALID [2022-04-15 17:54:00,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {1555#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1555#(= main_~p2~0 0)} is VALID [2022-04-15 17:54:00,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {1555#(= main_~p2~0 0)} assume 0 != ~p2~0; {1551#false} is VALID [2022-04-15 17:54:00,179 INFO L290 TraceCheckUtils]: 20: Hoare triple {1551#false} assume 1 != ~lk2~0; {1551#false} is VALID [2022-04-15 17:54:00,179 INFO L290 TraceCheckUtils]: 21: Hoare triple {1551#false} assume !false; {1551#false} is VALID [2022-04-15 17:54:00,180 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 17:54:00,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:54:00,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745083020] [2022-04-15 17:54:00,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745083020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:00,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:00,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:00,181 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:54:00,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2112700808] [2022-04-15 17:54:00,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2112700808] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:00,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:00,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:00,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467366481] [2022-04-15 17:54:00,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:54:00,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 17:54:00,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:54:00,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:00,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:00,196 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:54:00,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:00,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:54:00,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:54:00,197 INFO L87 Difference]: Start difference. First operand 74 states and 128 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:00,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:00,395 INFO L93 Difference]: Finished difference Result 202 states and 360 transitions. [2022-04-15 17:54:00,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:54:00,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 17:54:00,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:54:00,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:00,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2022-04-15 17:54:00,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:00,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2022-04-15 17:54:00,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 190 transitions. [2022-04-15 17:54:00,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:00,553 INFO L225 Difference]: With dead ends: 202 [2022-04-15 17:54:00,553 INFO L226 Difference]: Without dead ends: 137 [2022-04-15 17:54:00,553 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 17:54:00,554 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:54:00,555 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 79 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:54:00,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-15 17:54:00,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-04-15 17:54:00,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:54:00,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.786259541984733) internal successors, (234), 131 states have internal predecessors, (234), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:00,568 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.786259541984733) internal successors, (234), 131 states have internal predecessors, (234), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:00,569 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.786259541984733) internal successors, (234), 131 states have internal predecessors, (234), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:00,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:00,573 INFO L93 Difference]: Finished difference Result 137 states and 238 transitions. [2022-04-15 17:54:00,574 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 238 transitions. [2022-04-15 17:54:00,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:00,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:00,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 131 states have (on average 1.786259541984733) internal successors, (234), 131 states have internal predecessors, (234), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 137 states. [2022-04-15 17:54:00,575 INFO L87 Difference]: Start difference. First operand has 135 states, 131 states have (on average 1.786259541984733) internal successors, (234), 131 states have internal predecessors, (234), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 137 states. [2022-04-15 17:54:00,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:00,580 INFO L93 Difference]: Finished difference Result 137 states and 238 transitions. [2022-04-15 17:54:00,580 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 238 transitions. [2022-04-15 17:54:00,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:00,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:00,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:54:00,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:54:00,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.786259541984733) internal successors, (234), 131 states have internal predecessors, (234), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:00,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 237 transitions. [2022-04-15 17:54:00,586 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 237 transitions. Word has length 22 [2022-04-15 17:54:00,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:54:00,587 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 237 transitions. [2022-04-15 17:54:00,587 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:00,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 237 transitions. [2022-04-15 17:54:00,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:00,813 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 237 transitions. [2022-04-15 17:54:00,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 17:54:00,814 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:54:00,814 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:54:00,814 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 17:54:00,814 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:54:00,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:54:00,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1389230792, now seen corresponding path program 1 times [2022-04-15 17:54:00,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:00,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1763797170] [2022-04-15 17:54:00,815 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:54:00,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1389230792, now seen corresponding path program 2 times [2022-04-15 17:54:00,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:54:00,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116933765] [2022-04-15 17:54:00,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:54:00,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:54:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:00,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:54:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:00,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {2516#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2510#true} is VALID [2022-04-15 17:54:00,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {2510#true} assume true; {2510#true} is VALID [2022-04-15 17:54:00,895 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2510#true} {2510#true} #200#return; {2510#true} is VALID [2022-04-15 17:54:00,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {2510#true} call ULTIMATE.init(); {2516#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:54:00,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {2516#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2510#true} is VALID [2022-04-15 17:54:00,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {2510#true} assume true; {2510#true} is VALID [2022-04-15 17:54:00,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2510#true} {2510#true} #200#return; {2510#true} is VALID [2022-04-15 17:54:00,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {2510#true} call #t~ret15 := main(); {2510#true} is VALID [2022-04-15 17:54:00,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {2510#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;havoc ~cond~0; {2510#true} is VALID [2022-04-15 17:54:00,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {2510#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {2510#true} is VALID [2022-04-15 17:54:00,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {2510#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; {2510#true} is VALID [2022-04-15 17:54:00,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {2510#true} assume !(0 != ~p1~0); {2510#true} is VALID [2022-04-15 17:54:00,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {2510#true} assume 0 != ~p2~0;~lk2~0 := 1; {2515#(= main_~lk2~0 1)} is VALID [2022-04-15 17:54:00,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {2515#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {2515#(= main_~lk2~0 1)} is VALID [2022-04-15 17:54:00,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {2515#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2515#(= main_~lk2~0 1)} is VALID [2022-04-15 17:54:00,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {2515#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2515#(= main_~lk2~0 1)} is VALID [2022-04-15 17:54:00,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {2515#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2515#(= main_~lk2~0 1)} is VALID [2022-04-15 17:54:00,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {2515#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2515#(= main_~lk2~0 1)} is VALID [2022-04-15 17:54:00,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {2515#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2515#(= main_~lk2~0 1)} is VALID [2022-04-15 17:54:00,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {2515#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {2515#(= main_~lk2~0 1)} is VALID [2022-04-15 17:54:00,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {2515#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {2515#(= main_~lk2~0 1)} is VALID [2022-04-15 17:54:00,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {2515#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {2515#(= main_~lk2~0 1)} is VALID [2022-04-15 17:54:00,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {2515#(= main_~lk2~0 1)} assume 0 != ~p2~0; {2515#(= main_~lk2~0 1)} is VALID [2022-04-15 17:54:00,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {2515#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {2511#false} is VALID [2022-04-15 17:54:00,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {2511#false} assume !false; {2511#false} is VALID [2022-04-15 17:54:00,908 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 17:54:00,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:54:00,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116933765] [2022-04-15 17:54:00,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116933765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:00,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:00,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:00,909 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:54:00,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1763797170] [2022-04-15 17:54:00,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1763797170] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:00,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:00,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:00,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97379441] [2022-04-15 17:54:00,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:54:00,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 17:54:00,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:54:00,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:00,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:00,926 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:54:00,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:00,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:54:00,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:54:00,927 INFO L87 Difference]: Start difference. First operand 135 states and 237 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:01,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:01,113 INFO L93 Difference]: Finished difference Result 175 states and 307 transitions. [2022-04-15 17:54:01,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:54:01,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 17:54:01,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:54:01,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:01,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-15 17:54:01,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:01,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-15 17:54:01,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 124 transitions. [2022-04-15 17:54:01,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:01,222 INFO L225 Difference]: With dead ends: 175 [2022-04-15 17:54:01,222 INFO L226 Difference]: Without dead ends: 173 [2022-04-15 17:54:01,222 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 17:54:01,224 INFO L913 BasicCegarLoop]: 121 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:54:01,224 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 128 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:54:01,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-15 17:54:01,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 135. [2022-04-15 17:54:01,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:54:01,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:01,251 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:01,251 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:01,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:01,257 INFO L93 Difference]: Finished difference Result 173 states and 304 transitions. [2022-04-15 17:54:01,257 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 304 transitions. [2022-04-15 17:54:01,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:01,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:01,258 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 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 173 states. [2022-04-15 17:54:01,259 INFO L87 Difference]: Start difference. First operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 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 173 states. [2022-04-15 17:54:01,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:01,265 INFO L93 Difference]: Finished difference Result 173 states and 304 transitions. [2022-04-15 17:54:01,265 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 304 transitions. [2022-04-15 17:54:01,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:01,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:01,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:54:01,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:54:01,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:01,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 235 transitions. [2022-04-15 17:54:01,271 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 235 transitions. Word has length 22 [2022-04-15 17:54:01,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:54:01,272 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 235 transitions. [2022-04-15 17:54:01,272 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:01,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 235 transitions. [2022-04-15 17:54:01,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:01,496 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 235 transitions. [2022-04-15 17:54:01,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 17:54:01,497 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:54:01,497 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:54:01,497 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 17:54:01,497 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:54:01,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:54:01,497 INFO L85 PathProgramCache]: Analyzing trace with hash -894421934, now seen corresponding path program 1 times [2022-04-15 17:54:01,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:01,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [927947454] [2022-04-15 17:54:01,498 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:54:01,498 INFO L85 PathProgramCache]: Analyzing trace with hash -894421934, now seen corresponding path program 2 times [2022-04-15 17:54:01,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:54:01,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977710125] [2022-04-15 17:54:01,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:54:01,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:54:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:01,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:54:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:01,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {3494#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3488#true} is VALID [2022-04-15 17:54:01,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {3488#true} assume true; {3488#true} is VALID [2022-04-15 17:54:01,540 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3488#true} {3488#true} #200#return; {3488#true} is VALID [2022-04-15 17:54:01,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {3488#true} call ULTIMATE.init(); {3494#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:54:01,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {3494#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3488#true} is VALID [2022-04-15 17:54:01,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {3488#true} assume true; {3488#true} is VALID [2022-04-15 17:54:01,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3488#true} {3488#true} #200#return; {3488#true} is VALID [2022-04-15 17:54:01,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {3488#true} call #t~ret15 := main(); {3488#true} is VALID [2022-04-15 17:54:01,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {3488#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;havoc ~cond~0; {3488#true} is VALID [2022-04-15 17:54:01,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {3488#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {3488#true} is VALID [2022-04-15 17:54:01,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {3488#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; {3488#true} is VALID [2022-04-15 17:54:01,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {3488#true} assume !(0 != ~p1~0); {3488#true} is VALID [2022-04-15 17:54:01,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {3488#true} assume !(0 != ~p2~0); {3488#true} is VALID [2022-04-15 17:54:01,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {3488#true} assume 0 != ~p3~0;~lk3~0 := 1; {3493#(= main_~lk3~0 1)} is VALID [2022-04-15 17:54:01,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {3493#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3493#(= main_~lk3~0 1)} is VALID [2022-04-15 17:54:01,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {3493#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3493#(= main_~lk3~0 1)} is VALID [2022-04-15 17:54:01,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {3493#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3493#(= main_~lk3~0 1)} is VALID [2022-04-15 17:54:01,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {3493#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3493#(= main_~lk3~0 1)} is VALID [2022-04-15 17:54:01,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {3493#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {3493#(= main_~lk3~0 1)} is VALID [2022-04-15 17:54:01,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {3493#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3493#(= main_~lk3~0 1)} is VALID [2022-04-15 17:54:01,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {3493#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {3493#(= main_~lk3~0 1)} is VALID [2022-04-15 17:54:01,545 INFO L290 TraceCheckUtils]: 18: Hoare triple {3493#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {3493#(= main_~lk3~0 1)} is VALID [2022-04-15 17:54:01,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {3493#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {3493#(= main_~lk3~0 1)} is VALID [2022-04-15 17:54:01,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {3493#(= main_~lk3~0 1)} assume 0 != ~p3~0; {3493#(= main_~lk3~0 1)} is VALID [2022-04-15 17:54:01,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {3493#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {3489#false} is VALID [2022-04-15 17:54:01,547 INFO L290 TraceCheckUtils]: 22: Hoare triple {3489#false} assume !false; {3489#false} is VALID [2022-04-15 17:54:01,547 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 17:54:01,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:54:01,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977710125] [2022-04-15 17:54:01,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977710125] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:01,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:01,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:01,548 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:54:01,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [927947454] [2022-04-15 17:54:01,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [927947454] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:01,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:01,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:01,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653699720] [2022-04-15 17:54:01,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:54:01,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 17:54:01,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:54:01,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:01,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:01,565 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:54:01,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:01,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:54:01,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:54:01,566 INFO L87 Difference]: Start difference. First operand 135 states and 235 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:01,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:01,754 INFO L93 Difference]: Finished difference Result 251 states and 443 transitions. [2022-04-15 17:54:01,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:54:01,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 17:54:01,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:54:01,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:01,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-15 17:54:01,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-15 17:54:01,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-15 17:54:01,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:01,861 INFO L225 Difference]: With dead ends: 251 [2022-04-15 17:54:01,861 INFO L226 Difference]: Without dead ends: 249 [2022-04-15 17:54:01,862 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 17:54:01,862 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 154 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:54:01,862 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 76 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:54:01,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-04-15 17:54:01,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 183. [2022-04-15 17:54:01,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:54:01,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand has 183 states, 179 states have (on average 1.7541899441340782) internal successors, (314), 179 states have internal predecessors, (314), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:01,878 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand has 183 states, 179 states have (on average 1.7541899441340782) internal successors, (314), 179 states have internal predecessors, (314), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:01,878 INFO L87 Difference]: Start difference. First operand 249 states. Second operand has 183 states, 179 states have (on average 1.7541899441340782) internal successors, (314), 179 states have internal predecessors, (314), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:01,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:01,886 INFO L93 Difference]: Finished difference Result 249 states and 438 transitions. [2022-04-15 17:54:01,886 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 438 transitions. [2022-04-15 17:54:01,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:01,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:01,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 179 states have (on average 1.7541899441340782) internal successors, (314), 179 states have internal predecessors, (314), 2 states have call successors, (2), 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 249 states. [2022-04-15 17:54:01,888 INFO L87 Difference]: Start difference. First operand has 183 states, 179 states have (on average 1.7541899441340782) internal successors, (314), 179 states have internal predecessors, (314), 2 states have call successors, (2), 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 249 states. [2022-04-15 17:54:01,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:01,896 INFO L93 Difference]: Finished difference Result 249 states and 438 transitions. [2022-04-15 17:54:01,896 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 438 transitions. [2022-04-15 17:54:01,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:01,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:01,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:54:01,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:54:01,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.7541899441340782) internal successors, (314), 179 states have internal predecessors, (314), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:01,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 317 transitions. [2022-04-15 17:54:01,904 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 317 transitions. Word has length 23 [2022-04-15 17:54:01,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:54:01,904 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 317 transitions. [2022-04-15 17:54:01,904 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:01,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 183 states and 317 transitions. [2022-04-15 17:54:02,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 317 edges. 317 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:02,245 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 317 transitions. [2022-04-15 17:54:02,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 17:54:02,245 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:54:02,245 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:54:02,245 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 17:54:02,246 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:54:02,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:54:02,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1481227948, now seen corresponding path program 1 times [2022-04-15 17:54:02,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:02,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [733054984] [2022-04-15 17:54:02,247 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:54:02,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1481227948, now seen corresponding path program 2 times [2022-04-15 17:54:02,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:54:02,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383555676] [2022-04-15 17:54:02,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:54:02,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:54:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:02,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:54:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:02,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {4872#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {4866#true} is VALID [2022-04-15 17:54:02,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {4866#true} assume true; {4866#true} is VALID [2022-04-15 17:54:02,300 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4866#true} {4866#true} #200#return; {4866#true} is VALID [2022-04-15 17:54:02,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {4866#true} call ULTIMATE.init(); {4872#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:54:02,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {4872#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {4866#true} is VALID [2022-04-15 17:54:02,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {4866#true} assume true; {4866#true} is VALID [2022-04-15 17:54:02,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4866#true} {4866#true} #200#return; {4866#true} is VALID [2022-04-15 17:54:02,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {4866#true} call #t~ret15 := main(); {4866#true} is VALID [2022-04-15 17:54:02,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {4866#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;havoc ~cond~0; {4866#true} is VALID [2022-04-15 17:54:02,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {4866#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {4866#true} is VALID [2022-04-15 17:54:02,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {4866#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; {4866#true} is VALID [2022-04-15 17:54:02,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {4866#true} assume !(0 != ~p1~0); {4866#true} is VALID [2022-04-15 17:54:02,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {4866#true} assume !(0 != ~p2~0); {4866#true} is VALID [2022-04-15 17:54:02,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {4866#true} assume !(0 != ~p3~0); {4871#(= main_~p3~0 0)} is VALID [2022-04-15 17:54:02,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {4871#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {4871#(= main_~p3~0 0)} is VALID [2022-04-15 17:54:02,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {4871#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {4871#(= main_~p3~0 0)} is VALID [2022-04-15 17:54:02,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {4871#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {4871#(= main_~p3~0 0)} is VALID [2022-04-15 17:54:02,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {4871#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {4871#(= main_~p3~0 0)} is VALID [2022-04-15 17:54:02,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {4871#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {4871#(= main_~p3~0 0)} is VALID [2022-04-15 17:54:02,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {4871#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {4871#(= main_~p3~0 0)} is VALID [2022-04-15 17:54:02,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {4871#(= main_~p3~0 0)} assume !(0 != ~p10~0); {4871#(= main_~p3~0 0)} is VALID [2022-04-15 17:54:02,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {4871#(= main_~p3~0 0)} assume !(0 != ~p1~0); {4871#(= main_~p3~0 0)} is VALID [2022-04-15 17:54:02,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {4871#(= main_~p3~0 0)} assume !(0 != ~p2~0); {4871#(= main_~p3~0 0)} is VALID [2022-04-15 17:54:02,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {4871#(= main_~p3~0 0)} assume 0 != ~p3~0; {4867#false} is VALID [2022-04-15 17:54:02,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {4867#false} assume 1 != ~lk3~0; {4867#false} is VALID [2022-04-15 17:54:02,307 INFO L290 TraceCheckUtils]: 22: Hoare triple {4867#false} assume !false; {4867#false} is VALID [2022-04-15 17:54:02,307 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 17:54:02,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:54:02,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383555676] [2022-04-15 17:54:02,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383555676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:02,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:02,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:02,308 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:54:02,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [733054984] [2022-04-15 17:54:02,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [733054984] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:02,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:02,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:02,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369731568] [2022-04-15 17:54:02,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:54:02,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 17:54:02,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:54:02,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:02,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:02,324 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:54:02,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:02,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:54:02,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:54:02,325 INFO L87 Difference]: Start difference. First operand 183 states and 317 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:02,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:02,522 INFO L93 Difference]: Finished difference Result 431 states and 755 transitions. [2022-04-15 17:54:02,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:54:02,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 17:54:02,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:54:02,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:02,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-04-15 17:54:02,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:02,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-04-15 17:54:02,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 186 transitions. [2022-04-15 17:54:02,666 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 17:54:02,671 INFO L225 Difference]: With dead ends: 431 [2022-04-15 17:54:02,671 INFO L226 Difference]: Without dead ends: 257 [2022-04-15 17:54:02,672 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 17:54:02,672 INFO L913 BasicCegarLoop]: 92 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:54:02,673 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 99 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:54:02,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-15 17:54:02,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2022-04-15 17:54:02,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:54:02,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand has 255 states, 251 states have (on average 1.7370517928286853) internal successors, (436), 251 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:02,694 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand has 255 states, 251 states have (on average 1.7370517928286853) internal successors, (436), 251 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:02,695 INFO L87 Difference]: Start difference. First operand 257 states. Second operand has 255 states, 251 states have (on average 1.7370517928286853) internal successors, (436), 251 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:02,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:02,701 INFO L93 Difference]: Finished difference Result 257 states and 440 transitions. [2022-04-15 17:54:02,701 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 440 transitions. [2022-04-15 17:54:02,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:02,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:02,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 255 states, 251 states have (on average 1.7370517928286853) internal successors, (436), 251 states have internal predecessors, (436), 2 states have call successors, (2), 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 257 states. [2022-04-15 17:54:02,702 INFO L87 Difference]: Start difference. First operand has 255 states, 251 states have (on average 1.7370517928286853) internal successors, (436), 251 states have internal predecessors, (436), 2 states have call successors, (2), 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 257 states. [2022-04-15 17:54:02,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:02,708 INFO L93 Difference]: Finished difference Result 257 states and 440 transitions. [2022-04-15 17:54:02,708 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 440 transitions. [2022-04-15 17:54:02,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:02,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:02,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:54:02,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:54:02,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 251 states have (on average 1.7370517928286853) internal successors, (436), 251 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:02,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 439 transitions. [2022-04-15 17:54:02,716 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 439 transitions. Word has length 23 [2022-04-15 17:54:02,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:54:02,716 INFO L478 AbstractCegarLoop]: Abstraction has 255 states and 439 transitions. [2022-04-15 17:54:02,717 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:02,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 255 states and 439 transitions. [2022-04-15 17:54:03,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:03,140 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 439 transitions. [2022-04-15 17:54:03,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 17:54:03,141 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:54:03,141 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:54:03,141 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 17:54:03,141 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:54:03,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:54:03,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1957062113, now seen corresponding path program 1 times [2022-04-15 17:54:03,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:03,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [673616022] [2022-04-15 17:54:03,142 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:54:03,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1957062113, now seen corresponding path program 2 times [2022-04-15 17:54:03,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:54:03,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449782766] [2022-04-15 17:54:03,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:54:03,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:54:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:03,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:54:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:03,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {6770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {6764#true} is VALID [2022-04-15 17:54:03,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {6764#true} assume true; {6764#true} is VALID [2022-04-15 17:54:03,180 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6764#true} {6764#true} #200#return; {6764#true} is VALID [2022-04-15 17:54:03,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {6764#true} call ULTIMATE.init(); {6770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:54:03,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {6770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {6764#true} is VALID [2022-04-15 17:54:03,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {6764#true} assume true; {6764#true} is VALID [2022-04-15 17:54:03,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6764#true} {6764#true} #200#return; {6764#true} is VALID [2022-04-15 17:54:03,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {6764#true} call #t~ret15 := main(); {6764#true} is VALID [2022-04-15 17:54:03,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {6764#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;havoc ~cond~0; {6764#true} is VALID [2022-04-15 17:54:03,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {6764#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {6764#true} is VALID [2022-04-15 17:54:03,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {6764#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; {6764#true} is VALID [2022-04-15 17:54:03,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {6764#true} assume !(0 != ~p1~0); {6764#true} is VALID [2022-04-15 17:54:03,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {6764#true} assume !(0 != ~p2~0); {6764#true} is VALID [2022-04-15 17:54:03,182 INFO L290 TraceCheckUtils]: 10: Hoare triple {6764#true} assume 0 != ~p3~0;~lk3~0 := 1; {6769#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:54:03,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {6769#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {6769#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:54:03,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {6769#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {6769#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:54:03,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {6769#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {6769#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:54:03,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {6769#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {6769#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:54:03,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {6769#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {6769#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:54:03,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {6769#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {6769#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:54:03,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {6769#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {6769#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:54:03,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {6769#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {6769#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:54:03,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {6769#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {6769#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:54:03,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {6769#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {6765#false} is VALID [2022-04-15 17:54:03,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {6765#false} assume 0 != ~p4~0; {6765#false} is VALID [2022-04-15 17:54:03,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {6765#false} assume 1 != ~lk4~0; {6765#false} is VALID [2022-04-15 17:54:03,187 INFO L290 TraceCheckUtils]: 23: Hoare triple {6765#false} assume !false; {6765#false} is VALID [2022-04-15 17:54:03,187 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 17:54:03,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:54:03,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449782766] [2022-04-15 17:54:03,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449782766] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:03,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:03,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:03,188 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:54:03,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [673616022] [2022-04-15 17:54:03,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [673616022] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:03,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:03,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:03,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79253096] [2022-04-15 17:54:03,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:54:03,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 17:54:03,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:54:03,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:03,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:03,204 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:54:03,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:03,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:54:03,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:54:03,205 INFO L87 Difference]: Start difference. First operand 255 states and 439 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:03,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:03,390 INFO L93 Difference]: Finished difference Result 385 states and 661 transitions. [2022-04-15 17:54:03,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:54:03,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 17:54:03,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:54:03,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:03,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-15 17:54:03,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:03,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-15 17:54:03,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 181 transitions. [2022-04-15 17:54:03,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:03,537 INFO L225 Difference]: With dead ends: 385 [2022-04-15 17:54:03,537 INFO L226 Difference]: Without dead ends: 263 [2022-04-15 17:54:03,538 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 17:54:03,538 INFO L913 BasicCegarLoop]: 100 mSDtfsCounter, 129 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:54:03,539 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 107 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:54:03,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-04-15 17:54:03,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2022-04-15 17:54:03,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:54:03,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 263 states. Second operand has 261 states, 257 states have (on average 1.7120622568093384) internal successors, (440), 257 states have internal predecessors, (440), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:03,560 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand has 261 states, 257 states have (on average 1.7120622568093384) internal successors, (440), 257 states have internal predecessors, (440), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:03,560 INFO L87 Difference]: Start difference. First operand 263 states. Second operand has 261 states, 257 states have (on average 1.7120622568093384) internal successors, (440), 257 states have internal predecessors, (440), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:03,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:03,567 INFO L93 Difference]: Finished difference Result 263 states and 444 transitions. [2022-04-15 17:54:03,567 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 444 transitions. [2022-04-15 17:54:03,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:03,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:03,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 257 states have (on average 1.7120622568093384) internal successors, (440), 257 states have internal predecessors, (440), 2 states have call successors, (2), 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 263 states. [2022-04-15 17:54:03,572 INFO L87 Difference]: Start difference. First operand has 261 states, 257 states have (on average 1.7120622568093384) internal successors, (440), 257 states have internal predecessors, (440), 2 states have call successors, (2), 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 263 states. [2022-04-15 17:54:03,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:03,579 INFO L93 Difference]: Finished difference Result 263 states and 444 transitions. [2022-04-15 17:54:03,579 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 444 transitions. [2022-04-15 17:54:03,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:03,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:03,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:54:03,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:54:03,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 257 states have (on average 1.7120622568093384) internal successors, (440), 257 states have internal predecessors, (440), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:03,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 443 transitions. [2022-04-15 17:54:03,587 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 443 transitions. Word has length 24 [2022-04-15 17:54:03,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:54:03,587 INFO L478 AbstractCegarLoop]: Abstraction has 261 states and 443 transitions. [2022-04-15 17:54:03,587 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:03,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 261 states and 443 transitions. [2022-04-15 17:54:04,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 443 edges. 443 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:04,025 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 443 transitions. [2022-04-15 17:54:04,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 17:54:04,025 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:54:04,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] [2022-04-15 17:54:04,025 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 17:54:04,026 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:54:04,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:54:04,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1326787933, now seen corresponding path program 1 times [2022-04-15 17:54:04,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:04,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [706922284] [2022-04-15 17:54:04,027 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:54:04,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1326787933, now seen corresponding path program 2 times [2022-04-15 17:54:04,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:54:04,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446199461] [2022-04-15 17:54:04,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:54:04,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:54:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:04,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:54:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:04,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {8600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {8594#true} is VALID [2022-04-15 17:54:04,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {8594#true} assume true; {8594#true} is VALID [2022-04-15 17:54:04,067 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8594#true} {8594#true} #200#return; {8594#true} is VALID [2022-04-15 17:54:04,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {8594#true} call ULTIMATE.init(); {8600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:54:04,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {8600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {8594#true} is VALID [2022-04-15 17:54:04,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {8594#true} assume true; {8594#true} is VALID [2022-04-15 17:54:04,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8594#true} {8594#true} #200#return; {8594#true} is VALID [2022-04-15 17:54:04,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {8594#true} call #t~ret15 := main(); {8594#true} is VALID [2022-04-15 17:54:04,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {8594#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;havoc ~cond~0; {8594#true} is VALID [2022-04-15 17:54:04,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {8594#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {8594#true} is VALID [2022-04-15 17:54:04,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {8594#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; {8594#true} is VALID [2022-04-15 17:54:04,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {8594#true} assume !(0 != ~p1~0); {8594#true} is VALID [2022-04-15 17:54:04,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {8594#true} assume !(0 != ~p2~0); {8594#true} is VALID [2022-04-15 17:54:04,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {8594#true} assume !(0 != ~p3~0); {8594#true} is VALID [2022-04-15 17:54:04,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {8594#true} assume 0 != ~p4~0;~lk4~0 := 1; {8599#(= main_~lk4~0 1)} is VALID [2022-04-15 17:54:04,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {8599#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {8599#(= main_~lk4~0 1)} is VALID [2022-04-15 17:54:04,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {8599#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {8599#(= main_~lk4~0 1)} is VALID [2022-04-15 17:54:04,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {8599#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {8599#(= main_~lk4~0 1)} is VALID [2022-04-15 17:54:04,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {8599#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {8599#(= main_~lk4~0 1)} is VALID [2022-04-15 17:54:04,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {8599#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {8599#(= main_~lk4~0 1)} is VALID [2022-04-15 17:54:04,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {8599#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {8599#(= main_~lk4~0 1)} is VALID [2022-04-15 17:54:04,072 INFO L290 TraceCheckUtils]: 18: Hoare triple {8599#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {8599#(= main_~lk4~0 1)} is VALID [2022-04-15 17:54:04,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {8599#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {8599#(= main_~lk4~0 1)} is VALID [2022-04-15 17:54:04,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {8599#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {8599#(= main_~lk4~0 1)} is VALID [2022-04-15 17:54:04,073 INFO L290 TraceCheckUtils]: 21: Hoare triple {8599#(= main_~lk4~0 1)} assume 0 != ~p4~0; {8599#(= main_~lk4~0 1)} is VALID [2022-04-15 17:54:04,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {8599#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {8595#false} is VALID [2022-04-15 17:54:04,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {8595#false} assume !false; {8595#false} is VALID [2022-04-15 17:54:04,074 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 17:54:04,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:54:04,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446199461] [2022-04-15 17:54:04,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446199461] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:04,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:04,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:04,075 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:54:04,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [706922284] [2022-04-15 17:54:04,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [706922284] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:04,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:04,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:04,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026671303] [2022-04-15 17:54:04,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:54:04,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 17:54:04,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:54:04,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:04,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:04,090 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:54:04,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:04,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:54:04,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:54:04,091 INFO L87 Difference]: Start difference. First operand 261 states and 443 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:04,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:04,285 INFO L93 Difference]: Finished difference Result 477 states and 821 transitions. [2022-04-15 17:54:04,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:54:04,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 17:54:04,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:54:04,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:04,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-15 17:54:04,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:04,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-15 17:54:04,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 119 transitions. [2022-04-15 17:54:04,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:04,390 INFO L225 Difference]: With dead ends: 477 [2022-04-15 17:54:04,390 INFO L226 Difference]: Without dead ends: 475 [2022-04-15 17:54:04,391 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 17:54:04,391 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 147 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:54:04,392 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 75 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:54:04,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-04-15 17:54:04,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 361. [2022-04-15 17:54:04,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:54:04,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 475 states. Second operand has 361 states, 357 states have (on average 1.680672268907563) internal successors, (600), 357 states have internal predecessors, (600), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:04,420 INFO L74 IsIncluded]: Start isIncluded. First operand 475 states. Second operand has 361 states, 357 states have (on average 1.680672268907563) internal successors, (600), 357 states have internal predecessors, (600), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:04,421 INFO L87 Difference]: Start difference. First operand 475 states. Second operand has 361 states, 357 states have (on average 1.680672268907563) internal successors, (600), 357 states have internal predecessors, (600), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:04,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:04,435 INFO L93 Difference]: Finished difference Result 475 states and 812 transitions. [2022-04-15 17:54:04,435 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 812 transitions. [2022-04-15 17:54:04,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:04,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:04,437 INFO L74 IsIncluded]: Start isIncluded. First operand has 361 states, 357 states have (on average 1.680672268907563) internal successors, (600), 357 states have internal predecessors, (600), 2 states have call successors, (2), 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 475 states. [2022-04-15 17:54:04,438 INFO L87 Difference]: Start difference. First operand has 361 states, 357 states have (on average 1.680672268907563) internal successors, (600), 357 states have internal predecessors, (600), 2 states have call successors, (2), 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 475 states. [2022-04-15 17:54:04,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:04,451 INFO L93 Difference]: Finished difference Result 475 states and 812 transitions. [2022-04-15 17:54:04,451 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 812 transitions. [2022-04-15 17:54:04,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:04,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:04,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:54:04,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:54:04,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 357 states have (on average 1.680672268907563) internal successors, (600), 357 states have internal predecessors, (600), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:04,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 603 transitions. [2022-04-15 17:54:04,464 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 603 transitions. Word has length 24 [2022-04-15 17:54:04,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:54:04,464 INFO L478 AbstractCegarLoop]: Abstraction has 361 states and 603 transitions. [2022-04-15 17:54:04,465 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:04,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 361 states and 603 transitions. [2022-04-15 17:54:05,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 603 edges. 603 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:05,026 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 603 transitions. [2022-04-15 17:54:05,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 17:54:05,027 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:54:05,027 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:54:05,027 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 17:54:05,027 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:54:05,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:54:05,028 INFO L85 PathProgramCache]: Analyzing trace with hash 739981919, now seen corresponding path program 1 times [2022-04-15 17:54:05,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:05,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2135364028] [2022-04-15 17:54:05,028 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:54:05,029 INFO L85 PathProgramCache]: Analyzing trace with hash 739981919, now seen corresponding path program 2 times [2022-04-15 17:54:05,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:54:05,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985197905] [2022-04-15 17:54:05,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:54:05,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:54:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:05,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:54:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:05,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {11238#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {11232#true} is VALID [2022-04-15 17:54:05,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {11232#true} assume true; {11232#true} is VALID [2022-04-15 17:54:05,064 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11232#true} {11232#true} #200#return; {11232#true} is VALID [2022-04-15 17:54:05,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {11232#true} call ULTIMATE.init(); {11238#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:54:05,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {11238#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {11232#true} is VALID [2022-04-15 17:54:05,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {11232#true} assume true; {11232#true} is VALID [2022-04-15 17:54:05,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11232#true} {11232#true} #200#return; {11232#true} is VALID [2022-04-15 17:54:05,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {11232#true} call #t~ret15 := main(); {11232#true} is VALID [2022-04-15 17:54:05,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {11232#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;havoc ~cond~0; {11232#true} is VALID [2022-04-15 17:54:05,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {11232#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {11232#true} is VALID [2022-04-15 17:54:05,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {11232#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; {11232#true} is VALID [2022-04-15 17:54:05,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {11232#true} assume !(0 != ~p1~0); {11232#true} is VALID [2022-04-15 17:54:05,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {11232#true} assume !(0 != ~p2~0); {11232#true} is VALID [2022-04-15 17:54:05,066 INFO L290 TraceCheckUtils]: 10: Hoare triple {11232#true} assume !(0 != ~p3~0); {11232#true} is VALID [2022-04-15 17:54:05,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {11232#true} assume !(0 != ~p4~0); {11237#(= main_~p4~0 0)} is VALID [2022-04-15 17:54:05,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {11237#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {11237#(= main_~p4~0 0)} is VALID [2022-04-15 17:54:05,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {11237#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {11237#(= main_~p4~0 0)} is VALID [2022-04-15 17:54:05,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {11237#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {11237#(= main_~p4~0 0)} is VALID [2022-04-15 17:54:05,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {11237#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {11237#(= main_~p4~0 0)} is VALID [2022-04-15 17:54:05,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {11237#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {11237#(= main_~p4~0 0)} is VALID [2022-04-15 17:54:05,069 INFO L290 TraceCheckUtils]: 17: Hoare triple {11237#(= main_~p4~0 0)} assume !(0 != ~p10~0); {11237#(= main_~p4~0 0)} is VALID [2022-04-15 17:54:05,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {11237#(= main_~p4~0 0)} assume !(0 != ~p1~0); {11237#(= main_~p4~0 0)} is VALID [2022-04-15 17:54:05,070 INFO L290 TraceCheckUtils]: 19: Hoare triple {11237#(= main_~p4~0 0)} assume !(0 != ~p2~0); {11237#(= main_~p4~0 0)} is VALID [2022-04-15 17:54:05,070 INFO L290 TraceCheckUtils]: 20: Hoare triple {11237#(= main_~p4~0 0)} assume !(0 != ~p3~0); {11237#(= main_~p4~0 0)} is VALID [2022-04-15 17:54:05,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {11237#(= main_~p4~0 0)} assume 0 != ~p4~0; {11233#false} is VALID [2022-04-15 17:54:05,070 INFO L290 TraceCheckUtils]: 22: Hoare triple {11233#false} assume 1 != ~lk4~0; {11233#false} is VALID [2022-04-15 17:54:05,071 INFO L290 TraceCheckUtils]: 23: Hoare triple {11233#false} assume !false; {11233#false} is VALID [2022-04-15 17:54:05,071 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 17:54:05,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:54:05,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985197905] [2022-04-15 17:54:05,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985197905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:05,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:05,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:05,071 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:54:05,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2135364028] [2022-04-15 17:54:05,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2135364028] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:05,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:05,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:05,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430560974] [2022-04-15 17:54:05,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:54:05,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 17:54:05,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:54:05,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:05,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:05,089 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:54:05,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:05,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:54:05,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:54:05,090 INFO L87 Difference]: Start difference. First operand 361 states and 603 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:05,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:05,357 INFO L93 Difference]: Finished difference Result 845 states and 1421 transitions. [2022-04-15 17:54:05,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:54:05,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 17:54:05,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:54:05,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:05,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-15 17:54:05,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:05,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-15 17:54:05,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 183 transitions. [2022-04-15 17:54:05,480 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 17:54:05,496 INFO L225 Difference]: With dead ends: 845 [2022-04-15 17:54:05,497 INFO L226 Difference]: Without dead ends: 499 [2022-04-15 17:54:05,497 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 17:54:05,498 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 130 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:54:05,498 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 101 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:54:05,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-04-15 17:54:05,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 497. [2022-04-15 17:54:05,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:54:05,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 499 states. Second operand has 497 states, 493 states have (on average 1.6632860040567952) internal successors, (820), 493 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:05,539 INFO L74 IsIncluded]: Start isIncluded. First operand 499 states. Second operand has 497 states, 493 states have (on average 1.6632860040567952) internal successors, (820), 493 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:05,540 INFO L87 Difference]: Start difference. First operand 499 states. Second operand has 497 states, 493 states have (on average 1.6632860040567952) internal successors, (820), 493 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:05,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:05,555 INFO L93 Difference]: Finished difference Result 499 states and 824 transitions. [2022-04-15 17:54:05,555 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 824 transitions. [2022-04-15 17:54:05,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:05,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:05,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 497 states, 493 states have (on average 1.6632860040567952) internal successors, (820), 493 states have internal predecessors, (820), 2 states have call successors, (2), 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 499 states. [2022-04-15 17:54:05,557 INFO L87 Difference]: Start difference. First operand has 497 states, 493 states have (on average 1.6632860040567952) internal successors, (820), 493 states have internal predecessors, (820), 2 states have call successors, (2), 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 499 states. [2022-04-15 17:54:05,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:05,572 INFO L93 Difference]: Finished difference Result 499 states and 824 transitions. [2022-04-15 17:54:05,572 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 824 transitions. [2022-04-15 17:54:05,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:05,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:05,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:54:05,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:54:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 493 states have (on average 1.6632860040567952) internal successors, (820), 493 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:05,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 823 transitions. [2022-04-15 17:54:05,593 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 823 transitions. Word has length 24 [2022-04-15 17:54:05,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:54:05,593 INFO L478 AbstractCegarLoop]: Abstraction has 497 states and 823 transitions. [2022-04-15 17:54:05,593 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:05,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 497 states and 823 transitions. [2022-04-15 17:54:06,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 823 edges. 823 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:06,471 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 823 transitions. [2022-04-15 17:54:06,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 17:54:06,472 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:54:06,472 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:54:06,472 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 17:54:06,472 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:54:06,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:54:06,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1819032631, now seen corresponding path program 1 times [2022-04-15 17:54:06,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:06,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [576130058] [2022-04-15 17:54:06,473 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:54:06,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1819032631, now seen corresponding path program 2 times [2022-04-15 17:54:06,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:54:06,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279203829] [2022-04-15 17:54:06,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:54:06,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:54:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:06,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:54:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:06,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {14932#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {14926#true} is VALID [2022-04-15 17:54:06,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {14926#true} assume true; {14926#true} is VALID [2022-04-15 17:54:06,537 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14926#true} {14926#true} #200#return; {14926#true} is VALID [2022-04-15 17:54:06,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {14926#true} call ULTIMATE.init(); {14932#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:54:06,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {14932#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {14926#true} is VALID [2022-04-15 17:54:06,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {14926#true} assume true; {14926#true} is VALID [2022-04-15 17:54:06,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14926#true} {14926#true} #200#return; {14926#true} is VALID [2022-04-15 17:54:06,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {14926#true} call #t~ret15 := main(); {14926#true} is VALID [2022-04-15 17:54:06,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {14926#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;havoc ~cond~0; {14926#true} is VALID [2022-04-15 17:54:06,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {14926#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {14926#true} is VALID [2022-04-15 17:54:06,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {14926#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; {14926#true} is VALID [2022-04-15 17:54:06,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {14926#true} assume !(0 != ~p1~0); {14926#true} is VALID [2022-04-15 17:54:06,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {14926#true} assume !(0 != ~p2~0); {14926#true} is VALID [2022-04-15 17:54:06,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {14926#true} assume !(0 != ~p3~0); {14926#true} is VALID [2022-04-15 17:54:06,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {14926#true} assume 0 != ~p4~0;~lk4~0 := 1; {14931#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:54:06,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {14931#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {14931#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:54:06,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {14931#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {14931#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:54:06,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {14931#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {14931#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:54:06,541 INFO L290 TraceCheckUtils]: 15: Hoare triple {14931#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {14931#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:54:06,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {14931#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {14931#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:54:06,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {14931#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {14931#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:54:06,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {14931#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {14931#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:54:06,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {14931#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {14931#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:54:06,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {14931#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {14931#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:54:06,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {14931#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {14927#false} is VALID [2022-04-15 17:54:06,543 INFO L290 TraceCheckUtils]: 22: Hoare triple {14927#false} assume 0 != ~p5~0; {14927#false} is VALID [2022-04-15 17:54:06,543 INFO L290 TraceCheckUtils]: 23: Hoare triple {14927#false} assume 1 != ~lk5~0; {14927#false} is VALID [2022-04-15 17:54:06,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {14927#false} assume !false; {14927#false} is VALID [2022-04-15 17:54:06,543 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 17:54:06,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:54:06,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279203829] [2022-04-15 17:54:06,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279203829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:06,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:06,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:06,544 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:54:06,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [576130058] [2022-04-15 17:54:06,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [576130058] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:06,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:06,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:06,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577361934] [2022-04-15 17:54:06,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:54:06,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 17:54:06,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:54:06,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:06,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:06,561 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:54:06,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:06,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:54:06,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:54:06,562 INFO L87 Difference]: Start difference. First operand 497 states and 823 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:06,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:06,795 INFO L93 Difference]: Finished difference Result 745 states and 1229 transitions. [2022-04-15 17:54:06,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:54:06,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 17:54:06,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:54:06,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:06,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2022-04-15 17:54:06,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:06,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2022-04-15 17:54:06,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 178 transitions. [2022-04-15 17:54:06,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:06,960 INFO L225 Difference]: With dead ends: 745 [2022-04-15 17:54:06,960 INFO L226 Difference]: Without dead ends: 507 [2022-04-15 17:54:06,961 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 17:54:06,962 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 128 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:54:06,962 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 104 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:54:06,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-04-15 17:54:06,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 505. [2022-04-15 17:54:06,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:54:07,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 507 states. Second operand has 505 states, 501 states have (on average 1.6367265469061876) internal successors, (820), 501 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:07,002 INFO L74 IsIncluded]: Start isIncluded. First operand 507 states. Second operand has 505 states, 501 states have (on average 1.6367265469061876) internal successors, (820), 501 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:07,002 INFO L87 Difference]: Start difference. First operand 507 states. Second operand has 505 states, 501 states have (on average 1.6367265469061876) internal successors, (820), 501 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:07,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:07,019 INFO L93 Difference]: Finished difference Result 507 states and 824 transitions. [2022-04-15 17:54:07,019 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 824 transitions. [2022-04-15 17:54:07,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:07,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:07,021 INFO L74 IsIncluded]: Start isIncluded. First operand has 505 states, 501 states have (on average 1.6367265469061876) internal successors, (820), 501 states have internal predecessors, (820), 2 states have call successors, (2), 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 507 states. [2022-04-15 17:54:07,022 INFO L87 Difference]: Start difference. First operand has 505 states, 501 states have (on average 1.6367265469061876) internal successors, (820), 501 states have internal predecessors, (820), 2 states have call successors, (2), 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 507 states. [2022-04-15 17:54:07,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:07,037 INFO L93 Difference]: Finished difference Result 507 states and 824 transitions. [2022-04-15 17:54:07,037 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 824 transitions. [2022-04-15 17:54:07,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:07,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:07,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:54:07,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:54:07,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 501 states have (on average 1.6367265469061876) internal successors, (820), 501 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:07,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 823 transitions. [2022-04-15 17:54:07,058 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 823 transitions. Word has length 25 [2022-04-15 17:54:07,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:54:07,058 INFO L478 AbstractCegarLoop]: Abstraction has 505 states and 823 transitions. [2022-04-15 17:54:07,058 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:07,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 505 states and 823 transitions. [2022-04-15 17:54:07,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 823 edges. 823 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:07,839 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 823 transitions. [2022-04-15 17:54:07,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 17:54:07,840 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:54:07,840 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:54:07,840 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 17:54:07,840 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:54:07,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:54:07,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1464817415, now seen corresponding path program 1 times [2022-04-15 17:54:07,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:07,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1165005883] [2022-04-15 17:54:07,841 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:54:07,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1464817415, now seen corresponding path program 2 times [2022-04-15 17:54:07,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:54:07,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761472854] [2022-04-15 17:54:07,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:54:07,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:54:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:07,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:54:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:07,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {18458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {18452#true} is VALID [2022-04-15 17:54:07,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {18452#true} assume true; {18452#true} is VALID [2022-04-15 17:54:07,905 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18452#true} {18452#true} #200#return; {18452#true} is VALID [2022-04-15 17:54:07,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {18452#true} call ULTIMATE.init(); {18458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:54:07,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {18458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {18452#true} is VALID [2022-04-15 17:54:07,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {18452#true} assume true; {18452#true} is VALID [2022-04-15 17:54:07,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18452#true} {18452#true} #200#return; {18452#true} is VALID [2022-04-15 17:54:07,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {18452#true} call #t~ret15 := main(); {18452#true} is VALID [2022-04-15 17:54:07,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {18452#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;havoc ~cond~0; {18452#true} is VALID [2022-04-15 17:54:07,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {18452#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {18452#true} is VALID [2022-04-15 17:54:07,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {18452#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; {18452#true} is VALID [2022-04-15 17:54:07,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {18452#true} assume !(0 != ~p1~0); {18452#true} is VALID [2022-04-15 17:54:07,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {18452#true} assume !(0 != ~p2~0); {18452#true} is VALID [2022-04-15 17:54:07,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {18452#true} assume !(0 != ~p3~0); {18452#true} is VALID [2022-04-15 17:54:07,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {18452#true} assume !(0 != ~p4~0); {18452#true} is VALID [2022-04-15 17:54:07,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {18452#true} assume 0 != ~p5~0;~lk5~0 := 1; {18457#(= main_~lk5~0 1)} is VALID [2022-04-15 17:54:07,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {18457#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {18457#(= main_~lk5~0 1)} is VALID [2022-04-15 17:54:07,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {18457#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {18457#(= main_~lk5~0 1)} is VALID [2022-04-15 17:54:07,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {18457#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {18457#(= main_~lk5~0 1)} is VALID [2022-04-15 17:54:07,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {18457#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {18457#(= main_~lk5~0 1)} is VALID [2022-04-15 17:54:07,910 INFO L290 TraceCheckUtils]: 17: Hoare triple {18457#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {18457#(= main_~lk5~0 1)} is VALID [2022-04-15 17:54:07,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {18457#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {18457#(= main_~lk5~0 1)} is VALID [2022-04-15 17:54:07,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {18457#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {18457#(= main_~lk5~0 1)} is VALID [2022-04-15 17:54:07,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {18457#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {18457#(= main_~lk5~0 1)} is VALID [2022-04-15 17:54:07,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {18457#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {18457#(= main_~lk5~0 1)} is VALID [2022-04-15 17:54:07,912 INFO L290 TraceCheckUtils]: 22: Hoare triple {18457#(= main_~lk5~0 1)} assume 0 != ~p5~0; {18457#(= main_~lk5~0 1)} is VALID [2022-04-15 17:54:07,912 INFO L290 TraceCheckUtils]: 23: Hoare triple {18457#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {18453#false} is VALID [2022-04-15 17:54:07,912 INFO L290 TraceCheckUtils]: 24: Hoare triple {18453#false} assume !false; {18453#false} is VALID [2022-04-15 17:54:07,913 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 17:54:07,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:54:07,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761472854] [2022-04-15 17:54:07,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761472854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:07,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:07,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:07,914 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:54:07,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1165005883] [2022-04-15 17:54:07,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1165005883] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:07,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:07,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:07,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243623096] [2022-04-15 17:54:07,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:54:07,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 17:54:07,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:54:07,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:07,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:07,932 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:54:07,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:07,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:54:07,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:54:07,933 INFO L87 Difference]: Start difference. First operand 505 states and 823 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:08,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:08,216 INFO L93 Difference]: Finished difference Result 909 states and 1505 transitions. [2022-04-15 17:54:08,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:54:08,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 17:54:08,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:54:08,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:08,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-15 17:54:08,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:08,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-15 17:54:08,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-15 17:54:08,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:08,375 INFO L225 Difference]: With dead ends: 909 [2022-04-15 17:54:08,376 INFO L226 Difference]: Without dead ends: 907 [2022-04-15 17:54:08,376 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 17:54:08,377 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 140 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:54:08,377 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 74 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:54:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-04-15 17:54:08,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 713. [2022-04-15 17:54:08,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:54:08,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 907 states. Second operand has 713 states, 709 states have (on average 1.5966149506346967) internal successors, (1132), 709 states have internal predecessors, (1132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:08,435 INFO L74 IsIncluded]: Start isIncluded. First operand 907 states. Second operand has 713 states, 709 states have (on average 1.5966149506346967) internal successors, (1132), 709 states have internal predecessors, (1132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:08,436 INFO L87 Difference]: Start difference. First operand 907 states. Second operand has 713 states, 709 states have (on average 1.5966149506346967) internal successors, (1132), 709 states have internal predecessors, (1132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:08,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:08,479 INFO L93 Difference]: Finished difference Result 907 states and 1488 transitions. [2022-04-15 17:54:08,479 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1488 transitions. [2022-04-15 17:54:08,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:08,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:08,482 INFO L74 IsIncluded]: Start isIncluded. First operand has 713 states, 709 states have (on average 1.5966149506346967) internal successors, (1132), 709 states have internal predecessors, (1132), 2 states have call successors, (2), 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 907 states. [2022-04-15 17:54:08,483 INFO L87 Difference]: Start difference. First operand has 713 states, 709 states have (on average 1.5966149506346967) internal successors, (1132), 709 states have internal predecessors, (1132), 2 states have call successors, (2), 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 907 states. [2022-04-15 17:54:08,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:08,523 INFO L93 Difference]: Finished difference Result 907 states and 1488 transitions. [2022-04-15 17:54:08,524 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1488 transitions. [2022-04-15 17:54:08,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:08,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:08,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:54:08,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:54:08,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 709 states have (on average 1.5966149506346967) internal successors, (1132), 709 states have internal predecessors, (1132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:08,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1135 transitions. [2022-04-15 17:54:08,562 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1135 transitions. Word has length 25 [2022-04-15 17:54:08,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:54:08,562 INFO L478 AbstractCegarLoop]: Abstraction has 713 states and 1135 transitions. [2022-04-15 17:54:08,562 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:08,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 713 states and 1135 transitions. [2022-04-15 17:54:09,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1135 edges. 1135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:09,726 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1135 transitions. [2022-04-15 17:54:09,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 17:54:09,727 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:54:09,727 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:54:09,727 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 17:54:09,728 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:54:09,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:54:09,728 INFO L85 PathProgramCache]: Analyzing trace with hash 878011401, now seen corresponding path program 1 times [2022-04-15 17:54:09,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:09,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1377599435] [2022-04-15 17:54:09,729 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:54:09,729 INFO L85 PathProgramCache]: Analyzing trace with hash 878011401, now seen corresponding path program 2 times [2022-04-15 17:54:09,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:54:09,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769769004] [2022-04-15 17:54:09,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:54:09,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:54:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:09,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:54:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:09,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {23528#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {23522#true} is VALID [2022-04-15 17:54:09,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {23522#true} assume true; {23522#true} is VALID [2022-04-15 17:54:09,769 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23522#true} {23522#true} #200#return; {23522#true} is VALID [2022-04-15 17:54:09,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {23522#true} call ULTIMATE.init(); {23528#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:54:09,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {23528#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {23522#true} is VALID [2022-04-15 17:54:09,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {23522#true} assume true; {23522#true} is VALID [2022-04-15 17:54:09,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23522#true} {23522#true} #200#return; {23522#true} is VALID [2022-04-15 17:54:09,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {23522#true} call #t~ret15 := main(); {23522#true} is VALID [2022-04-15 17:54:09,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {23522#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;havoc ~cond~0; {23522#true} is VALID [2022-04-15 17:54:09,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {23522#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {23522#true} is VALID [2022-04-15 17:54:09,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {23522#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; {23522#true} is VALID [2022-04-15 17:54:09,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {23522#true} assume !(0 != ~p1~0); {23522#true} is VALID [2022-04-15 17:54:09,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {23522#true} assume !(0 != ~p2~0); {23522#true} is VALID [2022-04-15 17:54:09,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {23522#true} assume !(0 != ~p3~0); {23522#true} is VALID [2022-04-15 17:54:09,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {23522#true} assume !(0 != ~p4~0); {23522#true} is VALID [2022-04-15 17:54:09,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {23522#true} assume !(0 != ~p5~0); {23527#(= main_~p5~0 0)} is VALID [2022-04-15 17:54:09,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {23527#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {23527#(= main_~p5~0 0)} is VALID [2022-04-15 17:54:09,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {23527#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {23527#(= main_~p5~0 0)} is VALID [2022-04-15 17:54:09,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {23527#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {23527#(= main_~p5~0 0)} is VALID [2022-04-15 17:54:09,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {23527#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {23527#(= main_~p5~0 0)} is VALID [2022-04-15 17:54:09,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {23527#(= main_~p5~0 0)} assume !(0 != ~p10~0); {23527#(= main_~p5~0 0)} is VALID [2022-04-15 17:54:09,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {23527#(= main_~p5~0 0)} assume !(0 != ~p1~0); {23527#(= main_~p5~0 0)} is VALID [2022-04-15 17:54:09,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {23527#(= main_~p5~0 0)} assume !(0 != ~p2~0); {23527#(= main_~p5~0 0)} is VALID [2022-04-15 17:54:09,774 INFO L290 TraceCheckUtils]: 20: Hoare triple {23527#(= main_~p5~0 0)} assume !(0 != ~p3~0); {23527#(= main_~p5~0 0)} is VALID [2022-04-15 17:54:09,774 INFO L290 TraceCheckUtils]: 21: Hoare triple {23527#(= main_~p5~0 0)} assume !(0 != ~p4~0); {23527#(= main_~p5~0 0)} is VALID [2022-04-15 17:54:09,774 INFO L290 TraceCheckUtils]: 22: Hoare triple {23527#(= main_~p5~0 0)} assume 0 != ~p5~0; {23523#false} is VALID [2022-04-15 17:54:09,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {23523#false} assume 1 != ~lk5~0; {23523#false} is VALID [2022-04-15 17:54:09,775 INFO L290 TraceCheckUtils]: 24: Hoare triple {23523#false} assume !false; {23523#false} is VALID [2022-04-15 17:54:09,775 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 17:54:09,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:54:09,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769769004] [2022-04-15 17:54:09,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769769004] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:09,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:09,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:09,776 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:54:09,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1377599435] [2022-04-15 17:54:09,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1377599435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:09,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:09,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:09,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586326264] [2022-04-15 17:54:09,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:54:09,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 17:54:09,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:54:09,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:09,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:09,792 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:54:09,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:09,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:54:09,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:54:09,793 INFO L87 Difference]: Start difference. First operand 713 states and 1135 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:10,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:10,220 INFO L93 Difference]: Finished difference Result 1661 states and 2657 transitions. [2022-04-15 17:54:10,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:54:10,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 17:54:10,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:54:10,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:10,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2022-04-15 17:54:10,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:10,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2022-04-15 17:54:10,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 180 transitions. [2022-04-15 17:54:10,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:10,407 INFO L225 Difference]: With dead ends: 1661 [2022-04-15 17:54:10,407 INFO L226 Difference]: Without dead ends: 971 [2022-04-15 17:54:10,409 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 17:54:10,411 INFO L913 BasicCegarLoop]: 96 mSDtfsCounter, 124 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:54:10,411 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 103 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:54:10,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2022-04-15 17:54:10,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 969. [2022-04-15 17:54:10,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:54:10,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 971 states. Second operand has 969 states, 965 states have (on average 1.5792746113989637) internal successors, (1524), 965 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:10,517 INFO L74 IsIncluded]: Start isIncluded. First operand 971 states. Second operand has 969 states, 965 states have (on average 1.5792746113989637) internal successors, (1524), 965 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:10,518 INFO L87 Difference]: Start difference. First operand 971 states. Second operand has 969 states, 965 states have (on average 1.5792746113989637) internal successors, (1524), 965 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:10,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:10,565 INFO L93 Difference]: Finished difference Result 971 states and 1528 transitions. [2022-04-15 17:54:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1528 transitions. [2022-04-15 17:54:10,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:10,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:10,571 INFO L74 IsIncluded]: Start isIncluded. First operand has 969 states, 965 states have (on average 1.5792746113989637) internal successors, (1524), 965 states have internal predecessors, (1524), 2 states have call successors, (2), 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 971 states. [2022-04-15 17:54:10,572 INFO L87 Difference]: Start difference. First operand has 969 states, 965 states have (on average 1.5792746113989637) internal successors, (1524), 965 states have internal predecessors, (1524), 2 states have call successors, (2), 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 971 states. [2022-04-15 17:54:10,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:10,618 INFO L93 Difference]: Finished difference Result 971 states and 1528 transitions. [2022-04-15 17:54:10,619 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1528 transitions. [2022-04-15 17:54:10,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:10,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:10,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:54:10,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:54:10,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 965 states have (on average 1.5792746113989637) internal successors, (1524), 965 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:10,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1527 transitions. [2022-04-15 17:54:10,692 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1527 transitions. Word has length 25 [2022-04-15 17:54:10,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:54:10,692 INFO L478 AbstractCegarLoop]: Abstraction has 969 states and 1527 transitions. [2022-04-15 17:54:10,696 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:10,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 969 states and 1527 transitions. [2022-04-15 17:54:12,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1527 edges. 1527 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:12,182 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1527 transitions. [2022-04-15 17:54:12,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 17:54:12,183 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:54:12,183 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 17:54:12,183 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 17:54:12,183 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:54:12,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:54:12,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1835085644, now seen corresponding path program 1 times [2022-04-15 17:54:12,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:12,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1538993570] [2022-04-15 17:54:12,184 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:54:12,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1835085644, now seen corresponding path program 2 times [2022-04-15 17:54:12,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:54:12,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318474471] [2022-04-15 17:54:12,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:54:12,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:54:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:12,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:54:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:12,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {30742#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {30736#true} is VALID [2022-04-15 17:54:12,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {30736#true} assume true; {30736#true} is VALID [2022-04-15 17:54:12,251 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30736#true} {30736#true} #200#return; {30736#true} is VALID [2022-04-15 17:54:12,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {30736#true} call ULTIMATE.init(); {30742#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:54:12,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {30742#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {30736#true} is VALID [2022-04-15 17:54:12,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {30736#true} assume true; {30736#true} is VALID [2022-04-15 17:54:12,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30736#true} {30736#true} #200#return; {30736#true} is VALID [2022-04-15 17:54:12,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {30736#true} call #t~ret15 := main(); {30736#true} is VALID [2022-04-15 17:54:12,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {30736#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;havoc ~cond~0; {30736#true} is VALID [2022-04-15 17:54:12,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {30736#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {30736#true} is VALID [2022-04-15 17:54:12,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {30736#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; {30736#true} is VALID [2022-04-15 17:54:12,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {30736#true} assume !(0 != ~p1~0); {30736#true} is VALID [2022-04-15 17:54:12,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {30736#true} assume !(0 != ~p2~0); {30736#true} is VALID [2022-04-15 17:54:12,253 INFO L290 TraceCheckUtils]: 10: Hoare triple {30736#true} assume !(0 != ~p3~0); {30736#true} is VALID [2022-04-15 17:54:12,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {30736#true} assume !(0 != ~p4~0); {30736#true} is VALID [2022-04-15 17:54:12,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {30736#true} assume 0 != ~p5~0;~lk5~0 := 1; {30741#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:54:12,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {30741#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {30741#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:54:12,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {30741#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {30741#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:54:12,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {30741#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {30741#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:54:12,255 INFO L290 TraceCheckUtils]: 16: Hoare triple {30741#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {30741#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:54:12,255 INFO L290 TraceCheckUtils]: 17: Hoare triple {30741#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {30741#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:54:12,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {30741#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {30741#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:54:12,256 INFO L290 TraceCheckUtils]: 19: Hoare triple {30741#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {30741#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:54:12,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {30741#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {30741#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:54:12,257 INFO L290 TraceCheckUtils]: 21: Hoare triple {30741#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {30741#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:54:12,258 INFO L290 TraceCheckUtils]: 22: Hoare triple {30741#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {30737#false} is VALID [2022-04-15 17:54:12,258 INFO L290 TraceCheckUtils]: 23: Hoare triple {30737#false} assume 0 != ~p6~0; {30737#false} is VALID [2022-04-15 17:54:12,258 INFO L290 TraceCheckUtils]: 24: Hoare triple {30737#false} assume 1 != ~lk6~0; {30737#false} is VALID [2022-04-15 17:54:12,259 INFO L290 TraceCheckUtils]: 25: Hoare triple {30737#false} assume !false; {30737#false} is VALID [2022-04-15 17:54:12,259 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 17:54:12,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:54:12,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318474471] [2022-04-15 17:54:12,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318474471] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:12,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:12,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:12,260 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:54:12,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1538993570] [2022-04-15 17:54:12,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1538993570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:12,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:12,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:12,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257195794] [2022-04-15 17:54:12,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:54:12,260 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 17:54:12,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:54:12,261 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 17:54:12,278 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 17:54:12,278 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:54:12,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:12,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:54:12,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:54:12,280 INFO L87 Difference]: Start difference. First operand 969 states and 1527 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 17:54:12,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:12,639 INFO L93 Difference]: Finished difference Result 1453 states and 2281 transitions. [2022-04-15 17:54:12,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:54:12,640 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 17:54:12,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:54:12,640 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 17:54:12,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-15 17:54:12,642 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 17:54:12,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-15 17:54:12,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 175 transitions. [2022-04-15 17:54:12,771 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 17:54:12,851 INFO L225 Difference]: With dead ends: 1453 [2022-04-15 17:54:12,851 INFO L226 Difference]: Without dead ends: 987 [2022-04-15 17:54:12,852 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 17:54:12,853 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 127 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:54:12,854 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 101 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:54:12,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2022-04-15 17:54:12,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 985. [2022-04-15 17:54:12,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:54:12,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 987 states. Second operand has 985 states, 981 states have (on average 1.5535168195718654) internal successors, (1524), 981 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:12,937 INFO L74 IsIncluded]: Start isIncluded. First operand 987 states. Second operand has 985 states, 981 states have (on average 1.5535168195718654) internal successors, (1524), 981 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:12,938 INFO L87 Difference]: Start difference. First operand 987 states. Second operand has 985 states, 981 states have (on average 1.5535168195718654) internal successors, (1524), 981 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:12,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:12,981 INFO L93 Difference]: Finished difference Result 987 states and 1528 transitions. [2022-04-15 17:54:12,981 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1528 transitions. [2022-04-15 17:54:12,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:12,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:12,985 INFO L74 IsIncluded]: Start isIncluded. First operand has 985 states, 981 states have (on average 1.5535168195718654) internal successors, (1524), 981 states have internal predecessors, (1524), 2 states have call successors, (2), 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 987 states. [2022-04-15 17:54:12,986 INFO L87 Difference]: Start difference. First operand has 985 states, 981 states have (on average 1.5535168195718654) internal successors, (1524), 981 states have internal predecessors, (1524), 2 states have call successors, (2), 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 987 states. [2022-04-15 17:54:13,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:13,030 INFO L93 Difference]: Finished difference Result 987 states and 1528 transitions. [2022-04-15 17:54:13,030 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1528 transitions. [2022-04-15 17:54:13,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:13,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:13,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:54:13,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:54:13,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 981 states have (on average 1.5535168195718654) internal successors, (1524), 981 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:13,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1527 transitions. [2022-04-15 17:54:13,099 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1527 transitions. Word has length 26 [2022-04-15 17:54:13,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:54:13,099 INFO L478 AbstractCegarLoop]: Abstraction has 985 states and 1527 transitions. [2022-04-15 17:54:13,099 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 17:54:13,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 985 states and 1527 transitions. [2022-04-15 17:54:14,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1527 edges. 1527 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:14,546 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1527 transitions. [2022-04-15 17:54:14,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 17:54:14,548 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:54:14,548 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 17:54:14,548 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 17:54:14,548 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:54:14,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:54:14,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1448764402, now seen corresponding path program 1 times [2022-04-15 17:54:14,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:14,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1042533204] [2022-04-15 17:54:14,549 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:54:14,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1448764402, now seen corresponding path program 2 times [2022-04-15 17:54:14,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:54:14,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48223291] [2022-04-15 17:54:14,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:54:14,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:54:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:14,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:54:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:14,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {37604#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {37598#true} is VALID [2022-04-15 17:54:14,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {37598#true} assume true; {37598#true} is VALID [2022-04-15 17:54:14,581 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37598#true} {37598#true} #200#return; {37598#true} is VALID [2022-04-15 17:54:14,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {37598#true} call ULTIMATE.init(); {37604#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:54:14,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {37604#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {37598#true} is VALID [2022-04-15 17:54:14,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {37598#true} assume true; {37598#true} is VALID [2022-04-15 17:54:14,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37598#true} {37598#true} #200#return; {37598#true} is VALID [2022-04-15 17:54:14,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {37598#true} call #t~ret15 := main(); {37598#true} is VALID [2022-04-15 17:54:14,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {37598#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;havoc ~cond~0; {37598#true} is VALID [2022-04-15 17:54:14,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {37598#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {37598#true} is VALID [2022-04-15 17:54:14,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {37598#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; {37598#true} is VALID [2022-04-15 17:54:14,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {37598#true} assume !(0 != ~p1~0); {37598#true} is VALID [2022-04-15 17:54:14,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {37598#true} assume !(0 != ~p2~0); {37598#true} is VALID [2022-04-15 17:54:14,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {37598#true} assume !(0 != ~p3~0); {37598#true} is VALID [2022-04-15 17:54:14,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {37598#true} assume !(0 != ~p4~0); {37598#true} is VALID [2022-04-15 17:54:14,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {37598#true} assume !(0 != ~p5~0); {37598#true} is VALID [2022-04-15 17:54:14,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {37598#true} assume 0 != ~p6~0;~lk6~0 := 1; {37603#(= main_~lk6~0 1)} is VALID [2022-04-15 17:54:14,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {37603#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {37603#(= main_~lk6~0 1)} is VALID [2022-04-15 17:54:14,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {37603#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {37603#(= main_~lk6~0 1)} is VALID [2022-04-15 17:54:14,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {37603#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {37603#(= main_~lk6~0 1)} is VALID [2022-04-15 17:54:14,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {37603#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {37603#(= main_~lk6~0 1)} is VALID [2022-04-15 17:54:14,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {37603#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {37603#(= main_~lk6~0 1)} is VALID [2022-04-15 17:54:14,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {37603#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {37603#(= main_~lk6~0 1)} is VALID [2022-04-15 17:54:14,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {37603#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {37603#(= main_~lk6~0 1)} is VALID [2022-04-15 17:54:14,586 INFO L290 TraceCheckUtils]: 21: Hoare triple {37603#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {37603#(= main_~lk6~0 1)} is VALID [2022-04-15 17:54:14,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {37603#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {37603#(= main_~lk6~0 1)} is VALID [2022-04-15 17:54:14,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {37603#(= main_~lk6~0 1)} assume 0 != ~p6~0; {37603#(= main_~lk6~0 1)} is VALID [2022-04-15 17:54:14,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {37603#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {37599#false} is VALID [2022-04-15 17:54:14,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {37599#false} assume !false; {37599#false} is VALID [2022-04-15 17:54:14,588 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 17:54:14,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:54:14,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48223291] [2022-04-15 17:54:14,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48223291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:14,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:14,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:14,588 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:54:14,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1042533204] [2022-04-15 17:54:14,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1042533204] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:14,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:14,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:14,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362723463] [2022-04-15 17:54:14,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:54:14,589 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 17:54:14,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:54:14,589 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 17:54:14,605 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 17:54:14,605 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:54:14,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:14,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:54:14,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:54:14,606 INFO L87 Difference]: Start difference. First operand 985 states and 1527 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 17:54:15,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:15,022 INFO L93 Difference]: Finished difference Result 1741 states and 2745 transitions. [2022-04-15 17:54:15,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:54:15,022 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 17:54:15,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:54:15,022 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 17:54:15,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-15 17:54:15,024 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 17:54:15,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-15 17:54:15,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-04-15 17:54:15,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:15,245 INFO L225 Difference]: With dead ends: 1741 [2022-04-15 17:54:15,245 INFO L226 Difference]: Without dead ends: 1739 [2022-04-15 17:54:15,245 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 17:54:15,246 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 133 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:54:15,246 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 73 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:54:15,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2022-04-15 17:54:15,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1417. [2022-04-15 17:54:15,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:54:15,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1739 states. Second operand has 1417 states, 1413 states have (on average 1.5088464260438783) internal successors, (2132), 1413 states have internal predecessors, (2132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:15,374 INFO L74 IsIncluded]: Start isIncluded. First operand 1739 states. Second operand has 1417 states, 1413 states have (on average 1.5088464260438783) internal successors, (2132), 1413 states have internal predecessors, (2132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:15,376 INFO L87 Difference]: Start difference. First operand 1739 states. Second operand has 1417 states, 1413 states have (on average 1.5088464260438783) internal successors, (2132), 1413 states have internal predecessors, (2132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:15,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:15,487 INFO L93 Difference]: Finished difference Result 1739 states and 2712 transitions. [2022-04-15 17:54:15,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2712 transitions. [2022-04-15 17:54:15,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:15,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:15,492 INFO L74 IsIncluded]: Start isIncluded. First operand has 1417 states, 1413 states have (on average 1.5088464260438783) internal successors, (2132), 1413 states have internal predecessors, (2132), 2 states have call successors, (2), 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 1739 states. [2022-04-15 17:54:15,494 INFO L87 Difference]: Start difference. First operand has 1417 states, 1413 states have (on average 1.5088464260438783) internal successors, (2132), 1413 states have internal predecessors, (2132), 2 states have call successors, (2), 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 1739 states. [2022-04-15 17:54:15,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:15,628 INFO L93 Difference]: Finished difference Result 1739 states and 2712 transitions. [2022-04-15 17:54:15,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2712 transitions. [2022-04-15 17:54:15,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:15,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:15,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:54:15,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:54:15,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 1413 states have (on average 1.5088464260438783) internal successors, (2132), 1413 states have internal predecessors, (2132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 2135 transitions. [2022-04-15 17:54:15,774 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 2135 transitions. Word has length 26 [2022-04-15 17:54:15,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:54:15,774 INFO L478 AbstractCegarLoop]: Abstraction has 1417 states and 2135 transitions. [2022-04-15 17:54:15,775 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 17:54:15,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1417 states and 2135 transitions. [2022-04-15 17:54:17,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2135 edges. 2135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:17,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 2135 transitions. [2022-04-15 17:54:17,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 17:54:17,884 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:54:17,884 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 17:54:17,884 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 17:54:17,885 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:54:17,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:54:17,885 INFO L85 PathProgramCache]: Analyzing trace with hash 861958388, now seen corresponding path program 1 times [2022-04-15 17:54:17,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:17,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1736629716] [2022-04-15 17:54:17,885 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:54:17,886 INFO L85 PathProgramCache]: Analyzing trace with hash 861958388, now seen corresponding path program 2 times [2022-04-15 17:54:17,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:54:17,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706790825] [2022-04-15 17:54:17,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:54:17,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:54:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:17,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:54:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:17,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {47410#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {47404#true} is VALID [2022-04-15 17:54:17,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {47404#true} assume true; {47404#true} is VALID [2022-04-15 17:54:17,937 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47404#true} {47404#true} #200#return; {47404#true} is VALID [2022-04-15 17:54:17,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {47404#true} call ULTIMATE.init(); {47410#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:54:17,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {47410#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {47404#true} is VALID [2022-04-15 17:54:17,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {47404#true} assume true; {47404#true} is VALID [2022-04-15 17:54:17,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47404#true} {47404#true} #200#return; {47404#true} is VALID [2022-04-15 17:54:17,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {47404#true} call #t~ret15 := main(); {47404#true} is VALID [2022-04-15 17:54:17,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {47404#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;havoc ~cond~0; {47404#true} is VALID [2022-04-15 17:54:17,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {47404#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {47404#true} is VALID [2022-04-15 17:54:17,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {47404#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; {47404#true} is VALID [2022-04-15 17:54:17,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {47404#true} assume !(0 != ~p1~0); {47404#true} is VALID [2022-04-15 17:54:17,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {47404#true} assume !(0 != ~p2~0); {47404#true} is VALID [2022-04-15 17:54:17,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {47404#true} assume !(0 != ~p3~0); {47404#true} is VALID [2022-04-15 17:54:17,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {47404#true} assume !(0 != ~p4~0); {47404#true} is VALID [2022-04-15 17:54:17,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {47404#true} assume !(0 != ~p5~0); {47404#true} is VALID [2022-04-15 17:54:17,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {47404#true} assume !(0 != ~p6~0); {47409#(= main_~p6~0 0)} is VALID [2022-04-15 17:54:17,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {47409#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {47409#(= main_~p6~0 0)} is VALID [2022-04-15 17:54:17,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {47409#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {47409#(= main_~p6~0 0)} is VALID [2022-04-15 17:54:17,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {47409#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {47409#(= main_~p6~0 0)} is VALID [2022-04-15 17:54:17,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {47409#(= main_~p6~0 0)} assume !(0 != ~p10~0); {47409#(= main_~p6~0 0)} is VALID [2022-04-15 17:54:17,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {47409#(= main_~p6~0 0)} assume !(0 != ~p1~0); {47409#(= main_~p6~0 0)} is VALID [2022-04-15 17:54:17,942 INFO L290 TraceCheckUtils]: 19: Hoare triple {47409#(= main_~p6~0 0)} assume !(0 != ~p2~0); {47409#(= main_~p6~0 0)} is VALID [2022-04-15 17:54:17,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {47409#(= main_~p6~0 0)} assume !(0 != ~p3~0); {47409#(= main_~p6~0 0)} is VALID [2022-04-15 17:54:17,943 INFO L290 TraceCheckUtils]: 21: Hoare triple {47409#(= main_~p6~0 0)} assume !(0 != ~p4~0); {47409#(= main_~p6~0 0)} is VALID [2022-04-15 17:54:17,943 INFO L290 TraceCheckUtils]: 22: Hoare triple {47409#(= main_~p6~0 0)} assume !(0 != ~p5~0); {47409#(= main_~p6~0 0)} is VALID [2022-04-15 17:54:17,944 INFO L290 TraceCheckUtils]: 23: Hoare triple {47409#(= main_~p6~0 0)} assume 0 != ~p6~0; {47405#false} is VALID [2022-04-15 17:54:17,944 INFO L290 TraceCheckUtils]: 24: Hoare triple {47405#false} assume 1 != ~lk6~0; {47405#false} is VALID [2022-04-15 17:54:17,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {47405#false} assume !false; {47405#false} is VALID [2022-04-15 17:54:17,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:54:17,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:54:17,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706790825] [2022-04-15 17:54:17,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706790825] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:17,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:17,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:17,945 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:54:17,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1736629716] [2022-04-15 17:54:17,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1736629716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:17,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:17,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:17,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286945405] [2022-04-15 17:54:17,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:54:17,946 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 17:54:17,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:54:17,946 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 17:54:17,963 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 17:54:17,963 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:54:17,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:17,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:54:17,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:54:17,964 INFO L87 Difference]: Start difference. First operand 1417 states and 2135 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 17:54:18,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:18,728 INFO L93 Difference]: Finished difference Result 3277 states and 4953 transitions. [2022-04-15 17:54:18,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:54:18,728 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 17:54:18,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:54:18,728 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 17:54:18,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2022-04-15 17:54:18,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:18,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2022-04-15 17:54:18,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 177 transitions. [2022-04-15 17:54:18,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:19,013 INFO L225 Difference]: With dead ends: 3277 [2022-04-15 17:54:19,013 INFO L226 Difference]: Without dead ends: 1899 [2022-04-15 17:54:19,015 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 17:54:19,015 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:54:19,015 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 105 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:54:19,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2022-04-15 17:54:19,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1897. [2022-04-15 17:54:19,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:54:19,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1899 states. Second operand has 1897 states, 1893 states have (on average 1.4896988906497624) internal successors, (2820), 1893 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:19,213 INFO L74 IsIncluded]: Start isIncluded. First operand 1899 states. Second operand has 1897 states, 1893 states have (on average 1.4896988906497624) internal successors, (2820), 1893 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:19,214 INFO L87 Difference]: Start difference. First operand 1899 states. Second operand has 1897 states, 1893 states have (on average 1.4896988906497624) internal successors, (2820), 1893 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:19,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:19,360 INFO L93 Difference]: Finished difference Result 1899 states and 2824 transitions. [2022-04-15 17:54:19,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2824 transitions. [2022-04-15 17:54:19,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:19,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:19,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 1897 states, 1893 states have (on average 1.4896988906497624) internal successors, (2820), 1893 states have internal predecessors, (2820), 2 states have call successors, (2), 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 1899 states. [2022-04-15 17:54:19,367 INFO L87 Difference]: Start difference. First operand has 1897 states, 1893 states have (on average 1.4896988906497624) internal successors, (2820), 1893 states have internal predecessors, (2820), 2 states have call successors, (2), 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 1899 states. [2022-04-15 17:54:19,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:19,509 INFO L93 Difference]: Finished difference Result 1899 states and 2824 transitions. [2022-04-15 17:54:19,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2824 transitions. [2022-04-15 17:54:19,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:19,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:19,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:54:19,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:54:19,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1893 states have (on average 1.4896988906497624) internal successors, (2820), 1893 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:19,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2823 transitions. [2022-04-15 17:54:19,764 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2823 transitions. Word has length 26 [2022-04-15 17:54:19,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:54:19,764 INFO L478 AbstractCegarLoop]: Abstraction has 1897 states and 2823 transitions. [2022-04-15 17:54:19,765 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 17:54:19,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1897 states and 2823 transitions. [2022-04-15 17:54:22,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2823 edges. 2823 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:22,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2823 transitions. [2022-04-15 17:54:22,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 17:54:22,613 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:54:22,613 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 17:54:22,613 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 17:54:22,613 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:54:22,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:54:22,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1962238590, now seen corresponding path program 1 times [2022-04-15 17:54:22,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:22,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1397005067] [2022-04-15 17:54:22,614 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:54:22,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1962238590, now seen corresponding path program 2 times [2022-04-15 17:54:22,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:54:22,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774419360] [2022-04-15 17:54:22,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:54:22,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:54:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:22,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:54:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:22,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {61568#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {61562#true} is VALID [2022-04-15 17:54:22,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {61562#true} assume true; {61562#true} is VALID [2022-04-15 17:54:22,674 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61562#true} {61562#true} #200#return; {61562#true} is VALID [2022-04-15 17:54:22,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {61562#true} call ULTIMATE.init(); {61568#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:54:22,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {61568#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {61562#true} is VALID [2022-04-15 17:54:22,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {61562#true} assume true; {61562#true} is VALID [2022-04-15 17:54:22,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61562#true} {61562#true} #200#return; {61562#true} is VALID [2022-04-15 17:54:22,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {61562#true} call #t~ret15 := main(); {61562#true} is VALID [2022-04-15 17:54:22,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {61562#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;havoc ~cond~0; {61562#true} is VALID [2022-04-15 17:54:22,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {61562#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {61562#true} is VALID [2022-04-15 17:54:22,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {61562#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; {61562#true} is VALID [2022-04-15 17:54:22,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {61562#true} assume !(0 != ~p1~0); {61562#true} is VALID [2022-04-15 17:54:22,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {61562#true} assume !(0 != ~p2~0); {61562#true} is VALID [2022-04-15 17:54:22,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {61562#true} assume !(0 != ~p3~0); {61562#true} is VALID [2022-04-15 17:54:22,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {61562#true} assume !(0 != ~p4~0); {61562#true} is VALID [2022-04-15 17:54:22,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {61562#true} assume !(0 != ~p5~0); {61562#true} is VALID [2022-04-15 17:54:22,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {61562#true} assume 0 != ~p6~0;~lk6~0 := 1; {61567#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:54:22,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {61567#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {61567#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:54:22,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {61567#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {61567#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:54:22,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {61567#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {61567#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:54:22,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {61567#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {61567#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:54:22,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {61567#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {61567#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:54:22,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {61567#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {61567#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:54:22,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {61567#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {61567#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:54:22,680 INFO L290 TraceCheckUtils]: 21: Hoare triple {61567#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {61567#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:54:22,680 INFO L290 TraceCheckUtils]: 22: Hoare triple {61567#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {61567#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:54:22,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {61567#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {61563#false} is VALID [2022-04-15 17:54:22,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {61563#false} assume 0 != ~p7~0; {61563#false} is VALID [2022-04-15 17:54:22,687 INFO L290 TraceCheckUtils]: 25: Hoare triple {61563#false} assume 1 != ~lk7~0; {61563#false} is VALID [2022-04-15 17:54:22,687 INFO L290 TraceCheckUtils]: 26: Hoare triple {61563#false} assume !false; {61563#false} is VALID [2022-04-15 17:54:22,687 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 17:54:22,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:54:22,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774419360] [2022-04-15 17:54:22,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774419360] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:22,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:22,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:22,688 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:54:22,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1397005067] [2022-04-15 17:54:22,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1397005067] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:22,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:22,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:22,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229978470] [2022-04-15 17:54:22,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:54:22,689 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 17:54:22,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:54:22,689 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 17:54:22,710 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 17:54:22,710 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:54:22,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:22,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:54:22,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:54:22,711 INFO L87 Difference]: Start difference. First operand 1897 states and 2823 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 17:54:23,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:23,311 INFO L93 Difference]: Finished difference Result 2845 states and 4217 transitions. [2022-04-15 17:54:23,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:54:23,311 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 17:54:23,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:54:23,311 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 17:54:23,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-15 17:54:23,313 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 17:54:23,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-15 17:54:23,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 172 transitions. [2022-04-15 17:54:23,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:23,576 INFO L225 Difference]: With dead ends: 2845 [2022-04-15 17:54:23,576 INFO L226 Difference]: Without dead ends: 1931 [2022-04-15 17:54:23,577 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 17:54:23,578 INFO L913 BasicCegarLoop]: 91 mSDtfsCounter, 126 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:54:23,578 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 98 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:54:23,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2022-04-15 17:54:23,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1929. [2022-04-15 17:54:23,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:54:23,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1931 states. Second operand has 1929 states, 1925 states have (on average 1.464935064935065) internal successors, (2820), 1925 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:23,779 INFO L74 IsIncluded]: Start isIncluded. First operand 1931 states. Second operand has 1929 states, 1925 states have (on average 1.464935064935065) internal successors, (2820), 1925 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:23,780 INFO L87 Difference]: Start difference. First operand 1931 states. Second operand has 1929 states, 1925 states have (on average 1.464935064935065) internal successors, (2820), 1925 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:23,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:23,876 INFO L93 Difference]: Finished difference Result 1931 states and 2824 transitions. [2022-04-15 17:54:23,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2824 transitions. [2022-04-15 17:54:23,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:23,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:23,881 INFO L74 IsIncluded]: Start isIncluded. First operand has 1929 states, 1925 states have (on average 1.464935064935065) internal successors, (2820), 1925 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1931 states. [2022-04-15 17:54:23,882 INFO L87 Difference]: Start difference. First operand has 1929 states, 1925 states have (on average 1.464935064935065) internal successors, (2820), 1925 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1931 states. [2022-04-15 17:54:23,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:23,991 INFO L93 Difference]: Finished difference Result 1931 states and 2824 transitions. [2022-04-15 17:54:23,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2824 transitions. [2022-04-15 17:54:23,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:23,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:23,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:54:23,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:54:23,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1925 states have (on average 1.464935064935065) internal successors, (2820), 1925 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:24,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2823 transitions. [2022-04-15 17:54:24,183 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2823 transitions. Word has length 27 [2022-04-15 17:54:24,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:54:24,184 INFO L478 AbstractCegarLoop]: Abstraction has 1929 states and 2823 transitions. [2022-04-15 17:54:24,184 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 17:54:24,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1929 states and 2823 transitions. [2022-04-15 17:54:27,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2823 edges. 2823 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:27,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2823 transitions. [2022-04-15 17:54:27,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 17:54:27,099 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:54:27,099 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 17:54:27,099 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 17:54:27,099 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:54:27,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:54:27,100 INFO L85 PathProgramCache]: Analyzing trace with hash 951121340, now seen corresponding path program 1 times [2022-04-15 17:54:27,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:27,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1376405951] [2022-04-15 17:54:27,100 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:54:27,100 INFO L85 PathProgramCache]: Analyzing trace with hash 951121340, now seen corresponding path program 2 times [2022-04-15 17:54:27,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:54:27,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268936719] [2022-04-15 17:54:27,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:54:27,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:54:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:27,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:54:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:27,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {74990#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {74984#true} is VALID [2022-04-15 17:54:27,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {74984#true} assume true; {74984#true} is VALID [2022-04-15 17:54:27,137 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {74984#true} {74984#true} #200#return; {74984#true} is VALID [2022-04-15 17:54:27,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {74984#true} call ULTIMATE.init(); {74990#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:54:27,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {74990#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {74984#true} is VALID [2022-04-15 17:54:27,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {74984#true} assume true; {74984#true} is VALID [2022-04-15 17:54:27,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74984#true} {74984#true} #200#return; {74984#true} is VALID [2022-04-15 17:54:27,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {74984#true} call #t~ret15 := main(); {74984#true} is VALID [2022-04-15 17:54:27,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {74984#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;havoc ~cond~0; {74984#true} is VALID [2022-04-15 17:54:27,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {74984#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {74984#true} is VALID [2022-04-15 17:54:27,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {74984#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; {74984#true} is VALID [2022-04-15 17:54:27,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {74984#true} assume !(0 != ~p1~0); {74984#true} is VALID [2022-04-15 17:54:27,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {74984#true} assume !(0 != ~p2~0); {74984#true} is VALID [2022-04-15 17:54:27,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {74984#true} assume !(0 != ~p3~0); {74984#true} is VALID [2022-04-15 17:54:27,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {74984#true} assume !(0 != ~p4~0); {74984#true} is VALID [2022-04-15 17:54:27,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {74984#true} assume !(0 != ~p5~0); {74984#true} is VALID [2022-04-15 17:54:27,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {74984#true} assume !(0 != ~p6~0); {74984#true} is VALID [2022-04-15 17:54:27,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {74984#true} assume 0 != ~p7~0;~lk7~0 := 1; {74989#(= main_~lk7~0 1)} is VALID [2022-04-15 17:54:27,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {74989#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {74989#(= main_~lk7~0 1)} is VALID [2022-04-15 17:54:27,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {74989#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {74989#(= main_~lk7~0 1)} is VALID [2022-04-15 17:54:27,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {74989#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {74989#(= main_~lk7~0 1)} is VALID [2022-04-15 17:54:27,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {74989#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {74989#(= main_~lk7~0 1)} is VALID [2022-04-15 17:54:27,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {74989#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {74989#(= main_~lk7~0 1)} is VALID [2022-04-15 17:54:27,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {74989#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {74989#(= main_~lk7~0 1)} is VALID [2022-04-15 17:54:27,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {74989#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {74989#(= main_~lk7~0 1)} is VALID [2022-04-15 17:54:27,143 INFO L290 TraceCheckUtils]: 22: Hoare triple {74989#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {74989#(= main_~lk7~0 1)} is VALID [2022-04-15 17:54:27,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {74989#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {74989#(= main_~lk7~0 1)} is VALID [2022-04-15 17:54:27,144 INFO L290 TraceCheckUtils]: 24: Hoare triple {74989#(= main_~lk7~0 1)} assume 0 != ~p7~0; {74989#(= main_~lk7~0 1)} is VALID [2022-04-15 17:54:27,144 INFO L290 TraceCheckUtils]: 25: Hoare triple {74989#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {74985#false} is VALID [2022-04-15 17:54:27,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {74985#false} assume !false; {74985#false} is VALID [2022-04-15 17:54:27,145 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 17:54:27,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:54:27,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268936719] [2022-04-15 17:54:27,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268936719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:27,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:27,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:27,145 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:54:27,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1376405951] [2022-04-15 17:54:27,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1376405951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:27,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:27,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:27,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371687723] [2022-04-15 17:54:27,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:54:27,146 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 17:54:27,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:54:27,146 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 17:54:27,162 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 17:54:27,162 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:54:27,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:27,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:54:27,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:54:27,163 INFO L87 Difference]: Start difference. First operand 1929 states and 2823 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 17:54:28,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:28,051 INFO L93 Difference]: Finished difference Result 3341 states and 4969 transitions. [2022-04-15 17:54:28,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:54:28,051 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 17:54:28,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:54:28,051 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 17:54:28,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-15 17:54:28,052 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 17:54:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-15 17:54:28,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 107 transitions. [2022-04-15 17:54:28,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:28,621 INFO L225 Difference]: With dead ends: 3341 [2022-04-15 17:54:28,621 INFO L226 Difference]: Without dead ends: 3339 [2022-04-15 17:54:28,622 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 17:54:28,622 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 126 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:54:28,623 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 72 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:54:28,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2022-04-15 17:54:28,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 2825. [2022-04-15 17:54:28,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:54:28,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3339 states. Second operand has 2825 states, 2821 states have (on average 1.4193548387096775) internal successors, (4004), 2821 states have internal predecessors, (4004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:28,843 INFO L74 IsIncluded]: Start isIncluded. First operand 3339 states. Second operand has 2825 states, 2821 states have (on average 1.4193548387096775) internal successors, (4004), 2821 states have internal predecessors, (4004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:28,844 INFO L87 Difference]: Start difference. First operand 3339 states. Second operand has 2825 states, 2821 states have (on average 1.4193548387096775) internal successors, (4004), 2821 states have internal predecessors, (4004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:29,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:29,179 INFO L93 Difference]: Finished difference Result 3339 states and 4904 transitions. [2022-04-15 17:54:29,179 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4904 transitions. [2022-04-15 17:54:29,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:29,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:29,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 2825 states, 2821 states have (on average 1.4193548387096775) internal successors, (4004), 2821 states have internal predecessors, (4004), 2 states have call successors, (2), 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 3339 states. [2022-04-15 17:54:29,187 INFO L87 Difference]: Start difference. First operand has 2825 states, 2821 states have (on average 1.4193548387096775) internal successors, (4004), 2821 states have internal predecessors, (4004), 2 states have call successors, (2), 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 3339 states. [2022-04-15 17:54:29,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:29,519 INFO L93 Difference]: Finished difference Result 3339 states and 4904 transitions. [2022-04-15 17:54:29,519 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4904 transitions. [2022-04-15 17:54:29,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:29,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:29,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:54:29,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:54:29,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2825 states, 2821 states have (on average 1.4193548387096775) internal successors, (4004), 2821 states have internal predecessors, (4004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:29,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 4007 transitions. [2022-04-15 17:54:29,859 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 4007 transitions. Word has length 27 [2022-04-15 17:54:29,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:54:29,860 INFO L478 AbstractCegarLoop]: Abstraction has 2825 states and 4007 transitions. [2022-04-15 17:54:29,860 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 17:54:29,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2825 states and 4007 transitions. [2022-04-15 17:54:33,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4007 edges. 4007 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:33,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 4007 transitions. [2022-04-15 17:54:33,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 17:54:33,953 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:54:33,953 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 17:54:33,953 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 17:54:33,954 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:54:33,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:54:33,954 INFO L85 PathProgramCache]: Analyzing trace with hash 364315326, now seen corresponding path program 1 times [2022-04-15 17:54:33,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:33,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2129792583] [2022-04-15 17:54:33,954 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:54:33,955 INFO L85 PathProgramCache]: Analyzing trace with hash 364315326, now seen corresponding path program 2 times [2022-04-15 17:54:33,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:54:33,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069135445] [2022-04-15 17:54:33,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:54:33,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:54:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:34,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:54:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:34,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {94012#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {94006#true} is VALID [2022-04-15 17:54:34,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {94006#true} assume true; {94006#true} is VALID [2022-04-15 17:54:34,021 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {94006#true} {94006#true} #200#return; {94006#true} is VALID [2022-04-15 17:54:34,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {94006#true} call ULTIMATE.init(); {94012#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:54:34,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {94012#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {94006#true} is VALID [2022-04-15 17:54:34,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {94006#true} assume true; {94006#true} is VALID [2022-04-15 17:54:34,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94006#true} {94006#true} #200#return; {94006#true} is VALID [2022-04-15 17:54:34,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {94006#true} call #t~ret15 := main(); {94006#true} is VALID [2022-04-15 17:54:34,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {94006#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;havoc ~cond~0; {94006#true} is VALID [2022-04-15 17:54:34,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {94006#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {94006#true} is VALID [2022-04-15 17:54:34,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {94006#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; {94006#true} is VALID [2022-04-15 17:54:34,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {94006#true} assume !(0 != ~p1~0); {94006#true} is VALID [2022-04-15 17:54:34,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {94006#true} assume !(0 != ~p2~0); {94006#true} is VALID [2022-04-15 17:54:34,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {94006#true} assume !(0 != ~p3~0); {94006#true} is VALID [2022-04-15 17:54:34,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {94006#true} assume !(0 != ~p4~0); {94006#true} is VALID [2022-04-15 17:54:34,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {94006#true} assume !(0 != ~p5~0); {94006#true} is VALID [2022-04-15 17:54:34,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {94006#true} assume !(0 != ~p6~0); {94006#true} is VALID [2022-04-15 17:54:34,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {94006#true} assume !(0 != ~p7~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-15 17:54:34,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {94011#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {94011#(= main_~p7~0 0)} is VALID [2022-04-15 17:54:34,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {94011#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {94011#(= main_~p7~0 0)} is VALID [2022-04-15 17:54:34,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {94011#(= main_~p7~0 0)} assume !(0 != ~p10~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-15 17:54:34,025 INFO L290 TraceCheckUtils]: 18: Hoare triple {94011#(= main_~p7~0 0)} assume !(0 != ~p1~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-15 17:54:34,025 INFO L290 TraceCheckUtils]: 19: Hoare triple {94011#(= main_~p7~0 0)} assume !(0 != ~p2~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-15 17:54:34,025 INFO L290 TraceCheckUtils]: 20: Hoare triple {94011#(= main_~p7~0 0)} assume !(0 != ~p3~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-15 17:54:34,026 INFO L290 TraceCheckUtils]: 21: Hoare triple {94011#(= main_~p7~0 0)} assume !(0 != ~p4~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-15 17:54:34,026 INFO L290 TraceCheckUtils]: 22: Hoare triple {94011#(= main_~p7~0 0)} assume !(0 != ~p5~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-15 17:54:34,030 INFO L290 TraceCheckUtils]: 23: Hoare triple {94011#(= main_~p7~0 0)} assume !(0 != ~p6~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-15 17:54:34,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {94011#(= main_~p7~0 0)} assume 0 != ~p7~0; {94007#false} is VALID [2022-04-15 17:54:34,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {94007#false} assume 1 != ~lk7~0; {94007#false} is VALID [2022-04-15 17:54:34,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {94007#false} assume !false; {94007#false} is VALID [2022-04-15 17:54:34,031 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 17:54:34,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:54:34,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069135445] [2022-04-15 17:54:34,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069135445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:34,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:34,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:34,031 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:54:34,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2129792583] [2022-04-15 17:54:34,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2129792583] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:34,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:34,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:34,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826560548] [2022-04-15 17:54:34,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:54:34,032 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 17:54:34,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:54:34,033 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 17:54:34,054 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 17:54:34,054 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:54:34,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:34,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:54:34,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:54:34,055 INFO L87 Difference]: Start difference. First operand 2825 states and 4007 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 17:54:36,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:36,509 INFO L93 Difference]: Finished difference Result 6477 states and 9193 transitions. [2022-04-15 17:54:36,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:54:36,509 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 17:54:36,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:54:36,510 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 17:54:36,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-15 17:54:36,511 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 17:54:36,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-15 17:54:36,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 174 transitions. [2022-04-15 17:54:36,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:37,233 INFO L225 Difference]: With dead ends: 6477 [2022-04-15 17:54:37,233 INFO L226 Difference]: Without dead ends: 3723 [2022-04-15 17:54:37,237 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 17:54:37,237 INFO L913 BasicCegarLoop]: 100 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:54:37,237 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 107 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:54:37,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2022-04-15 17:54:37,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3721. [2022-04-15 17:54:37,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:54:37,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3723 states. Second operand has 3721 states, 3717 states have (on average 1.3957492601560397) internal successors, (5188), 3717 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:37,630 INFO L74 IsIncluded]: Start isIncluded. First operand 3723 states. Second operand has 3721 states, 3717 states have (on average 1.3957492601560397) internal successors, (5188), 3717 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:37,632 INFO L87 Difference]: Start difference. First operand 3723 states. Second operand has 3721 states, 3717 states have (on average 1.3957492601560397) internal successors, (5188), 3717 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:38,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:38,030 INFO L93 Difference]: Finished difference Result 3723 states and 5192 transitions. [2022-04-15 17:54:38,030 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5192 transitions. [2022-04-15 17:54:38,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:38,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:38,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 3721 states, 3717 states have (on average 1.3957492601560397) internal successors, (5188), 3717 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3723 states. [2022-04-15 17:54:38,040 INFO L87 Difference]: Start difference. First operand has 3721 states, 3717 states have (on average 1.3957492601560397) internal successors, (5188), 3717 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3723 states. [2022-04-15 17:54:38,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:38,425 INFO L93 Difference]: Finished difference Result 3723 states and 5192 transitions. [2022-04-15 17:54:38,425 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5192 transitions. [2022-04-15 17:54:38,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:38,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:38,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:54:38,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:54:38,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3721 states, 3717 states have (on average 1.3957492601560397) internal successors, (5188), 3717 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 5191 transitions. [2022-04-15 17:54:39,139 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 5191 transitions. Word has length 27 [2022-04-15 17:54:39,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:54:39,139 INFO L478 AbstractCegarLoop]: Abstraction has 3721 states and 5191 transitions. [2022-04-15 17:54:39,139 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 17:54:39,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3721 states and 5191 transitions. [2022-04-15 17:54:44,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5191 edges. 5191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:44,509 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 5191 transitions. [2022-04-15 17:54:44,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 17:54:44,512 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:54:44,512 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 17:54:44,512 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 17:54:44,512 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:54:44,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:54:44,513 INFO L85 PathProgramCache]: Analyzing trace with hash -579794103, now seen corresponding path program 1 times [2022-04-15 17:54:44,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:44,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1634955535] [2022-04-15 17:54:44,513 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:54:44,513 INFO L85 PathProgramCache]: Analyzing trace with hash -579794103, now seen corresponding path program 2 times [2022-04-15 17:54:44,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:54:44,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892600735] [2022-04-15 17:54:44,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:54:44,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:54:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:44,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:54:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:44,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {121866#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {121860#true} is VALID [2022-04-15 17:54:44,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {121860#true} assume true; {121860#true} is VALID [2022-04-15 17:54:44,558 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {121860#true} {121860#true} #200#return; {121860#true} is VALID [2022-04-15 17:54:44,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {121860#true} call ULTIMATE.init(); {121866#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:54:44,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {121866#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {121860#true} is VALID [2022-04-15 17:54:44,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {121860#true} assume true; {121860#true} is VALID [2022-04-15 17:54:44,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121860#true} {121860#true} #200#return; {121860#true} is VALID [2022-04-15 17:54:44,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {121860#true} call #t~ret15 := main(); {121860#true} is VALID [2022-04-15 17:54:44,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {121860#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;havoc ~cond~0; {121860#true} is VALID [2022-04-15 17:54:44,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {121860#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {121860#true} is VALID [2022-04-15 17:54:44,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {121860#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; {121860#true} is VALID [2022-04-15 17:54:44,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {121860#true} assume !(0 != ~p1~0); {121860#true} is VALID [2022-04-15 17:54:44,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {121860#true} assume !(0 != ~p2~0); {121860#true} is VALID [2022-04-15 17:54:44,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {121860#true} assume !(0 != ~p3~0); {121860#true} is VALID [2022-04-15 17:54:44,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {121860#true} assume !(0 != ~p4~0); {121860#true} is VALID [2022-04-15 17:54:44,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {121860#true} assume !(0 != ~p5~0); {121860#true} is VALID [2022-04-15 17:54:44,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {121860#true} assume !(0 != ~p6~0); {121860#true} is VALID [2022-04-15 17:54:44,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {121860#true} assume 0 != ~p7~0;~lk7~0 := 1; {121865#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:54:44,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {121865#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {121865#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:54:44,566 INFO L290 TraceCheckUtils]: 16: Hoare triple {121865#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {121865#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:54:44,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {121865#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {121865#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:54:44,567 INFO L290 TraceCheckUtils]: 18: Hoare triple {121865#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {121865#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:54:44,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {121865#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {121865#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:54:44,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {121865#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {121865#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:54:44,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {121865#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {121865#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:54:44,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {121865#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {121865#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:54:44,569 INFO L290 TraceCheckUtils]: 23: Hoare triple {121865#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {121865#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:54:44,569 INFO L290 TraceCheckUtils]: 24: Hoare triple {121865#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {121861#false} is VALID [2022-04-15 17:54:44,569 INFO L290 TraceCheckUtils]: 25: Hoare triple {121861#false} assume 0 != ~p8~0; {121861#false} is VALID [2022-04-15 17:54:44,569 INFO L290 TraceCheckUtils]: 26: Hoare triple {121861#false} assume 1 != ~lk8~0; {121861#false} is VALID [2022-04-15 17:54:44,569 INFO L290 TraceCheckUtils]: 27: Hoare triple {121861#false} assume !false; {121861#false} is VALID [2022-04-15 17:54:44,570 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 17:54:44,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:54:44,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892600735] [2022-04-15 17:54:44,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892600735] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:44,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:44,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:44,571 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:54:44,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1634955535] [2022-04-15 17:54:44,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1634955535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:44,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:44,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:44,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387860548] [2022-04-15 17:54:44,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:54:44,572 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 17:54:44,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:54:44,573 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 17:54:44,589 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 17:54:44,589 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:54:44,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:44,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:54:44,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:54:44,589 INFO L87 Difference]: Start difference. First operand 3721 states and 5191 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 17:54:46,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:46,295 INFO L93 Difference]: Finished difference Result 5581 states and 7753 transitions. [2022-04-15 17:54:46,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:54:46,295 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 17:54:46,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:54:46,296 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 17:54:46,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-15 17:54:46,297 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 17:54:46,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-15 17:54:46,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 169 transitions. [2022-04-15 17:54:46,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:47,040 INFO L225 Difference]: With dead ends: 5581 [2022-04-15 17:54:47,040 INFO L226 Difference]: Without dead ends: 3787 [2022-04-15 17:54:47,042 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 17:54:47,043 INFO L913 BasicCegarLoop]: 88 mSDtfsCounter, 125 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:54:47,043 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 95 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:54:47,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3787 states. [2022-04-15 17:54:47,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3787 to 3785. [2022-04-15 17:54:47,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:54:47,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3787 states. Second operand has 3785 states, 3781 states have (on average 1.37212377677863) internal successors, (5188), 3781 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:47,326 INFO L74 IsIncluded]: Start isIncluded. First operand 3787 states. Second operand has 3785 states, 3781 states have (on average 1.37212377677863) internal successors, (5188), 3781 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:47,329 INFO L87 Difference]: Start difference. First operand 3787 states. Second operand has 3785 states, 3781 states have (on average 1.37212377677863) internal successors, (5188), 3781 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:47,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:47,710 INFO L93 Difference]: Finished difference Result 3787 states and 5192 transitions. [2022-04-15 17:54:47,710 INFO L276 IsEmpty]: Start isEmpty. Operand 3787 states and 5192 transitions. [2022-04-15 17:54:47,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:47,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:47,718 INFO L74 IsIncluded]: Start isIncluded. First operand has 3785 states, 3781 states have (on average 1.37212377677863) internal successors, (5188), 3781 states have internal predecessors, (5188), 2 states have call successors, (2), 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 3787 states. [2022-04-15 17:54:47,720 INFO L87 Difference]: Start difference. First operand has 3785 states, 3781 states have (on average 1.37212377677863) internal successors, (5188), 3781 states have internal predecessors, (5188), 2 states have call successors, (2), 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 3787 states. [2022-04-15 17:54:48,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:48,114 INFO L93 Difference]: Finished difference Result 3787 states and 5192 transitions. [2022-04-15 17:54:48,114 INFO L276 IsEmpty]: Start isEmpty. Operand 3787 states and 5192 transitions. [2022-04-15 17:54:48,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:54:48,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:54:48,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:54:48,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:54:48,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3785 states, 3781 states have (on average 1.37212377677863) internal successors, (5188), 3781 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:48,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3785 states to 3785 states and 5191 transitions. [2022-04-15 17:54:48,793 INFO L78 Accepts]: Start accepts. Automaton has 3785 states and 5191 transitions. Word has length 28 [2022-04-15 17:54:48,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:54:48,793 INFO L478 AbstractCegarLoop]: Abstraction has 3785 states and 5191 transitions. [2022-04-15 17:54:48,793 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 17:54:48,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3785 states and 5191 transitions. [2022-04-15 17:54:54,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5191 edges. 5191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:54,213 INFO L276 IsEmpty]: Start isEmpty. Operand 3785 states and 5191 transitions. [2022-04-15 17:54:54,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 17:54:54,215 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:54:54,216 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 17:54:54,216 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 17:54:54,216 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:54:54,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:54:54,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1590911353, now seen corresponding path program 1 times [2022-04-15 17:54:54,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:54,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1104485715] [2022-04-15 17:54:54,216 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:54:54,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1590911353, now seen corresponding path program 2 times [2022-04-15 17:54:54,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:54:54,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228409118] [2022-04-15 17:54:54,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:54:54,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:54:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:54,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:54:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:54:54,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {148184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {148178#true} is VALID [2022-04-15 17:54:54,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {148178#true} assume true; {148178#true} is VALID [2022-04-15 17:54:54,250 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {148178#true} {148178#true} #200#return; {148178#true} is VALID [2022-04-15 17:54:54,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {148178#true} call ULTIMATE.init(); {148184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:54:54,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {148184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {148178#true} is VALID [2022-04-15 17:54:54,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {148178#true} assume true; {148178#true} is VALID [2022-04-15 17:54:54,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {148178#true} {148178#true} #200#return; {148178#true} is VALID [2022-04-15 17:54:54,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {148178#true} call #t~ret15 := main(); {148178#true} is VALID [2022-04-15 17:54:54,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {148178#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;havoc ~cond~0; {148178#true} is VALID [2022-04-15 17:54:54,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {148178#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {148178#true} is VALID [2022-04-15 17:54:54,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {148178#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; {148178#true} is VALID [2022-04-15 17:54:54,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {148178#true} assume !(0 != ~p1~0); {148178#true} is VALID [2022-04-15 17:54:54,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {148178#true} assume !(0 != ~p2~0); {148178#true} is VALID [2022-04-15 17:54:54,251 INFO L290 TraceCheckUtils]: 10: Hoare triple {148178#true} assume !(0 != ~p3~0); {148178#true} is VALID [2022-04-15 17:54:54,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {148178#true} assume !(0 != ~p4~0); {148178#true} is VALID [2022-04-15 17:54:54,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {148178#true} assume !(0 != ~p5~0); {148178#true} is VALID [2022-04-15 17:54:54,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {148178#true} assume !(0 != ~p6~0); {148178#true} is VALID [2022-04-15 17:54:54,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {148178#true} assume !(0 != ~p7~0); {148178#true} is VALID [2022-04-15 17:54:54,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {148178#true} assume 0 != ~p8~0;~lk8~0 := 1; {148183#(= main_~lk8~0 1)} is VALID [2022-04-15 17:54:54,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {148183#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {148183#(= main_~lk8~0 1)} is VALID [2022-04-15 17:54:54,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-15 17:54:54,253 INFO L290 TraceCheckUtils]: 18: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-15 17:54:54,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-15 17:54:54,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-15 17:54:54,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-15 17:54:54,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-15 17:54:54,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-15 17:54:54,255 INFO L290 TraceCheckUtils]: 24: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-15 17:54:54,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {148183#(= main_~lk8~0 1)} assume 0 != ~p8~0; {148183#(= main_~lk8~0 1)} is VALID [2022-04-15 17:54:54,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {148183#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {148179#false} is VALID [2022-04-15 17:54:54,255 INFO L290 TraceCheckUtils]: 27: Hoare triple {148179#false} assume !false; {148179#false} is VALID [2022-04-15 17:54:54,256 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 17:54:54,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:54:54,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228409118] [2022-04-15 17:54:54,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228409118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:54,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:54,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:54,256 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:54:54,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1104485715] [2022-04-15 17:54:54,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1104485715] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:54:54,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:54:54,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:54:54,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514432446] [2022-04-15 17:54:54,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:54:54,257 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 17:54:54,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:54:54,257 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 17:54:54,273 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 17:54:54,273 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:54:54,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:54:54,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:54:54,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:54:54,274 INFO L87 Difference]: Start difference. First operand 3785 states and 5191 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 17:54:56,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:54:56,774 INFO L93 Difference]: Finished difference Result 6413 states and 8905 transitions. [2022-04-15 17:54:56,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:54:56,774 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 17:54:56,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:54:56,774 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 17:54:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-15 17:54:56,775 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 17:54:56,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-15 17:54:56,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-15 17:54:56,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:54:58,709 INFO L225 Difference]: With dead ends: 6413 [2022-04-15 17:54:58,710 INFO L226 Difference]: Without dead ends: 6411 [2022-04-15 17:54:58,711 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 17:54:58,711 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 119 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:54:58,711 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 71 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:54:58,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6411 states. [2022-04-15 17:54:59,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6411 to 5641. [2022-04-15 17:54:59,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:54:59,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6411 states. Second operand has 5641 states, 5637 states have (on average 1.329075749512152) internal successors, (7492), 5637 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:59,187 INFO L74 IsIncluded]: Start isIncluded. First operand 6411 states. Second operand has 5641 states, 5637 states have (on average 1.329075749512152) internal successors, (7492), 5637 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:54:59,193 INFO L87 Difference]: Start difference. First operand 6411 states. Second operand has 5641 states, 5637 states have (on average 1.329075749512152) internal successors, (7492), 5637 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:00,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:00,343 INFO L93 Difference]: Finished difference Result 6411 states and 8776 transitions. [2022-04-15 17:55:00,343 INFO L276 IsEmpty]: Start isEmpty. Operand 6411 states and 8776 transitions. [2022-04-15 17:55:00,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:00,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:00,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 5641 states, 5637 states have (on average 1.329075749512152) internal successors, (7492), 5637 states have internal predecessors, (7492), 2 states have call successors, (2), 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 6411 states. [2022-04-15 17:55:00,368 INFO L87 Difference]: Start difference. First operand has 5641 states, 5637 states have (on average 1.329075749512152) internal successors, (7492), 5637 states have internal predecessors, (7492), 2 states have call successors, (2), 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 6411 states. [2022-04-15 17:55:01,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:01,666 INFO L93 Difference]: Finished difference Result 6411 states and 8776 transitions. [2022-04-15 17:55:01,666 INFO L276 IsEmpty]: Start isEmpty. Operand 6411 states and 8776 transitions. [2022-04-15 17:55:01,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:01,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:01,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:55:01,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:55:01,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5641 states, 5637 states have (on average 1.329075749512152) internal successors, (7492), 5637 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:03,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5641 states to 5641 states and 7495 transitions. [2022-04-15 17:55:03,101 INFO L78 Accepts]: Start accepts. Automaton has 5641 states and 7495 transitions. Word has length 28 [2022-04-15 17:55:03,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:55:03,101 INFO L478 AbstractCegarLoop]: Abstraction has 5641 states and 7495 transitions. [2022-04-15 17:55:03,101 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 17:55:03,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5641 states and 7495 transitions. [2022-04-15 17:55:11,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7495 edges. 7495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:11,187 INFO L276 IsEmpty]: Start isEmpty. Operand 5641 states and 7495 transitions. [2022-04-15 17:55:11,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 17:55:11,191 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:55:11,191 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:55:11,191 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 17:55:11,191 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:55:11,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:55:11,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2117249929, now seen corresponding path program 1 times [2022-04-15 17:55:11,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:11,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1450178126] [2022-04-15 17:55:11,192 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:55:11,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2117249929, now seen corresponding path program 2 times [2022-04-15 17:55:11,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:55:11,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422757059] [2022-04-15 17:55:11,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:55:11,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:55:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:11,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:55:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:11,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {185126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {185120#true} is VALID [2022-04-15 17:55:11,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {185120#true} assume true; {185120#true} is VALID [2022-04-15 17:55:11,258 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {185120#true} {185120#true} #200#return; {185120#true} is VALID [2022-04-15 17:55:11,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {185120#true} call ULTIMATE.init(); {185126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:55:11,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {185126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {185120#true} is VALID [2022-04-15 17:55:11,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {185120#true} assume true; {185120#true} is VALID [2022-04-15 17:55:11,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185120#true} {185120#true} #200#return; {185120#true} is VALID [2022-04-15 17:55:11,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {185120#true} call #t~ret15 := main(); {185120#true} is VALID [2022-04-15 17:55:11,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {185120#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;havoc ~cond~0; {185120#true} is VALID [2022-04-15 17:55:11,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {185120#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {185120#true} is VALID [2022-04-15 17:55:11,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {185120#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; {185120#true} is VALID [2022-04-15 17:55:11,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {185120#true} assume !(0 != ~p1~0); {185120#true} is VALID [2022-04-15 17:55:11,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {185120#true} assume !(0 != ~p2~0); {185120#true} is VALID [2022-04-15 17:55:11,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {185120#true} assume !(0 != ~p3~0); {185120#true} is VALID [2022-04-15 17:55:11,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {185120#true} assume !(0 != ~p4~0); {185120#true} is VALID [2022-04-15 17:55:11,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {185120#true} assume !(0 != ~p5~0); {185120#true} is VALID [2022-04-15 17:55:11,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {185120#true} assume !(0 != ~p6~0); {185120#true} is VALID [2022-04-15 17:55:11,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {185120#true} assume !(0 != ~p7~0); {185120#true} is VALID [2022-04-15 17:55:11,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {185120#true} assume !(0 != ~p8~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-15 17:55:11,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {185125#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {185125#(= main_~p8~0 0)} is VALID [2022-04-15 17:55:11,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p10~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-15 17:55:11,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p1~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-15 17:55:11,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p2~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-15 17:55:11,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p3~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-15 17:55:11,262 INFO L290 TraceCheckUtils]: 21: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p4~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-15 17:55:11,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p5~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-15 17:55:11,263 INFO L290 TraceCheckUtils]: 23: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p6~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-15 17:55:11,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p7~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-15 17:55:11,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {185125#(= main_~p8~0 0)} assume 0 != ~p8~0; {185121#false} is VALID [2022-04-15 17:55:11,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {185121#false} assume 1 != ~lk8~0; {185121#false} is VALID [2022-04-15 17:55:11,264 INFO L290 TraceCheckUtils]: 27: Hoare triple {185121#false} assume !false; {185121#false} is VALID [2022-04-15 17:55:11,264 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 17:55:11,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:55:11,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422757059] [2022-04-15 17:55:11,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422757059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:11,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:11,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:11,265 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:55:11,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1450178126] [2022-04-15 17:55:11,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1450178126] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:11,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:11,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:11,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135890144] [2022-04-15 17:55:11,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:55:11,266 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 17:55:11,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:55:11,266 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 17:55:11,285 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 17:55:11,285 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:55:11,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:11,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:55:11,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:55:11,286 INFO L87 Difference]: Start difference. First operand 5641 states and 7495 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 17:55:19,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:19,894 INFO L93 Difference]: Finished difference Result 12813 states and 16969 transitions. [2022-04-15 17:55:19,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:55:19,895 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 17:55:19,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:55:19,895 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 17:55:19,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-15 17:55:19,896 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 17:55:19,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-15 17:55:19,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 171 transitions. [2022-04-15 17:55:20,005 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 17:55:22,544 INFO L225 Difference]: With dead ends: 12813 [2022-04-15 17:55:22,544 INFO L226 Difference]: Without dead ends: 7307 [2022-04-15 17:55:22,550 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 17:55:22,551 INFO L913 BasicCegarLoop]: 102 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:55:22,551 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 109 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:55:22,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7307 states. [2022-04-15 17:55:23,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7307 to 7305. [2022-04-15 17:55:23,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:55:23,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7307 states. Second operand has 7305 states, 7301 states have (on average 1.297904396657992) internal successors, (9476), 7301 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:23,156 INFO L74 IsIncluded]: Start isIncluded. First operand 7307 states. Second operand has 7305 states, 7301 states have (on average 1.297904396657992) internal successors, (9476), 7301 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:23,161 INFO L87 Difference]: Start difference. First operand 7307 states. Second operand has 7305 states, 7301 states have (on average 1.297904396657992) internal successors, (9476), 7301 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:24,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:24,706 INFO L93 Difference]: Finished difference Result 7307 states and 9480 transitions. [2022-04-15 17:55:24,706 INFO L276 IsEmpty]: Start isEmpty. Operand 7307 states and 9480 transitions. [2022-04-15 17:55:24,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:24,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:24,718 INFO L74 IsIncluded]: Start isIncluded. First operand has 7305 states, 7301 states have (on average 1.297904396657992) internal successors, (9476), 7301 states have internal predecessors, (9476), 2 states have call successors, (2), 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 7307 states. [2022-04-15 17:55:24,722 INFO L87 Difference]: Start difference. First operand has 7305 states, 7301 states have (on average 1.297904396657992) internal successors, (9476), 7301 states have internal predecessors, (9476), 2 states have call successors, (2), 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 7307 states. [2022-04-15 17:55:26,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:26,283 INFO L93 Difference]: Finished difference Result 7307 states and 9480 transitions. [2022-04-15 17:55:26,283 INFO L276 IsEmpty]: Start isEmpty. Operand 7307 states and 9480 transitions. [2022-04-15 17:55:26,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:26,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:26,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:55:26,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:55:26,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7305 states, 7301 states have (on average 1.297904396657992) internal successors, (9476), 7301 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:28,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7305 states to 7305 states and 9479 transitions. [2022-04-15 17:55:28,885 INFO L78 Accepts]: Start accepts. Automaton has 7305 states and 9479 transitions. Word has length 28 [2022-04-15 17:55:28,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:55:28,885 INFO L478 AbstractCegarLoop]: Abstraction has 7305 states and 9479 transitions. [2022-04-15 17:55:28,885 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 17:55:28,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7305 states and 9479 transitions. [2022-04-15 17:55:39,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9479 edges. 9479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:39,152 INFO L276 IsEmpty]: Start isEmpty. Operand 7305 states and 9479 transitions. [2022-04-15 17:55:39,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 17:55:39,156 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:55:39,156 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 17:55:39,156 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 17:55:39,157 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:55:39,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:55:39,157 INFO L85 PathProgramCache]: Analyzing trace with hash -2073395917, now seen corresponding path program 1 times [2022-04-15 17:55:39,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:39,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1634784653] [2022-04-15 17:55:39,157 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:55:39,157 INFO L85 PathProgramCache]: Analyzing trace with hash -2073395917, now seen corresponding path program 2 times [2022-04-15 17:55:39,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:55:39,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189544290] [2022-04-15 17:55:39,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:55:39,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:55:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:39,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:55:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:39,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {239988#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {239982#true} is VALID [2022-04-15 17:55:39,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {239982#true} assume true; {239982#true} is VALID [2022-04-15 17:55:39,198 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {239982#true} {239982#true} #200#return; {239982#true} is VALID [2022-04-15 17:55:39,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {239982#true} call ULTIMATE.init(); {239988#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:55:39,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {239988#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {239982#true} is VALID [2022-04-15 17:55:39,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {239982#true} assume true; {239982#true} is VALID [2022-04-15 17:55:39,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {239982#true} {239982#true} #200#return; {239982#true} is VALID [2022-04-15 17:55:39,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {239982#true} call #t~ret15 := main(); {239982#true} is VALID [2022-04-15 17:55:39,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {239982#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;havoc ~cond~0; {239982#true} is VALID [2022-04-15 17:55:39,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {239982#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {239982#true} is VALID [2022-04-15 17:55:39,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {239982#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; {239982#true} is VALID [2022-04-15 17:55:39,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {239982#true} assume !(0 != ~p1~0); {239982#true} is VALID [2022-04-15 17:55:39,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {239982#true} assume !(0 != ~p2~0); {239982#true} is VALID [2022-04-15 17:55:39,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {239982#true} assume !(0 != ~p3~0); {239982#true} is VALID [2022-04-15 17:55:39,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {239982#true} assume !(0 != ~p4~0); {239982#true} is VALID [2022-04-15 17:55:39,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {239982#true} assume !(0 != ~p5~0); {239982#true} is VALID [2022-04-15 17:55:39,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {239982#true} assume !(0 != ~p6~0); {239982#true} is VALID [2022-04-15 17:55:39,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {239982#true} assume !(0 != ~p7~0); {239982#true} is VALID [2022-04-15 17:55:39,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {239982#true} assume 0 != ~p8~0;~lk8~0 := 1; {239987#(not (= main_~p8~0 0))} is VALID [2022-04-15 17:55:39,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {239987#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {239987#(not (= main_~p8~0 0))} is VALID [2022-04-15 17:55:39,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {239987#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {239987#(not (= main_~p8~0 0))} is VALID [2022-04-15 17:55:39,201 INFO L290 TraceCheckUtils]: 18: Hoare triple {239987#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {239987#(not (= main_~p8~0 0))} is VALID [2022-04-15 17:55:39,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {239987#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {239987#(not (= main_~p8~0 0))} is VALID [2022-04-15 17:55:39,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {239987#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {239987#(not (= main_~p8~0 0))} is VALID [2022-04-15 17:55:39,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {239987#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {239987#(not (= main_~p8~0 0))} is VALID [2022-04-15 17:55:39,202 INFO L290 TraceCheckUtils]: 22: Hoare triple {239987#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {239987#(not (= main_~p8~0 0))} is VALID [2022-04-15 17:55:39,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {239987#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {239987#(not (= main_~p8~0 0))} is VALID [2022-04-15 17:55:39,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {239987#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {239987#(not (= main_~p8~0 0))} is VALID [2022-04-15 17:55:39,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {239987#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {239983#false} is VALID [2022-04-15 17:55:39,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {239983#false} assume 0 != ~p9~0; {239983#false} is VALID [2022-04-15 17:55:39,204 INFO L290 TraceCheckUtils]: 27: Hoare triple {239983#false} assume 1 != ~lk9~0; {239983#false} is VALID [2022-04-15 17:55:39,204 INFO L290 TraceCheckUtils]: 28: Hoare triple {239983#false} assume !false; {239983#false} is VALID [2022-04-15 17:55:39,204 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 17:55:39,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:55:39,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189544290] [2022-04-15 17:55:39,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189544290] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:39,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:39,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:39,205 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:55:39,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1634784653] [2022-04-15 17:55:39,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1634784653] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:39,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:39,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:39,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184437516] [2022-04-15 17:55:39,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:55:39,206 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 17:55:39,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:55:39,206 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 17:55:39,223 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 17:55:39,223 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:55:39,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:39,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:55:39,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:55:39,224 INFO L87 Difference]: Start difference. First operand 7305 states and 9479 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 17:55:44,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:44,918 INFO L93 Difference]: Finished difference Result 10957 states and 14153 transitions. [2022-04-15 17:55:44,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:55:44,919 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 17:55:44,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:55:44,919 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 17:55:44,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2022-04-15 17:55:44,920 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 17:55:44,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2022-04-15 17:55:44,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 166 transitions. [2022-04-15 17:55:45,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:47,518 INFO L225 Difference]: With dead ends: 10957 [2022-04-15 17:55:47,519 INFO L226 Difference]: Without dead ends: 7435 [2022-04-15 17:55:47,522 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 17:55:47,523 INFO L913 BasicCegarLoop]: 85 mSDtfsCounter, 124 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:55:47,523 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 92 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:55:47,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2022-04-15 17:55:48,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 7433. [2022-04-15 17:55:48,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:55:48,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7435 states. Second operand has 7433 states, 7429 states have (on average 1.2755417956656347) internal successors, (9476), 7429 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:48,135 INFO L74 IsIncluded]: Start isIncluded. First operand 7435 states. Second operand has 7433 states, 7429 states have (on average 1.2755417956656347) internal successors, (9476), 7429 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:48,141 INFO L87 Difference]: Start difference. First operand 7435 states. Second operand has 7433 states, 7429 states have (on average 1.2755417956656347) internal successors, (9476), 7429 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:49,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:49,637 INFO L93 Difference]: Finished difference Result 7435 states and 9480 transitions. [2022-04-15 17:55:49,637 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 9480 transitions. [2022-04-15 17:55:49,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:49,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:49,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 7433 states, 7429 states have (on average 1.2755417956656347) internal successors, (9476), 7429 states have internal predecessors, (9476), 2 states have call successors, (2), 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 7435 states. [2022-04-15 17:55:49,654 INFO L87 Difference]: Start difference. First operand has 7433 states, 7429 states have (on average 1.2755417956656347) internal successors, (9476), 7429 states have internal predecessors, (9476), 2 states have call successors, (2), 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 7435 states. [2022-04-15 17:55:51,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:51,135 INFO L93 Difference]: Finished difference Result 7435 states and 9480 transitions. [2022-04-15 17:55:51,135 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 9480 transitions. [2022-04-15 17:55:51,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:51,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:51,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:55:51,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:55:51,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7433 states, 7429 states have (on average 1.2755417956656347) internal successors, (9476), 7429 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:53,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7433 states to 7433 states and 9479 transitions. [2022-04-15 17:55:53,794 INFO L78 Accepts]: Start accepts. Automaton has 7433 states and 9479 transitions. Word has length 29 [2022-04-15 17:55:53,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:55:53,795 INFO L478 AbstractCegarLoop]: Abstraction has 7433 states and 9479 transitions. [2022-04-15 17:55:53,795 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 17:55:53,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7433 states and 9479 transitions. [2022-04-15 17:56:04,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9479 edges. 9479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:56:04,082 INFO L276 IsEmpty]: Start isEmpty. Operand 7433 states and 9479 transitions. [2022-04-15 17:56:04,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 17:56:04,086 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:56:04,086 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 17:56:04,086 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 17:56:04,086 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:56:04,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:56:04,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1210454129, now seen corresponding path program 1 times [2022-04-15 17:56:04,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:56:04,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1504860760] [2022-04-15 17:56:04,087 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:56:04,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1210454129, now seen corresponding path program 2 times [2022-04-15 17:56:04,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:56:04,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428530761] [2022-04-15 17:56:04,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:56:04,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:56:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:56:04,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:56:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:56:04,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {291650#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {291644#true} is VALID [2022-04-15 17:56:04,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {291644#true} assume true; {291644#true} is VALID [2022-04-15 17:56:04,121 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {291644#true} {291644#true} #200#return; {291644#true} is VALID [2022-04-15 17:56:04,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {291644#true} call ULTIMATE.init(); {291650#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:56:04,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {291650#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {291644#true} is VALID [2022-04-15 17:56:04,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {291644#true} assume true; {291644#true} is VALID [2022-04-15 17:56:04,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {291644#true} {291644#true} #200#return; {291644#true} is VALID [2022-04-15 17:56:04,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {291644#true} call #t~ret15 := main(); {291644#true} is VALID [2022-04-15 17:56:04,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {291644#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;havoc ~cond~0; {291644#true} is VALID [2022-04-15 17:56:04,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {291644#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {291644#true} is VALID [2022-04-15 17:56:04,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {291644#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; {291644#true} is VALID [2022-04-15 17:56:04,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {291644#true} assume !(0 != ~p1~0); {291644#true} is VALID [2022-04-15 17:56:04,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {291644#true} assume !(0 != ~p2~0); {291644#true} is VALID [2022-04-15 17:56:04,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {291644#true} assume !(0 != ~p3~0); {291644#true} is VALID [2022-04-15 17:56:04,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {291644#true} assume !(0 != ~p4~0); {291644#true} is VALID [2022-04-15 17:56:04,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {291644#true} assume !(0 != ~p5~0); {291644#true} is VALID [2022-04-15 17:56:04,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {291644#true} assume !(0 != ~p6~0); {291644#true} is VALID [2022-04-15 17:56:04,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {291644#true} assume !(0 != ~p7~0); {291644#true} is VALID [2022-04-15 17:56:04,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {291644#true} assume !(0 != ~p8~0); {291644#true} is VALID [2022-04-15 17:56:04,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {291644#true} assume 0 != ~p9~0;~lk9~0 := 1; {291649#(= main_~lk9~0 1)} is VALID [2022-04-15 17:56:04,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-15 17:56:04,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-15 17:56:04,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-15 17:56:04,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-15 17:56:04,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-15 17:56:04,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-15 17:56:04,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-15 17:56:04,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-15 17:56:04,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-15 17:56:04,127 INFO L290 TraceCheckUtils]: 26: Hoare triple {291649#(= main_~lk9~0 1)} assume 0 != ~p9~0; {291649#(= main_~lk9~0 1)} is VALID [2022-04-15 17:56:04,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {291649#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {291645#false} is VALID [2022-04-15 17:56:04,128 INFO L290 TraceCheckUtils]: 28: Hoare triple {291645#false} assume !false; {291645#false} is VALID [2022-04-15 17:56:04,128 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 17:56:04,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:56:04,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428530761] [2022-04-15 17:56:04,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428530761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:56:04,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:56:04,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:56:04,129 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:56:04,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1504860760] [2022-04-15 17:56:04,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1504860760] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:56:04,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:56:04,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:56:04,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300288365] [2022-04-15 17:56:04,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:56:04,130 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 17:56:04,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:56:04,130 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 17:56:04,148 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 17:56:04,148 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:56:04,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:56:04,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:56:04,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:56:04,148 INFO L87 Difference]: Start difference. First operand 7433 states and 9479 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 17:56:12,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:56:12,654 INFO L93 Difference]: Finished difference Result 12301 states and 15753 transitions. [2022-04-15 17:56:12,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:56:12,654 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 17:56:12,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:56:12,654 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 17:56:12,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-15 17:56:12,655 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 17:56:12,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-15 17:56:12,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-15 17:56:12,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:56:19,945 INFO L225 Difference]: With dead ends: 12301 [2022-04-15 17:56:19,945 INFO L226 Difference]: Without dead ends: 12299 [2022-04-15 17:56:19,947 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 17:56:19,948 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:56:19,948 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 70 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:56:19,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12299 states. [2022-04-15 17:56:20,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12299 to 11273. [2022-04-15 17:56:20,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:56:20,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12299 states. Second operand has 11273 states, 11269 states have (on average 1.2384417428343242) internal successors, (13956), 11269 states have internal predecessors, (13956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:56:20,874 INFO L74 IsIncluded]: Start isIncluded. First operand 12299 states. Second operand has 11273 states, 11269 states have (on average 1.2384417428343242) internal successors, (13956), 11269 states have internal predecessors, (13956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:56:20,893 INFO L87 Difference]: Start difference. First operand 12299 states. Second operand has 11273 states, 11269 states have (on average 1.2384417428343242) internal successors, (13956), 11269 states have internal predecessors, (13956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:56:25,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:56:25,554 INFO L93 Difference]: Finished difference Result 12299 states and 15496 transitions. [2022-04-15 17:56:25,554 INFO L276 IsEmpty]: Start isEmpty. Operand 12299 states and 15496 transitions. [2022-04-15 17:56:25,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:56:25,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:56:25,582 INFO L74 IsIncluded]: Start isIncluded. First operand has 11273 states, 11269 states have (on average 1.2384417428343242) internal successors, (13956), 11269 states have internal predecessors, (13956), 2 states have call successors, (2), 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 12299 states. [2022-04-15 17:56:25,597 INFO L87 Difference]: Start difference. First operand has 11273 states, 11269 states have (on average 1.2384417428343242) internal successors, (13956), 11269 states have internal predecessors, (13956), 2 states have call successors, (2), 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 12299 states. [2022-04-15 17:56:30,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:56:30,231 INFO L93 Difference]: Finished difference Result 12299 states and 15496 transitions. [2022-04-15 17:56:30,231 INFO L276 IsEmpty]: Start isEmpty. Operand 12299 states and 15496 transitions. [2022-04-15 17:56:30,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:56:30,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:56:30,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:56:30,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:56:30,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11273 states, 11269 states have (on average 1.2384417428343242) internal successors, (13956), 11269 states have internal predecessors, (13956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:56:35,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11273 states to 11273 states and 13959 transitions. [2022-04-15 17:56:35,737 INFO L78 Accepts]: Start accepts. Automaton has 11273 states and 13959 transitions. Word has length 29 [2022-04-15 17:56:35,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:56:35,737 INFO L478 AbstractCegarLoop]: Abstraction has 11273 states and 13959 transitions. [2022-04-15 17:56:35,737 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 17:56:35,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11273 states and 13959 transitions. [2022-04-15 17:56:51,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13959 edges. 13959 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:56:51,513 INFO L276 IsEmpty]: Start isEmpty. Operand 11273 states and 13959 transitions. [2022-04-15 17:56:51,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 17:56:51,524 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:56:51,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, 1, 1, 1] [2022-04-15 17:56:51,524 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 17:56:51,524 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:56:51,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:56:51,525 INFO L85 PathProgramCache]: Analyzing trace with hash 623648115, now seen corresponding path program 1 times [2022-04-15 17:56:51,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:56:51,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1532829914] [2022-04-15 17:56:51,525 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:56:51,525 INFO L85 PathProgramCache]: Analyzing trace with hash 623648115, now seen corresponding path program 2 times [2022-04-15 17:56:51,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:56:51,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379287615] [2022-04-15 17:56:51,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:56:51,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:56:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:56:51,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:56:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:56:51,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {363408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {363402#true} is VALID [2022-04-15 17:56:51,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {363402#true} assume true; {363402#true} is VALID [2022-04-15 17:56:51,567 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {363402#true} {363402#true} #200#return; {363402#true} is VALID [2022-04-15 17:56:51,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {363402#true} call ULTIMATE.init(); {363408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:56:51,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {363408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {363402#true} is VALID [2022-04-15 17:56:51,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {363402#true} assume true; {363402#true} is VALID [2022-04-15 17:56:51,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {363402#true} {363402#true} #200#return; {363402#true} is VALID [2022-04-15 17:56:51,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {363402#true} call #t~ret15 := main(); {363402#true} is VALID [2022-04-15 17:56:51,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {363402#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;havoc ~cond~0; {363402#true} is VALID [2022-04-15 17:56:51,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {363402#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {363402#true} is VALID [2022-04-15 17:56:51,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {363402#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; {363402#true} is VALID [2022-04-15 17:56:51,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {363402#true} assume !(0 != ~p1~0); {363402#true} is VALID [2022-04-15 17:56:51,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {363402#true} assume !(0 != ~p2~0); {363402#true} is VALID [2022-04-15 17:56:51,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {363402#true} assume !(0 != ~p3~0); {363402#true} is VALID [2022-04-15 17:56:51,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {363402#true} assume !(0 != ~p4~0); {363402#true} is VALID [2022-04-15 17:56:51,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {363402#true} assume !(0 != ~p5~0); {363402#true} is VALID [2022-04-15 17:56:51,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {363402#true} assume !(0 != ~p6~0); {363402#true} is VALID [2022-04-15 17:56:51,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {363402#true} assume !(0 != ~p7~0); {363402#true} is VALID [2022-04-15 17:56:51,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {363402#true} assume !(0 != ~p8~0); {363402#true} is VALID [2022-04-15 17:56:51,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {363402#true} assume !(0 != ~p9~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-15 17:56:51,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p10~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-15 17:56:51,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p1~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-15 17:56:51,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p2~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-15 17:56:51,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p3~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-15 17:56:51,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p4~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-15 17:56:51,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p5~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-15 17:56:51,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p6~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-15 17:56:51,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p7~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-15 17:56:51,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p8~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-15 17:56:51,573 INFO L290 TraceCheckUtils]: 26: Hoare triple {363407#(= main_~p9~0 0)} assume 0 != ~p9~0; {363403#false} is VALID [2022-04-15 17:56:51,573 INFO L290 TraceCheckUtils]: 27: Hoare triple {363403#false} assume 1 != ~lk9~0; {363403#false} is VALID [2022-04-15 17:56:51,573 INFO L290 TraceCheckUtils]: 28: Hoare triple {363403#false} assume !false; {363403#false} is VALID [2022-04-15 17:56:51,574 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 17:56:51,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:56:51,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379287615] [2022-04-15 17:56:51,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379287615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:56:51,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:56:51,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:56:51,574 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:56:51,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1532829914] [2022-04-15 17:56:51,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1532829914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:56:51,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:56:51,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:56:51,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616833895] [2022-04-15 17:56:51,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:56:51,575 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 17:56:51,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:56:51,576 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 17:56:51,593 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 17:56:51,593 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:56:51,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:56:51,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:56:51,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:56:51,594 INFO L87 Difference]: Start difference. First operand 11273 states and 13959 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 17:57:26,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:57:26,569 INFO L93 Difference]: Finished difference Result 25357 states and 31113 transitions. [2022-04-15 17:57:26,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:57:26,569 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 17:57:26,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:57:26,569 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 17:57:26,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2022-04-15 17:57:26,570 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 17:57:26,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2022-04-15 17:57:26,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 168 transitions. [2022-04-15 17:57:26,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:57:36,398 INFO L225 Difference]: With dead ends: 25357 [2022-04-15 17:57:36,398 INFO L226 Difference]: Without dead ends: 14347 [2022-04-15 17:57:36,410 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 17:57:36,410 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:57:36,410 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 111 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:57:36,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14347 states. [2022-04-15 17:57:37,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14347 to 14345. [2022-04-15 17:57:37,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:57:37,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14347 states. Second operand has 14345 states, 14341 states have (on average 1.1962903563210376) internal successors, (17156), 14341 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 17:57:37,524 INFO L74 IsIncluded]: Start isIncluded. First operand 14347 states. Second operand has 14345 states, 14341 states have (on average 1.1962903563210376) internal successors, (17156), 14341 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 17:57:37,539 INFO L87 Difference]: Start difference. First operand 14347 states. Second operand has 14345 states, 14341 states have (on average 1.1962903563210376) internal successors, (17156), 14341 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 17:57:43,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:57:43,289 INFO L93 Difference]: Finished difference Result 14347 states and 17160 transitions. [2022-04-15 17:57:43,289 INFO L276 IsEmpty]: Start isEmpty. Operand 14347 states and 17160 transitions. [2022-04-15 17:57:43,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:57:43,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:57:43,314 INFO L74 IsIncluded]: Start isIncluded. First operand has 14345 states, 14341 states have (on average 1.1962903563210376) internal successors, (17156), 14341 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 14347 states. [2022-04-15 17:57:43,329 INFO L87 Difference]: Start difference. First operand has 14345 states, 14341 states have (on average 1.1962903563210376) internal successors, (17156), 14341 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 14347 states. [2022-04-15 17:57:49,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:57:49,138 INFO L93 Difference]: Finished difference Result 14347 states and 17160 transitions. [2022-04-15 17:57:49,138 INFO L276 IsEmpty]: Start isEmpty. Operand 14347 states and 17160 transitions. [2022-04-15 17:57:49,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:57:49,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:57:49,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:57:49,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:57:49,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14345 states, 14341 states have (on average 1.1962903563210376) internal successors, (17156), 14341 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 17:57:59,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14345 states to 14345 states and 17159 transitions. [2022-04-15 17:57:59,246 INFO L78 Accepts]: Start accepts. Automaton has 14345 states and 17159 transitions. Word has length 29 [2022-04-15 17:57:59,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:57:59,247 INFO L478 AbstractCegarLoop]: Abstraction has 14345 states and 17159 transitions. [2022-04-15 17:57:59,247 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 17:57:59,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14345 states and 17159 transitions. [2022-04-15 17:58:18,671 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 17:58:18,671 INFO L276 IsEmpty]: Start isEmpty. Operand 14345 states and 17159 transitions. [2022-04-15 17:58:18,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 17:58:18,679 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:58:18,679 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 17:58:18,679 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 17:58:18,679 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:58:18,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:58:18,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1130411554, now seen corresponding path program 1 times [2022-04-15 17:58:18,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:18,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1418998681] [2022-04-15 17:58:18,680 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:58:18,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1130411554, now seen corresponding path program 2 times [2022-04-15 17:58:18,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:58:18,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900176949] [2022-04-15 17:58:18,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:58:18,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:58:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:18,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:58:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:18,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {471518#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {471512#true} is VALID [2022-04-15 17:58:18,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {471512#true} assume true; {471512#true} is VALID [2022-04-15 17:58:18,723 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {471512#true} {471512#true} #200#return; {471512#true} is VALID [2022-04-15 17:58:18,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {471512#true} call ULTIMATE.init(); {471518#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:58:18,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {471518#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {471512#true} is VALID [2022-04-15 17:58:18,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {471512#true} assume true; {471512#true} is VALID [2022-04-15 17:58:18,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {471512#true} {471512#true} #200#return; {471512#true} is VALID [2022-04-15 17:58:18,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {471512#true} call #t~ret15 := main(); {471512#true} is VALID [2022-04-15 17:58:18,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {471512#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;havoc ~cond~0; {471512#true} is VALID [2022-04-15 17:58:18,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {471512#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {471512#true} is VALID [2022-04-15 17:58:18,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {471512#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; {471512#true} is VALID [2022-04-15 17:58:18,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {471512#true} assume !(0 != ~p1~0); {471512#true} is VALID [2022-04-15 17:58:18,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {471512#true} assume !(0 != ~p2~0); {471512#true} is VALID [2022-04-15 17:58:18,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {471512#true} assume !(0 != ~p3~0); {471512#true} is VALID [2022-04-15 17:58:18,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {471512#true} assume !(0 != ~p4~0); {471512#true} is VALID [2022-04-15 17:58:18,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {471512#true} assume !(0 != ~p5~0); {471512#true} is VALID [2022-04-15 17:58:18,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {471512#true} assume !(0 != ~p6~0); {471512#true} is VALID [2022-04-15 17:58:18,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {471512#true} assume !(0 != ~p7~0); {471512#true} is VALID [2022-04-15 17:58:18,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {471512#true} assume !(0 != ~p8~0); {471512#true} is VALID [2022-04-15 17:58:18,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {471512#true} assume 0 != ~p9~0;~lk9~0 := 1; {471517#(not (= main_~p9~0 0))} is VALID [2022-04-15 17:58:18,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {471517#(not (= main_~p9~0 0))} is VALID [2022-04-15 17:58:18,726 INFO L290 TraceCheckUtils]: 18: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {471517#(not (= main_~p9~0 0))} is VALID [2022-04-15 17:58:18,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {471517#(not (= main_~p9~0 0))} is VALID [2022-04-15 17:58:18,727 INFO L290 TraceCheckUtils]: 20: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {471517#(not (= main_~p9~0 0))} is VALID [2022-04-15 17:58:18,727 INFO L290 TraceCheckUtils]: 21: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {471517#(not (= main_~p9~0 0))} is VALID [2022-04-15 17:58:18,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {471517#(not (= main_~p9~0 0))} is VALID [2022-04-15 17:58:18,728 INFO L290 TraceCheckUtils]: 23: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {471517#(not (= main_~p9~0 0))} is VALID [2022-04-15 17:58:18,728 INFO L290 TraceCheckUtils]: 24: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {471517#(not (= main_~p9~0 0))} is VALID [2022-04-15 17:58:18,728 INFO L290 TraceCheckUtils]: 25: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {471517#(not (= main_~p9~0 0))} is VALID [2022-04-15 17:58:18,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {471513#false} is VALID [2022-04-15 17:58:18,729 INFO L290 TraceCheckUtils]: 27: Hoare triple {471513#false} assume 0 != ~p10~0; {471513#false} is VALID [2022-04-15 17:58:18,729 INFO L290 TraceCheckUtils]: 28: Hoare triple {471513#false} assume 1 != ~lk10~0; {471513#false} is VALID [2022-04-15 17:58:18,729 INFO L290 TraceCheckUtils]: 29: Hoare triple {471513#false} assume !false; {471513#false} is VALID [2022-04-15 17:58:18,729 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 17:58:18,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:58:18,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900176949] [2022-04-15 17:58:18,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900176949] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:18,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:18,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:18,730 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:58:18,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1418998681] [2022-04-15 17:58:18,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1418998681] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:18,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:18,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:18,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332489420] [2022-04-15 17:58:18,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:58:18,730 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 17:58:18,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:58:18,731 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 17:58:18,749 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 17:58:18,749 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:58:18,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:18,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:58:18,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:58:18,749 INFO L87 Difference]: Start difference. First operand 14345 states and 17159 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 17:58:42,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:42,831 INFO L93 Difference]: Finished difference Result 21517 states and 25609 transitions. [2022-04-15 17:58:42,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:58:42,831 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 17:58:42,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:58:42,831 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 17:58:42,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-15 17:58:42,832 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 17:58:42,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-15 17:58:42,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-15 17:58:42,937 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 17:58:53,733 INFO L225 Difference]: With dead ends: 21517 [2022-04-15 17:58:53,733 INFO L226 Difference]: Without dead ends: 14603 [2022-04-15 17:58:53,742 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 17:58:53,742 INFO L913 BasicCegarLoop]: 82 mSDtfsCounter, 123 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:58:53,742 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 89 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:58:53,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14603 states. [2022-04-15 17:58:54,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14603 to 14601. [2022-04-15 17:58:54,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:58:54,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14603 states. Second operand has 14601 states, 14597 states have (on average 1.175309995204494) internal successors, (17156), 14597 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 17:58:54,945 INFO L74 IsIncluded]: Start isIncluded. First operand 14603 states. Second operand has 14601 states, 14597 states have (on average 1.175309995204494) internal successors, (17156), 14597 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 17:58:54,961 INFO L87 Difference]: Start difference. First operand 14603 states. Second operand has 14601 states, 14597 states have (on average 1.175309995204494) internal successors, (17156), 14597 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 17:59:01,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:01,256 INFO L93 Difference]: Finished difference Result 14603 states and 17160 transitions. [2022-04-15 17:59:01,256 INFO L276 IsEmpty]: Start isEmpty. Operand 14603 states and 17160 transitions. [2022-04-15 17:59:01,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:01,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:01,283 INFO L74 IsIncluded]: Start isIncluded. First operand has 14601 states, 14597 states have (on average 1.175309995204494) internal successors, (17156), 14597 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 14603 states. [2022-04-15 17:59:01,302 INFO L87 Difference]: Start difference. First operand has 14601 states, 14597 states have (on average 1.175309995204494) internal successors, (17156), 14597 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 14603 states. [2022-04-15 17:59:07,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:07,651 INFO L93 Difference]: Finished difference Result 14603 states and 17160 transitions. [2022-04-15 17:59:07,651 INFO L276 IsEmpty]: Start isEmpty. Operand 14603 states and 17160 transitions. [2022-04-15 17:59:07,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:07,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:07,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:59:07,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:59:07,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14601 states, 14597 states have (on average 1.175309995204494) internal successors, (17156), 14597 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 17:59:18,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 17159 transitions. [2022-04-15 17:59:18,921 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 17159 transitions. Word has length 30 [2022-04-15 17:59:18,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:59:18,921 INFO L478 AbstractCegarLoop]: Abstraction has 14601 states and 17159 transitions. [2022-04-15 17:59:18,921 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 17:59:18,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14601 states and 17159 transitions. [2022-04-15 17:59:38,406 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 17:59:38,407 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 17159 transitions. [2022-04-15 17:59:38,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 17:59:38,417 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:59:38,418 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 17:59:38,418 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 17:59:38,418 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:59:38,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:59:38,418 INFO L85 PathProgramCache]: Analyzing trace with hash -2141528804, now seen corresponding path program 1 times [2022-04-15 17:59:38,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:38,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [328758156] [2022-04-15 17:59:38,419 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:59:38,419 INFO L85 PathProgramCache]: Analyzing trace with hash -2141528804, now seen corresponding path program 2 times [2022-04-15 17:59:38,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:59:38,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585430725] [2022-04-15 17:59:38,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:59:38,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:59:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:38,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:59:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:38,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {572972#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {572966#true} is VALID [2022-04-15 17:59:38,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {572966#true} assume true; {572966#true} is VALID [2022-04-15 17:59:38,447 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {572966#true} {572966#true} #200#return; {572966#true} is VALID [2022-04-15 17:59:38,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {572966#true} call ULTIMATE.init(); {572972#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:59:38,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {572972#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {572966#true} is VALID [2022-04-15 17:59:38,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {572966#true} assume true; {572966#true} is VALID [2022-04-15 17:59:38,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {572966#true} {572966#true} #200#return; {572966#true} is VALID [2022-04-15 17:59:38,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {572966#true} call #t~ret15 := main(); {572966#true} is VALID [2022-04-15 17:59:38,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {572966#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;havoc ~cond~0; {572966#true} is VALID [2022-04-15 17:59:38,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {572966#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {572966#true} is VALID [2022-04-15 17:59:38,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {572966#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; {572966#true} is VALID [2022-04-15 17:59:38,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {572966#true} assume !(0 != ~p1~0); {572966#true} is VALID [2022-04-15 17:59:38,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {572966#true} assume !(0 != ~p2~0); {572966#true} is VALID [2022-04-15 17:59:38,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {572966#true} assume !(0 != ~p3~0); {572966#true} is VALID [2022-04-15 17:59:38,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {572966#true} assume !(0 != ~p4~0); {572966#true} is VALID [2022-04-15 17:59:38,449 INFO L290 TraceCheckUtils]: 12: Hoare triple {572966#true} assume !(0 != ~p5~0); {572966#true} is VALID [2022-04-15 17:59:38,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {572966#true} assume !(0 != ~p6~0); {572966#true} is VALID [2022-04-15 17:59:38,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {572966#true} assume !(0 != ~p7~0); {572966#true} is VALID [2022-04-15 17:59:38,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {572966#true} assume !(0 != ~p8~0); {572966#true} is VALID [2022-04-15 17:59:38,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {572966#true} assume !(0 != ~p9~0); {572966#true} is VALID [2022-04-15 17:59:38,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {572966#true} assume !(0 != ~p10~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-15 17:59:38,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p1~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-15 17:59:38,450 INFO L290 TraceCheckUtils]: 19: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p2~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-15 17:59:38,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p3~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-15 17:59:38,452 INFO L290 TraceCheckUtils]: 21: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p4~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-15 17:59:38,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p5~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-15 17:59:38,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p6~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-15 17:59:38,454 INFO L290 TraceCheckUtils]: 24: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p7~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-15 17:59:38,455 INFO L290 TraceCheckUtils]: 25: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p8~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-15 17:59:38,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p9~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-15 17:59:38,456 INFO L290 TraceCheckUtils]: 27: Hoare triple {572971#(= main_~p10~0 0)} assume 0 != ~p10~0; {572967#false} is VALID [2022-04-15 17:59:38,456 INFO L290 TraceCheckUtils]: 28: Hoare triple {572967#false} assume 1 != ~lk10~0; {572967#false} is VALID [2022-04-15 17:59:38,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {572967#false} assume !false; {572967#false} is VALID [2022-04-15 17:59:38,456 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 17:59:38,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:59:38,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585430725] [2022-04-15 17:59:38,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585430725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:38,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:38,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:38,457 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:59:38,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [328758156] [2022-04-15 17:59:38,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [328758156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:38,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:38,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:38,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174293069] [2022-04-15 17:59:38,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:59:38,458 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 17:59:38,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:59:38,458 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 17:59:38,477 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 17:59:38,477 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:59:38,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:38,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:59:38,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:59:38,478 INFO L87 Difference]: Start difference. First operand 14601 states and 17159 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:04:47,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:47,768 INFO L93 Difference]: Finished difference Result 42251 states and 48392 transitions. [2022-04-15 18:04:47,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:04:47,768 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:04:47,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:04:47,768 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:04:47,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2022-04-15 18:04:47,769 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:04:47,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2022-04-15 18:04:47,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 165 transitions. [2022-04-15 18:04:47,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:04:58,402 INFO L225 Difference]: With dead ends: 42251 [2022-04-15 18:04:58,402 INFO L226 Difference]: Without dead ends: 14601 [2022-04-15 18:04:58,436 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:58,437 INFO L913 BasicCegarLoop]: 79 mSDtfsCounter, 122 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:04:58,437 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 86 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:04:58,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14601 states. [2022-04-15 18:04:59,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14601 to 14601. [2022-04-15 18:04:59,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:04:59,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14601 states. Second operand has 14601 states, 14597 states have (on average 1.1051585942316915) internal successors, (16132), 14597 states have internal predecessors, (16132), 2 states have call successors, (2), 2 states have 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:00,015 INFO L74 IsIncluded]: Start isIncluded. First operand 14601 states. Second operand has 14601 states, 14597 states have (on average 1.1051585942316915) internal successors, (16132), 14597 states have internal predecessors, (16132), 2 states have call successors, (2), 2 states have 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:00,036 INFO L87 Difference]: Start difference. First operand 14601 states. Second operand has 14601 states, 14597 states have (on average 1.1051585942316915) internal successors, (16132), 14597 states have internal predecessors, (16132), 2 states have call successors, (2), 2 states have 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:08,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:05:08,630 INFO L93 Difference]: Finished difference Result 14601 states and 16135 transitions. [2022-04-15 18:05:08,630 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 16135 transitions. [2022-04-15 18:05:08,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:05:08,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:05:08,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 14601 states, 14597 states have (on average 1.1051585942316915) internal successors, (16132), 14597 states have internal predecessors, (16132), 2 states have call successors, (2), 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 14601 states. [2022-04-15 18:05:08,692 INFO L87 Difference]: Start difference. First operand has 14601 states, 14597 states have (on average 1.1051585942316915) internal successors, (16132), 14597 states have internal predecessors, (16132), 2 states have call successors, (2), 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 14601 states. [2022-04-15 18:05:16,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:05:16,944 INFO L93 Difference]: Finished difference Result 14601 states and 16135 transitions. [2022-04-15 18:05:16,944 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 16135 transitions. [2022-04-15 18:05:16,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:05:16,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:05:16,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:05:16,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:05:16,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14601 states, 14597 states have (on average 1.1051585942316915) internal successors, (16132), 14597 states have internal predecessors, (16132), 2 states have call successors, (2), 2 states have 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:31,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 16135 transitions. [2022-04-15 18:05:31,498 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 16135 transitions. Word has length 30 [2022-04-15 18:05:31,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:05:31,498 INFO L478 AbstractCegarLoop]: Abstraction has 14601 states and 16135 transitions. [2022-04-15 18:05:31,499 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:05:31,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14601 states and 16135 transitions. [2022-04-15 18:05:52,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16135 edges. 16135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:05:52,444 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 16135 transitions. [2022-04-15 18:05:52,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 18:05:52,471 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:05:52,471 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:05:52,472 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-15 18:05:52,487 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:05:52,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:05:52,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1554722790, now seen corresponding path program 1 times [2022-04-15 18:05:52,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:05:52,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [464775465] [2022-04-15 18:05:52,488 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:05:52,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1554722790, now seen corresponding path program 2 times [2022-04-15 18:05:52,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:05:52,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272928169] [2022-04-15 18:05:52,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:05:52,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:05:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:05:52,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:05:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:05:52,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {715890#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {715884#true} is VALID [2022-04-15 18:05:52,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {715884#true} assume true; {715884#true} is VALID [2022-04-15 18:05:52,528 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {715884#true} {715884#true} #200#return; {715884#true} is VALID [2022-04-15 18:05:52,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {715884#true} call ULTIMATE.init(); {715890#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:05:52,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {715890#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {715884#true} is VALID [2022-04-15 18:05:52,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {715884#true} assume true; {715884#true} is VALID [2022-04-15 18:05:52,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {715884#true} {715884#true} #200#return; {715884#true} is VALID [2022-04-15 18:05:52,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {715884#true} call #t~ret15 := main(); {715884#true} is VALID [2022-04-15 18:05:52,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {715884#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;havoc ~cond~0; {715884#true} is VALID [2022-04-15 18:05:52,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {715884#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {715884#true} is VALID [2022-04-15 18:05:52,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {715884#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; {715884#true} is VALID [2022-04-15 18:05:52,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {715884#true} assume !(0 != ~p1~0); {715884#true} is VALID [2022-04-15 18:05:52,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {715884#true} assume !(0 != ~p2~0); {715884#true} is VALID [2022-04-15 18:05:52,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {715884#true} assume !(0 != ~p3~0); {715884#true} is VALID [2022-04-15 18:05:52,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {715884#true} assume !(0 != ~p4~0); {715884#true} is VALID [2022-04-15 18:05:52,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {715884#true} assume !(0 != ~p5~0); {715884#true} is VALID [2022-04-15 18:05:52,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {715884#true} assume !(0 != ~p6~0); {715884#true} is VALID [2022-04-15 18:05:52,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {715884#true} assume !(0 != ~p7~0); {715884#true} is VALID [2022-04-15 18:05:52,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {715884#true} assume !(0 != ~p8~0); {715884#true} is VALID [2022-04-15 18:05:52,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {715884#true} assume !(0 != ~p9~0); {715884#true} is VALID [2022-04-15 18:05:52,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {715884#true} assume 0 != ~p10~0;~lk10~0 := 1; {715889#(= main_~lk10~0 1)} is VALID [2022-04-15 18:05:52,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p1~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-15 18:05:52,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p2~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-15 18:05:52,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p3~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-15 18:05:52,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p4~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-15 18:05:52,532 INFO L290 TraceCheckUtils]: 22: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p5~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-15 18:05:52,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p6~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-15 18:05:52,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p7~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-15 18:05:52,533 INFO L290 TraceCheckUtils]: 25: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p8~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-15 18:05:52,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p9~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-15 18:05:52,534 INFO L290 TraceCheckUtils]: 27: Hoare triple {715889#(= main_~lk10~0 1)} assume 0 != ~p10~0; {715889#(= main_~lk10~0 1)} is VALID [2022-04-15 18:05:52,534 INFO L290 TraceCheckUtils]: 28: Hoare triple {715889#(= main_~lk10~0 1)} assume 1 != ~lk10~0; {715885#false} is VALID [2022-04-15 18:05:52,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {715885#false} assume !false; {715885#false} is VALID [2022-04-15 18:05:52,535 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:52,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:05:52,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272928169] [2022-04-15 18:05:52,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272928169] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:05:52,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:05:52,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:05:52,535 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:05:52,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [464775465] [2022-04-15 18:05:52,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [464775465] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:05:52,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:05:52,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:05:52,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218272219] [2022-04-15 18:05:52,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:05:52,536 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:05:52,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:05:52,536 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:05:52,553 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:05:52,554 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:05:52,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:05:52,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:05:52,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:05:52,554 INFO L87 Difference]: Start difference. First operand 14601 states and 16135 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:06:04,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:06:04,010 INFO L93 Difference]: Finished difference Result 14601 states and 16135 transitions. [2022-04-15 18:06:04,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:06:04,010 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:06:04,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:06:04,010 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:06:04,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-04-15 18:06:04,012 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:06:04,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-04-15 18:06:04,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2022-04-15 18:06:04,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:06:04,051 INFO L225 Difference]: With dead ends: 14601 [2022-04-15 18:06:04,051 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 18:06:04,067 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:04,068 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 68 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:06:04,068 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 62 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:06:04,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 18:06:04,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 18:06:04,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:06:04,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 18:06:04,069 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 18:06:04,069 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 18:06:04,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:06:04,069 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 18:06:04,069 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 18:06:04,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:06:04,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:06:04,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 18:06:04,069 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 18:06:04,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:06:04,069 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 18:06:04,070 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 18:06:04,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:06:04,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:06:04,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:06:04,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:06:04,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 18:06:04,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 18:06:04,070 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-04-15 18:06:04,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:06:04,070 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 18:06:04,071 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:06:04,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 18:06:04,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:06:04,071 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 18:06:04,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:06:04,073 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 18:06:04,074 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-15 18:06:04,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 18:06:32,974 WARN L232 SmtUtils]: Spent 28.85s on a formula simplification that was a NOOP. DAG size: 1333 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-15 18:07:38,615 WARN L232 SmtUtils]: Spent 1.09m on a formula simplification that was a NOOP. DAG size: 1174 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)