/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_14-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 17:59:43,373 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 17:59:43,374 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 17:59:43,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 17:59:43,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 17:59:43,410 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 17:59:43,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 17:59:43,413 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 17:59:43,415 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 17:59:43,415 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 17:59:43,416 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 17:59:43,417 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 17:59:43,417 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 17:59:43,418 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 17:59:43,419 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 17:59:43,420 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 17:59:43,421 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 17:59:43,421 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 17:59:43,423 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 17:59:43,424 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 17:59:43,426 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 17:59:43,426 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 17:59:43,427 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 17:59:43,428 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 17:59:43,429 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 17:59:43,431 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 17:59:43,431 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 17:59:43,431 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 17:59:43,432 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 17:59:43,433 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 17:59:43,433 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 17:59:43,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 17:59:43,434 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 17:59:43,435 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 17:59:43,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 17:59:43,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 17:59:43,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 17:59:43,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 17:59:43,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 17:59:43,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 17:59:43,438 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 17:59:43,439 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 17:59:43,440 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:59:43,447 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 17:59:43,447 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 17:59:43,448 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 17:59:43,448 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 17:59:43,449 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 17:59:43,449 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 17:59:43,449 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 17:59:43,449 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 17:59:43,450 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 17:59:43,450 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 17:59:43,450 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 17:59:43,450 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 17:59:43,450 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 17:59:43,451 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 17:59:43,451 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 17:59:43,451 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 17:59:43,451 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 17:59:43,452 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 17:59:43,452 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 17:59:43,452 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 17:59:43,452 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 17:59:43,453 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 17:59:43,453 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:59:43,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 17:59:43,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 17:59:43,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 17:59:43,699 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 17:59:43,701 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 17:59:43,702 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_14-1.c [2022-04-15 17:59:43,754 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5898d23fe/992e134095fb4cf09fbf45cf94cdae1d/FLAGf73687c51 [2022-04-15 17:59:44,129 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 17:59:44,130 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-1.c [2022-04-15 17:59:44,142 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5898d23fe/992e134095fb4cf09fbf45cf94cdae1d/FLAGf73687c51 [2022-04-15 17:59:44,518 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5898d23fe/992e134095fb4cf09fbf45cf94cdae1d [2022-04-15 17:59:44,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 17:59:44,522 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 17:59:44,525 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 17:59:44,525 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 17:59:44,529 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 17:59:44,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:59:44" (1/1) ... [2022-04-15 17:59:44,531 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fde278a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:59:44, skipping insertion in model container [2022-04-15 17:59:44,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:59:44" (1/1) ... [2022-04-15 17:59:44,540 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 17:59:44,556 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 17:59:44,705 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_14-1.c[5283,5296] [2022-04-15 17:59:44,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 17:59:44,716 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 17:59:44,741 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_14-1.c[5283,5296] [2022-04-15 17:59:44,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 17:59:44,752 INFO L208 MainTranslator]: Completed translation [2022-04-15 17:59:44,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:59:44 WrapperNode [2022-04-15 17:59:44,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 17:59:44,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 17:59:44,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 17:59:44,754 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 17:59:44,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:59:44" (1/1) ... [2022-04-15 17:59:44,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:59:44" (1/1) ... [2022-04-15 17:59:44,780 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:59:44" (1/1) ... [2022-04-15 17:59:44,780 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:59:44" (1/1) ... [2022-04-15 17:59:44,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:59:44" (1/1) ... [2022-04-15 17:59:44,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:59:44" (1/1) ... [2022-04-15 17:59:44,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:59:44" (1/1) ... [2022-04-15 17:59:44,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 17:59:44,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 17:59:44,800 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 17:59:44,800 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 17:59:44,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:59:44" (1/1) ... [2022-04-15 17:59:44,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 17:59:44,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:59:44,830 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:59:44,831 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:59:44,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 17:59:44,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 17:59:44,856 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 17:59:44,856 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 17:59:44,856 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 17:59:44,856 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 17:59:44,856 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 17:59:44,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 17:59:44,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 17:59:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 17:59:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 17:59:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 17:59:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 17:59:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 17:59:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 17:59:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 17:59:44,915 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 17:59:44,916 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 17:59:45,244 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 17:59:45,265 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 17:59:45,266 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 17:59:45,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:59:45 BoogieIcfgContainer [2022-04-15 17:59:45,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 17:59:45,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 17:59:45,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 17:59:45,286 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 17:59:45,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:59:44" (1/3) ... [2022-04-15 17:59:45,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1958be36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:59:45, skipping insertion in model container [2022-04-15 17:59:45,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:59:44" (2/3) ... [2022-04-15 17:59:45,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1958be36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:59:45, skipping insertion in model container [2022-04-15 17:59:45,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:59:45" (3/3) ... [2022-04-15 17:59:45,288 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2022-04-15 17:59:45,292 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 17:59:45,293 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 17:59:45,342 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 17:59:45,352 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:59:45,353 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 17:59:45,385 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 52 states have internal predecessors, (97), 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:59:45,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 17:59:45,393 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:59:45,393 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:59:45,394 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:59:45,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:59:45,399 INFO L85 PathProgramCache]: Analyzing trace with hash -406532905, now seen corresponding path program 1 times [2022-04-15 17:59:45,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:45,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2093216027] [2022-04-15 17:59:45,416 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:59:45,417 INFO L85 PathProgramCache]: Analyzing trace with hash -406532905, now seen corresponding path program 2 times [2022-04-15 17:59:45,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:59:45,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132920626] [2022-04-15 17:59:45,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:59:45,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:59:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:45,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:59:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:45,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {60#true} is VALID [2022-04-15 17:59:45,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#true} assume true; {60#true} is VALID [2022-04-15 17:59:45,764 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60#true} {60#true} #268#return; {60#true} is VALID [2022-04-15 17:59:45,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {60#true} call ULTIMATE.init(); {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:59:45,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {60#true} is VALID [2022-04-15 17:59:45,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {60#true} assume true; {60#true} is VALID [2022-04-15 17:59:45,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60#true} {60#true} #268#return; {60#true} is VALID [2022-04-15 17:59:45,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {60#true} call #t~ret19 := main(); {60#true} is VALID [2022-04-15 17:59:45,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {60#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {60#true} is VALID [2022-04-15 17:59:45,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {60#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {60#true} is VALID [2022-04-15 17:59:45,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {60#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {60#true} is VALID [2022-04-15 17:59:45,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {60#true} assume 0 != ~p1~0;~lk1~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-15 17:59:45,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {65#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {65#(= main_~lk1~0 1)} is VALID [2022-04-15 17:59:45,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-15 17:59:45,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-15 17:59:45,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-15 17:59:45,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-15 17:59:45,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-15 17:59:45,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-15 17:59:45,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-15 17:59:45,782 INFO L290 TraceCheckUtils]: 17: Hoare triple {65#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {65#(= main_~lk1~0 1)} is VALID [2022-04-15 17:59:45,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-15 17:59:45,784 INFO L290 TraceCheckUtils]: 19: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-15 17:59:45,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-15 17:59:45,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-15 17:59:45,787 INFO L290 TraceCheckUtils]: 22: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p1~0; {65#(= main_~lk1~0 1)} is VALID [2022-04-15 17:59:45,788 INFO L290 TraceCheckUtils]: 23: Hoare triple {65#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {61#false} is VALID [2022-04-15 17:59:45,788 INFO L290 TraceCheckUtils]: 24: Hoare triple {61#false} assume !false; {61#false} is VALID [2022-04-15 17:59:45,789 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:45,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:59:45,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132920626] [2022-04-15 17:59:45,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132920626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:45,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:45,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:45,792 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:59:45,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2093216027] [2022-04-15 17:59:45,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2093216027] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:45,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:45,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:45,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084791735] [2022-04-15 17:59:45,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:59:45,802 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:59:45,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:59:45,806 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:59:45,844 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:59:45,844 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:59:45,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:45,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:59:45,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:59:45,871 INFO L87 Difference]: Start difference. First operand has 57 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 52 states have internal predecessors, (97), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 5.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:59:46,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:46,312 INFO L93 Difference]: Finished difference Result 112 states and 199 transitions. [2022-04-15 17:59:46,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:59:46,313 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:59:46,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:59:46,314 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:59:46,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-15 17:59:46,328 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:59:46,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-15 17:59:46,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 199 transitions. [2022-04-15 17:59:46,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:59:46,547 INFO L225 Difference]: With dead ends: 112 [2022-04-15 17:59:46,547 INFO L226 Difference]: Without dead ends: 97 [2022-04-15 17:59:46,549 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 17:59:46,552 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 242 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:59:46,553 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 113 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:59:46,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-15 17:59:46,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 67. [2022-04-15 17:59:46,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:59:46,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have 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:46,588 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have 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:46,588 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have 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:46,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:46,595 INFO L93 Difference]: Finished difference Result 97 states and 177 transitions. [2022-04-15 17:59:46,595 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 177 transitions. [2022-04-15 17:59:46,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:46,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:46,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 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 97 states. [2022-04-15 17:59:46,597 INFO L87 Difference]: Start difference. First operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 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 97 states. [2022-04-15 17:59:46,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:46,604 INFO L93 Difference]: Finished difference Result 97 states and 177 transitions. [2022-04-15 17:59:46,604 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 177 transitions. [2022-04-15 17:59:46,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:46,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:46,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:59:46,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:59:46,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have 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:46,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 122 transitions. [2022-04-15 17:59:46,610 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 122 transitions. Word has length 25 [2022-04-15 17:59:46,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:59:46,611 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 122 transitions. [2022-04-15 17:59:46,611 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:59:46,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 122 transitions. [2022-04-15 17:59:46,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:59:46,754 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 122 transitions. [2022-04-15 17:59:46,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 17:59:46,759 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:59:46,760 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:59:46,760 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 17:59:46,760 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:59:46,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:59:46,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1994880807, now seen corresponding path program 1 times [2022-04-15 17:59:46,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:46,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1032993513] [2022-04-15 17:59:46,762 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:59:46,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1994880807, now seen corresponding path program 2 times [2022-04-15 17:59:46,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:59:46,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003210696] [2022-04-15 17:59:46,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:59:46,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:59:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:46,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:59:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:46,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {624#true} is VALID [2022-04-15 17:59:46,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {624#true} assume true; {624#true} is VALID [2022-04-15 17:59:46,872 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {624#true} {624#true} #268#return; {624#true} is VALID [2022-04-15 17:59:46,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {624#true} call ULTIMATE.init(); {630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:59:46,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {624#true} is VALID [2022-04-15 17:59:46,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {624#true} assume true; {624#true} is VALID [2022-04-15 17:59:46,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {624#true} {624#true} #268#return; {624#true} is VALID [2022-04-15 17:59:46,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {624#true} call #t~ret19 := main(); {624#true} is VALID [2022-04-15 17:59:46,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {624#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {624#true} is VALID [2022-04-15 17:59:46,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {624#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {624#true} is VALID [2022-04-15 17:59:46,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {624#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {624#true} is VALID [2022-04-15 17:59:46,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {624#true} assume !(0 != ~p1~0); {629#(= main_~p1~0 0)} is VALID [2022-04-15 17:59:46,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {629#(= main_~p1~0 0)} assume !(0 != ~p2~0); {629#(= main_~p1~0 0)} is VALID [2022-04-15 17:59:46,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-15 17:59:46,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-15 17:59:46,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-15 17:59:46,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-15 17:59:46,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-15 17:59:46,888 INFO L290 TraceCheckUtils]: 15: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-15 17:59:46,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-15 17:59:46,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {629#(= main_~p1~0 0)} assume !(0 != ~p10~0); {629#(= main_~p1~0 0)} is VALID [2022-04-15 17:59:46,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-15 17:59:46,889 INFO L290 TraceCheckUtils]: 19: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-15 17:59:46,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-15 17:59:46,890 INFO L290 TraceCheckUtils]: 21: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-15 17:59:46,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p1~0; {625#false} is VALID [2022-04-15 17:59:46,891 INFO L290 TraceCheckUtils]: 23: Hoare triple {625#false} assume 1 != ~lk1~0; {625#false} is VALID [2022-04-15 17:59:46,891 INFO L290 TraceCheckUtils]: 24: Hoare triple {625#false} assume !false; {625#false} is VALID [2022-04-15 17:59:46,891 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:46,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:59:46,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003210696] [2022-04-15 17:59:46,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003210696] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:46,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:46,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:46,893 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:59:46,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1032993513] [2022-04-15 17:59:46,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1032993513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:46,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:46,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:46,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864870691] [2022-04-15 17:59:46,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:59:46,894 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:59:46,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:59:46,895 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:59:46,917 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:59:46,918 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:59:46,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:46,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:59:46,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:59:46,920 INFO L87 Difference]: Start difference. First operand 67 states and 122 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:59:47,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:47,238 INFO L93 Difference]: Finished difference Result 158 states and 293 transitions. [2022-04-15 17:59:47,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:59:47,238 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:59:47,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:59:47,238 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:59:47,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2022-04-15 17:59:47,241 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:59:47,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2022-04-15 17:59:47,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 264 transitions. [2022-04-15 17:59:47,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:59:47,521 INFO L225 Difference]: With dead ends: 158 [2022-04-15 17:59:47,521 INFO L226 Difference]: Without dead ends: 97 [2022-04-15 17:59: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:59:47,525 INFO L913 BasicCegarLoop]: 120 mSDtfsCounter, 208 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:59:47,526 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 127 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:59:47,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-15 17:59:47,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2022-04-15 17:59:47,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:59:47,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have 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:47,567 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have 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:47,568 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have 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:47,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:47,572 INFO L93 Difference]: Finished difference Result 97 states and 175 transitions. [2022-04-15 17:59:47,572 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2022-04-15 17:59:47,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:47,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:47,573 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 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 97 states. [2022-04-15 17:59:47,573 INFO L87 Difference]: Start difference. First operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 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 97 states. [2022-04-15 17:59:47,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:47,578 INFO L93 Difference]: Finished difference Result 97 states and 175 transitions. [2022-04-15 17:59:47,578 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2022-04-15 17:59:47,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:47,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:47,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:59:47,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:59:47,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have 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:47,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 174 transitions. [2022-04-15 17:59:47,583 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 174 transitions. Word has length 25 [2022-04-15 17:59:47,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:59:47,583 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 174 transitions. [2022-04-15 17:59:47,584 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:59:47,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 174 transitions. [2022-04-15 17:59:47,762 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:59:47,762 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 174 transitions. [2022-04-15 17:59:47,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 17:59:47,763 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:59:47,763 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:59:47,763 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 17:59:47,764 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:59:47,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:59:47,764 INFO L85 PathProgramCache]: Analyzing trace with hash 282593920, now seen corresponding path program 1 times [2022-04-15 17:59:47,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:47,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [189077016] [2022-04-15 17:59:47,765 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:59:47,765 INFO L85 PathProgramCache]: Analyzing trace with hash 282593920, now seen corresponding path program 2 times [2022-04-15 17:59:47,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:59:47,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691250687] [2022-04-15 17:59:47,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:59:47,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:59:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:47,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:59:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:47,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {1342#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1336#true} is VALID [2022-04-15 17:59:47,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {1336#true} assume true; {1336#true} is VALID [2022-04-15 17:59:47,837 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1336#true} {1336#true} #268#return; {1336#true} is VALID [2022-04-15 17:59:47,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {1336#true} call ULTIMATE.init(); {1342#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:59:47,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {1342#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1336#true} is VALID [2022-04-15 17:59:47,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {1336#true} assume true; {1336#true} is VALID [2022-04-15 17:59:47,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1336#true} {1336#true} #268#return; {1336#true} is VALID [2022-04-15 17:59:47,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {1336#true} call #t~ret19 := main(); {1336#true} is VALID [2022-04-15 17:59:47,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {1336#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {1336#true} is VALID [2022-04-15 17:59:47,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {1336#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {1336#true} is VALID [2022-04-15 17:59:47,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {1336#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {1336#true} is VALID [2022-04-15 17:59:47,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {1336#true} assume 0 != ~p1~0;~lk1~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:59:47,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {1341#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {1341#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:59:47,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:59:47,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:59:47,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:59:47,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:59:47,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:59:47,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:59:47,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:59:47,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {1341#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {1341#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:59:47,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:59:47,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:59:47,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:59:47,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:59:47,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {1341#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1337#false} is VALID [2022-04-15 17:59:47,848 INFO L290 TraceCheckUtils]: 23: Hoare triple {1337#false} assume 0 != ~p2~0; {1337#false} is VALID [2022-04-15 17:59:47,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {1337#false} assume 1 != ~lk2~0; {1337#false} is VALID [2022-04-15 17:59:47,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {1337#false} assume !false; {1337#false} is VALID [2022-04-15 17:59:47,848 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:47,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:59:47,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691250687] [2022-04-15 17:59:47,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691250687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:47,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:47,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:47,849 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:59:47,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [189077016] [2022-04-15 17:59:47,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [189077016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:47,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:47,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:47,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381151415] [2022-04-15 17:59:47,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:59:47,850 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:59:47,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:59:47,851 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:59:47,868 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:59:47,868 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:59:47,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:47,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:59:47,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:59:47,870 INFO L87 Difference]: Start difference. First operand 95 states and 174 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:59:48,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:48,135 INFO L93 Difference]: Finished difference Result 145 states and 262 transitions. [2022-04-15 17:59:48,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:59:48,135 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:59:48,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:59:48,136 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:59:48,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2022-04-15 17:59:48,139 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:59:48,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2022-04-15 17:59:48,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 259 transitions. [2022-04-15 17:59:48,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:59:48,350 INFO L225 Difference]: With dead ends: 145 [2022-04-15 17:59:48,351 INFO L226 Difference]: Without dead ends: 100 [2022-04-15 17:59:48,351 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:59:48,352 INFO L913 BasicCegarLoop]: 146 mSDtfsCounter, 183 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:59:48,353 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 153 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:59:48,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-15 17:59:48,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2022-04-15 17:59:48,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:59:48,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have 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:48,365 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have 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:48,366 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have 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:48,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:48,370 INFO L93 Difference]: Finished difference Result 100 states and 177 transitions. [2022-04-15 17:59:48,370 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 177 transitions. [2022-04-15 17:59:48,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:48,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:48,371 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 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 100 states. [2022-04-15 17:59:48,372 INFO L87 Difference]: Start difference. First operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 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 100 states. [2022-04-15 17:59:48,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:48,376 INFO L93 Difference]: Finished difference Result 100 states and 177 transitions. [2022-04-15 17:59:48,376 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 177 transitions. [2022-04-15 17:59:48,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:48,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:48,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:59:48,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:59:48,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have 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:48,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 176 transitions. [2022-04-15 17:59:48,381 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 176 transitions. Word has length 26 [2022-04-15 17:59:48,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:59:48,381 INFO L478 AbstractCegarLoop]: Abstraction has 98 states and 176 transitions. [2022-04-15 17:59:48,382 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:59:48,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 176 transitions. [2022-04-15 17:59:48,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:59:48,545 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 176 transitions. [2022-04-15 17:59:48,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 17:59:48,546 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:59:48,546 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:59:48,546 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 17:59:48,547 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:59:48,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:59:48,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1711550786, now seen corresponding path program 1 times [2022-04-15 17:59:48,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:48,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1578943955] [2022-04-15 17:59:48,548 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:59:48,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1711550786, now seen corresponding path program 2 times [2022-04-15 17:59:48,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:59:48,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397912529] [2022-04-15 17:59:48,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:59:48,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:59:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:48,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:59:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:48,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {2040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2034#true} is VALID [2022-04-15 17:59:48,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {2034#true} assume true; {2034#true} is VALID [2022-04-15 17:59:48,600 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2034#true} {2034#true} #268#return; {2034#true} is VALID [2022-04-15 17:59:48,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {2034#true} call ULTIMATE.init(); {2040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:59:48,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {2040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2034#true} is VALID [2022-04-15 17:59:48,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {2034#true} assume true; {2034#true} is VALID [2022-04-15 17:59:48,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2034#true} {2034#true} #268#return; {2034#true} is VALID [2022-04-15 17:59:48,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {2034#true} call #t~ret19 := main(); {2034#true} is VALID [2022-04-15 17:59:48,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {2034#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {2034#true} is VALID [2022-04-15 17:59:48,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {2034#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {2034#true} is VALID [2022-04-15 17:59:48,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {2034#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {2034#true} is VALID [2022-04-15 17:59:48,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {2034#true} assume !(0 != ~p1~0); {2034#true} is VALID [2022-04-15 17:59:48,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {2034#true} assume !(0 != ~p2~0); {2039#(= main_~p2~0 0)} is VALID [2022-04-15 17:59:48,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-15 17:59:48,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-15 17:59:48,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-15 17:59:48,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-15 17:59:48,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-15 17:59:48,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-15 17:59:48,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-15 17:59:48,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {2039#(= main_~p2~0 0)} assume !(0 != ~p10~0); {2039#(= main_~p2~0 0)} is VALID [2022-04-15 17:59:48,605 INFO L290 TraceCheckUtils]: 18: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-15 17:59:48,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-15 17:59:48,606 INFO L290 TraceCheckUtils]: 20: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-15 17:59:48,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-15 17:59:48,607 INFO L290 TraceCheckUtils]: 22: Hoare triple {2039#(= main_~p2~0 0)} assume !(0 != ~p1~0); {2039#(= main_~p2~0 0)} is VALID [2022-04-15 17:59:48,607 INFO L290 TraceCheckUtils]: 23: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p2~0; {2035#false} is VALID [2022-04-15 17:59:48,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {2035#false} assume 1 != ~lk2~0; {2035#false} is VALID [2022-04-15 17:59:48,608 INFO L290 TraceCheckUtils]: 25: Hoare triple {2035#false} assume !false; {2035#false} is VALID [2022-04-15 17:59:48,608 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:48,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:59:48,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397912529] [2022-04-15 17:59:48,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397912529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:48,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:48,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:48,609 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:59:48,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1578943955] [2022-04-15 17:59:48,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1578943955] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:48,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:48,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:48,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579588914] [2022-04-15 17:59:48,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:59:48,610 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:59:48,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:59:48,610 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:59:48,628 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:59:48,628 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:59:48,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:48,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:59:48,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:59:48,629 INFO L87 Difference]: Start difference. First operand 98 states and 176 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:59:48,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:48,897 INFO L93 Difference]: Finished difference Result 274 states and 504 transitions. [2022-04-15 17:59:48,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:59:48,897 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:59:48,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:59:48,898 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:59:48,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2022-04-15 17:59:48,901 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:59:48,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2022-04-15 17:59:48,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 262 transitions. [2022-04-15 17:59:49,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:59:49,119 INFO L225 Difference]: With dead ends: 274 [2022-04-15 17:59:49,120 INFO L226 Difference]: Without dead ends: 185 [2022-04-15 17:59:49,122 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:59:49,126 INFO L913 BasicCegarLoop]: 96 mSDtfsCounter, 231 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:59:49,127 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 103 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:59:49,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-04-15 17:59:49,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2022-04-15 17:59:49,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:59:49,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have 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:49,154 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have 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:49,155 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have 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:49,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:49,161 INFO L93 Difference]: Finished difference Result 185 states and 334 transitions. [2022-04-15 17:59:49,161 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 334 transitions. [2022-04-15 17:59:49,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:49,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:49,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 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 185 states. [2022-04-15 17:59:49,163 INFO L87 Difference]: Start difference. First operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 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 185 states. [2022-04-15 17:59:49,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:49,169 INFO L93 Difference]: Finished difference Result 185 states and 334 transitions. [2022-04-15 17:59:49,169 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 334 transitions. [2022-04-15 17:59:49,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:49,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:49,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:59:49,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:59:49,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have 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:49,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 333 transitions. [2022-04-15 17:59:49,176 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 333 transitions. Word has length 26 [2022-04-15 17:59:49,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:59:49,177 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 333 transitions. [2022-04-15 17:59:49,177 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:59:49,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 183 states and 333 transitions. [2022-04-15 17:59:49,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 333 edges. 333 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:59:49,495 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 333 transitions. [2022-04-15 17:59:49,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 17:59:49,495 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:59:49,495 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:59:49,495 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 17:59:49,496 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:59:49,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:59:49,496 INFO L85 PathProgramCache]: Analyzing trace with hash -123202884, now seen corresponding path program 1 times [2022-04-15 17:59:49,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:49,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [192443242] [2022-04-15 17:59:49,497 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:59:49,497 INFO L85 PathProgramCache]: Analyzing trace with hash -123202884, now seen corresponding path program 2 times [2022-04-15 17:59:49,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:59:49,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292234483] [2022-04-15 17:59:49,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:59:49,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:59:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:49,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:59:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:49,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {3336#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3330#true} is VALID [2022-04-15 17:59:49,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {3330#true} assume true; {3330#true} is VALID [2022-04-15 17:59:49,549 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3330#true} {3330#true} #268#return; {3330#true} is VALID [2022-04-15 17:59:49,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {3330#true} call ULTIMATE.init(); {3336#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:59:49,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {3336#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3330#true} is VALID [2022-04-15 17:59:49,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {3330#true} assume true; {3330#true} is VALID [2022-04-15 17:59:49,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3330#true} {3330#true} #268#return; {3330#true} is VALID [2022-04-15 17:59:49,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {3330#true} call #t~ret19 := main(); {3330#true} is VALID [2022-04-15 17:59:49,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {3330#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {3330#true} is VALID [2022-04-15 17:59:49,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {3330#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {3330#true} is VALID [2022-04-15 17:59:49,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {3330#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {3330#true} is VALID [2022-04-15 17:59:49,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {3330#true} assume !(0 != ~p1~0); {3330#true} is VALID [2022-04-15 17:59:49,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {3330#true} assume 0 != ~p2~0;~lk2~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 17:59:49,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 17:59:49,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 17:59:49,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 17:59:49,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 17:59:49,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 17:59:49,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 17:59:49,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 17:59:49,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {3335#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 17:59:49,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 17:59:49,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 17:59:49,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 17:59:49,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 17:59:49,557 INFO L290 TraceCheckUtils]: 22: Hoare triple {3335#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 17:59:49,557 INFO L290 TraceCheckUtils]: 23: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p2~0; {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 17:59:49,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {3335#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {3331#false} is VALID [2022-04-15 17:59:49,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {3331#false} assume !false; {3331#false} is VALID [2022-04-15 17:59:49,558 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:49,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:59:49,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292234483] [2022-04-15 17:59:49,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292234483] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:49,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:49,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:49,559 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:59:49,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [192443242] [2022-04-15 17:59:49,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [192443242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:49,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:49,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:49,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308972033] [2022-04-15 17:59:49,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:59:49,560 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:59:49,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:59:49,560 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:59:49,577 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:59:49,577 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:59:49,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:49,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:59:49,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:59:49,578 INFO L87 Difference]: Start difference. First operand 183 states and 333 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:59:49,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:49,827 INFO L93 Difference]: Finished difference Result 239 states and 435 transitions. [2022-04-15 17:59:49,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:59:49,827 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:59:49,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:59:49,828 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:59:49,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-15 17:59:49,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:59:49,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-15 17:59:49,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 172 transitions. [2022-04-15 17:59:49,968 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:59:49,973 INFO L225 Difference]: With dead ends: 239 [2022-04-15 17:59:49,973 INFO L226 Difference]: Without dead ends: 237 [2022-04-15 17:59:49,973 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:59:49,974 INFO L913 BasicCegarLoop]: 169 mSDtfsCounter, 150 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:59:49,974 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 176 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:59:49,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-04-15 17:59:49,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 183. [2022-04-15 17:59:49,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:59:49,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have 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:49,991 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have 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:49,991 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have 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:49,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:49,998 INFO L93 Difference]: Finished difference Result 237 states and 432 transitions. [2022-04-15 17:59:49,998 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 432 transitions. [2022-04-15 17:59:49,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:49,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:50,000 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 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 237 states. [2022-04-15 17:59:50,000 INFO L87 Difference]: Start difference. First operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 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 237 states. [2022-04-15 17:59:50,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:50,008 INFO L93 Difference]: Finished difference Result 237 states and 432 transitions. [2022-04-15 17:59:50,008 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 432 transitions. [2022-04-15 17:59:50,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:50,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:50,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:59:50,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:59:50,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have 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:50,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 331 transitions. [2022-04-15 17:59:50,015 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 331 transitions. Word has length 26 [2022-04-15 17:59:50,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:59:50,015 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 331 transitions. [2022-04-15 17:59:50,015 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:59:50,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 183 states and 331 transitions. [2022-04-15 17:59:50,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 331 edges. 331 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:59:50,333 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 331 transitions. [2022-04-15 17:59:50,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 17:59:50,333 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:59:50,333 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:59:50,333 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 17:59:50,334 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:59:50,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:59:50,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1518254386, now seen corresponding path program 1 times [2022-04-15 17:59:50,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:50,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [350981512] [2022-04-15 17:59:50,335 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:59:50,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1518254386, now seen corresponding path program 2 times [2022-04-15 17:59:50,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:59:50,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588878133] [2022-04-15 17:59:50,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:59:50,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:59:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:50,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:59:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:50,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {4666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4660#true} is VALID [2022-04-15 17:59:50,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {4660#true} assume true; {4660#true} is VALID [2022-04-15 17:59:50,380 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4660#true} {4660#true} #268#return; {4660#true} is VALID [2022-04-15 17:59:50,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {4660#true} call ULTIMATE.init(); {4666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:59:50,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {4666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4660#true} is VALID [2022-04-15 17:59:50,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {4660#true} assume true; {4660#true} is VALID [2022-04-15 17:59:50,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4660#true} {4660#true} #268#return; {4660#true} is VALID [2022-04-15 17:59:50,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {4660#true} call #t~ret19 := main(); {4660#true} is VALID [2022-04-15 17:59:50,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {4660#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {4660#true} is VALID [2022-04-15 17:59:50,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {4660#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {4660#true} is VALID [2022-04-15 17:59:50,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {4660#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {4660#true} is VALID [2022-04-15 17:59:50,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {4660#true} assume !(0 != ~p1~0); {4660#true} is VALID [2022-04-15 17:59:50,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {4660#true} assume !(0 != ~p2~0); {4660#true} is VALID [2022-04-15 17:59:50,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {4660#true} assume 0 != ~p3~0;~lk3~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 17:59:50,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 17:59:50,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 17:59:50,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 17:59:50,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 17:59:50,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 17:59:50,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 17:59:50,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {4665#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 17:59:50,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 17:59:50,385 INFO L290 TraceCheckUtils]: 19: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 17:59:50,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 17:59:50,386 INFO L290 TraceCheckUtils]: 21: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 17:59:50,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {4665#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 17:59:50,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {4665#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 17:59:50,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p3~0; {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 17:59:50,388 INFO L290 TraceCheckUtils]: 25: Hoare triple {4665#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {4661#false} is VALID [2022-04-15 17:59:50,388 INFO L290 TraceCheckUtils]: 26: Hoare triple {4661#false} assume !false; {4661#false} is VALID [2022-04-15 17:59:50,388 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:50,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:59:50,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588878133] [2022-04-15 17:59:50,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588878133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:50,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:50,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:50,389 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:59:50,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [350981512] [2022-04-15 17:59:50,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [350981512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:50,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:50,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:50,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112618261] [2022-04-15 17:59:50,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:59:50,390 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:59:50,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:59:50,390 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:59:50,408 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:59:50,408 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:59:50,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:50,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:59:50,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:59:50,409 INFO L87 Difference]: Start difference. First operand 183 states and 331 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:59:50,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:50,666 INFO L93 Difference]: Finished difference Result 347 states and 635 transitions. [2022-04-15 17:59:50,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:59:50,667 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:59:50,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:59:50,668 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:59:50,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-15 17:59:50,671 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:59:50,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-15 17:59:50,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 171 transitions. [2022-04-15 17:59:50,796 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:59:50,804 INFO L225 Difference]: With dead ends: 347 [2022-04-15 17:59:50,804 INFO L226 Difference]: Without dead ends: 345 [2022-04-15 17:59:50,804 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:59:50,805 INFO L913 BasicCegarLoop]: 93 mSDtfsCounter, 222 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:59:50,805 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 100 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:59:50,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-04-15 17:59:50,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 247. [2022-04-15 17:59:50,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:59:50,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 2 states have 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:50,825 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 2 states have 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:50,825 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 2 states have 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:50,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:50,834 INFO L93 Difference]: Finished difference Result 345 states and 630 transitions. [2022-04-15 17:59:50,834 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 630 transitions. [2022-04-15 17:59:50,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:50,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:50,836 INFO L74 IsIncluded]: Start isIncluded. First operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 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 345 states. [2022-04-15 17:59:50,836 INFO L87 Difference]: Start difference. First operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 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 345 states. [2022-04-15 17:59:50,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:50,845 INFO L93 Difference]: Finished difference Result 345 states and 630 transitions. [2022-04-15 17:59:50,845 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 630 transitions. [2022-04-15 17:59:50,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:50,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:50,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:59:50,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:59:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 2 states have 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:50,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 445 transitions. [2022-04-15 17:59:50,853 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 445 transitions. Word has length 27 [2022-04-15 17:59:50,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:59:50,854 INFO L478 AbstractCegarLoop]: Abstraction has 247 states and 445 transitions. [2022-04-15 17:59:50,854 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:59:50,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 247 states and 445 transitions. [2022-04-15 17:59:51,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:59:51,268 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 445 transitions. [2022-04-15 17:59:51,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 17:59:51,269 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:59:51,269 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:59:51,269 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 17:59:51,269 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:59:51,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:59:51,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1188365008, now seen corresponding path program 1 times [2022-04-15 17:59:51,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:51,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1144334492] [2022-04-15 17:59:51,270 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:59:51,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1188365008, now seen corresponding path program 2 times [2022-04-15 17:59:51,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:59:51,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115763456] [2022-04-15 17:59:51,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:59:51,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:59:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:51,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:59:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:51,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {6556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {6550#true} is VALID [2022-04-15 17:59:51,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {6550#true} assume true; {6550#true} is VALID [2022-04-15 17:59:51,357 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6550#true} {6550#true} #268#return; {6550#true} is VALID [2022-04-15 17:59:51,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {6550#true} call ULTIMATE.init(); {6556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:59:51,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {6556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {6550#true} is VALID [2022-04-15 17:59:51,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {6550#true} assume true; {6550#true} is VALID [2022-04-15 17:59:51,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6550#true} {6550#true} #268#return; {6550#true} is VALID [2022-04-15 17:59:51,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {6550#true} call #t~ret19 := main(); {6550#true} is VALID [2022-04-15 17:59:51,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {6550#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {6550#true} is VALID [2022-04-15 17:59:51,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {6550#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {6550#true} is VALID [2022-04-15 17:59:51,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {6550#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {6550#true} is VALID [2022-04-15 17:59:51,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {6550#true} assume !(0 != ~p1~0); {6550#true} is VALID [2022-04-15 17:59:51,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {6550#true} assume !(0 != ~p2~0); {6550#true} is VALID [2022-04-15 17:59:51,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {6550#true} assume !(0 != ~p3~0); {6555#(= main_~p3~0 0)} is VALID [2022-04-15 17:59:51,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-15 17:59:51,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-15 17:59:51,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-15 17:59:51,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-15 17:59:51,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-15 17:59:51,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-15 17:59:51,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {6555#(= main_~p3~0 0)} assume !(0 != ~p10~0); {6555#(= main_~p3~0 0)} is VALID [2022-04-15 17:59:51,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-15 17:59:51,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-15 17:59:51,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-15 17:59:51,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-15 17:59:51,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {6555#(= main_~p3~0 0)} assume !(0 != ~p1~0); {6555#(= main_~p3~0 0)} is VALID [2022-04-15 17:59:51,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {6555#(= main_~p3~0 0)} assume !(0 != ~p2~0); {6555#(= main_~p3~0 0)} is VALID [2022-04-15 17:59:51,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p3~0; {6551#false} is VALID [2022-04-15 17:59:51,364 INFO L290 TraceCheckUtils]: 25: Hoare triple {6551#false} assume 1 != ~lk3~0; {6551#false} is VALID [2022-04-15 17:59:51,364 INFO L290 TraceCheckUtils]: 26: Hoare triple {6551#false} assume !false; {6551#false} is VALID [2022-04-15 17:59:51,364 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:51,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:59:51,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115763456] [2022-04-15 17:59:51,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115763456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:51,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:51,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:51,365 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:59:51,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1144334492] [2022-04-15 17:59:51,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1144334492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:51,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:51,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:51,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219892985] [2022-04-15 17:59:51,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:59:51,365 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:59:51,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:59:51,366 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:59:51,386 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:59:51,386 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:59:51,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:51,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:59:51,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:59:51,387 INFO L87 Difference]: Start difference. First operand 247 states and 445 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:59:51,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:51,659 INFO L93 Difference]: Finished difference Result 591 states and 1075 transitions. [2022-04-15 17:59:51,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:59:51,660 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:59:51,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:59:51,660 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:59:51,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2022-04-15 17:59:51,663 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:59:51,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2022-04-15 17:59:51,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 258 transitions. [2022-04-15 17:59:51,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:59:51,866 INFO L225 Difference]: With dead ends: 591 [2022-04-15 17:59:51,867 INFO L226 Difference]: Without dead ends: 353 [2022-04-15 17:59:51,870 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:59:51,871 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 196 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:59:51,872 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 131 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:59:51,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-04-15 17:59:51,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2022-04-15 17:59:51,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:59:51,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 353 states. Second operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have 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:51,902 INFO L74 IsIncluded]: Start isIncluded. First operand 353 states. Second operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have 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:51,903 INFO L87 Difference]: Start difference. First operand 353 states. Second operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have 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:51,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:51,913 INFO L93 Difference]: Finished difference Result 353 states and 632 transitions. [2022-04-15 17:59:51,913 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 632 transitions. [2022-04-15 17:59:51,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:51,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:51,915 INFO L74 IsIncluded]: Start isIncluded. First operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 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 353 states. [2022-04-15 17:59:51,916 INFO L87 Difference]: Start difference. First operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 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 353 states. [2022-04-15 17:59:51,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:51,925 INFO L93 Difference]: Finished difference Result 353 states and 632 transitions. [2022-04-15 17:59:51,925 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 632 transitions. [2022-04-15 17:59:51,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:51,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:51,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:59:51,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:59:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have 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:51,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 631 transitions. [2022-04-15 17:59:51,938 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 631 transitions. Word has length 27 [2022-04-15 17:59:51,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:59:51,938 INFO L478 AbstractCegarLoop]: Abstraction has 351 states and 631 transitions. [2022-04-15 17:59:51,938 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:59:51,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 351 states and 631 transitions. [2022-04-15 17:59:52,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 631 edges. 631 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:59:52,602 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 631 transitions. [2022-04-15 17:59:52,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 17:59:52,603 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:59:52,603 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:59:52,603 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 17:59:52,603 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:59:52,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:59:52,604 INFO L85 PathProgramCache]: Analyzing trace with hash 178967059, now seen corresponding path program 1 times [2022-04-15 17:59:52,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:52,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1616817484] [2022-04-15 17:59:52,604 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:59:52,604 INFO L85 PathProgramCache]: Analyzing trace with hash 178967059, now seen corresponding path program 2 times [2022-04-15 17:59:52,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:59:52,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328728941] [2022-04-15 17:59:52,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:59:52,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:59:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:52,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:59:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:52,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {9158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {9152#true} is VALID [2022-04-15 17:59:52,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {9152#true} assume true; {9152#true} is VALID [2022-04-15 17:59:52,645 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9152#true} {9152#true} #268#return; {9152#true} is VALID [2022-04-15 17:59:52,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {9152#true} call ULTIMATE.init(); {9158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:59:52,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {9158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {9152#true} is VALID [2022-04-15 17:59:52,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {9152#true} assume true; {9152#true} is VALID [2022-04-15 17:59:52,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9152#true} {9152#true} #268#return; {9152#true} is VALID [2022-04-15 17:59:52,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {9152#true} call #t~ret19 := main(); {9152#true} is VALID [2022-04-15 17:59:52,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {9152#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {9152#true} is VALID [2022-04-15 17:59:52,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {9152#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {9152#true} is VALID [2022-04-15 17:59:52,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {9152#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {9152#true} is VALID [2022-04-15 17:59:52,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {9152#true} assume !(0 != ~p1~0); {9152#true} is VALID [2022-04-15 17:59:52,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {9152#true} assume !(0 != ~p2~0); {9152#true} is VALID [2022-04-15 17:59:52,647 INFO L290 TraceCheckUtils]: 10: Hoare triple {9152#true} assume 0 != ~p3~0;~lk3~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:59:52,647 INFO L290 TraceCheckUtils]: 11: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:59:52,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:59:52,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:59:52,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:59:52,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:59:52,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:59:52,649 INFO L290 TraceCheckUtils]: 17: Hoare triple {9157#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {9157#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:59:52,649 INFO L290 TraceCheckUtils]: 18: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:59:52,650 INFO L290 TraceCheckUtils]: 19: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:59:52,650 INFO L290 TraceCheckUtils]: 20: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:59:52,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:59:52,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {9157#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {9157#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:59:52,651 INFO L290 TraceCheckUtils]: 23: Hoare triple {9157#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {9157#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:59:52,651 INFO L290 TraceCheckUtils]: 24: Hoare triple {9157#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {9153#false} is VALID [2022-04-15 17:59:52,651 INFO L290 TraceCheckUtils]: 25: Hoare triple {9153#false} assume 0 != ~p4~0; {9153#false} is VALID [2022-04-15 17:59:52,652 INFO L290 TraceCheckUtils]: 26: Hoare triple {9153#false} assume 1 != ~lk4~0; {9153#false} is VALID [2022-04-15 17:59:52,652 INFO L290 TraceCheckUtils]: 27: Hoare triple {9153#false} assume !false; {9153#false} is VALID [2022-04-15 17:59:52,652 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:52,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:59:52,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328728941] [2022-04-15 17:59:52,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328728941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:52,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:52,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:52,653 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:59:52,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1616817484] [2022-04-15 17:59:52,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1616817484] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:52,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:52,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:52,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188206792] [2022-04-15 17:59:52,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:59:52,654 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:59:52,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:59:52,654 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:59:52,671 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:59:52,672 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:59:52,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:52,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:59:52,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:59:52,672 INFO L87 Difference]: Start difference. First operand 351 states and 631 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:59:52,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:52,935 INFO L93 Difference]: Finished difference Result 529 states and 949 transitions. [2022-04-15 17:59:52,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:59:52,935 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:59:52,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:59:52,936 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:59:52,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2022-04-15 17:59:52,938 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:59:52,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2022-04-15 17:59:52,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 253 transitions. [2022-04-15 17:59:53,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:59:53,116 INFO L225 Difference]: With dead ends: 529 [2022-04-15 17:59:53,116 INFO L226 Difference]: Without dead ends: 359 [2022-04-15 17:59:53,116 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:59:53,117 INFO L913 BasicCegarLoop]: 140 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:59:53,117 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 147 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:59:53,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-04-15 17:59:53,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2022-04-15 17:59:53,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:59:53,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 359 states. Second operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 2 states have 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:53,146 INFO L74 IsIncluded]: Start isIncluded. First operand 359 states. Second operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 2 states have 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:53,146 INFO L87 Difference]: Start difference. First operand 359 states. Second operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 2 states have 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:53,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:53,156 INFO L93 Difference]: Finished difference Result 359 states and 636 transitions. [2022-04-15 17:59:53,156 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 636 transitions. [2022-04-15 17:59:53,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:53,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:53,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 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 359 states. [2022-04-15 17:59:53,159 INFO L87 Difference]: Start difference. First operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 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 359 states. [2022-04-15 17:59:53,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:53,169 INFO L93 Difference]: Finished difference Result 359 states and 636 transitions. [2022-04-15 17:59:53,169 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 636 transitions. [2022-04-15 17:59:53,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:53,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:53,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:59:53,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:59:53,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 2 states have 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:53,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 635 transitions. [2022-04-15 17:59:53,205 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 635 transitions. Word has length 28 [2022-04-15 17:59:53,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:59:53,206 INFO L478 AbstractCegarLoop]: Abstraction has 357 states and 635 transitions. [2022-04-15 17:59:53,206 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:59:53,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 357 states and 635 transitions. [2022-04-15 17:59:53,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 635 edges. 635 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:59:53,857 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 635 transitions. [2022-04-15 17:59:53,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 17:59:53,857 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:59:53,857 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:59:53,858 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 17:59:53,858 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:59:53,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:59:53,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1815177647, now seen corresponding path program 1 times [2022-04-15 17:59:53,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:53,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [735922626] [2022-04-15 17:59:53,859 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:59:53,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1815177647, now seen corresponding path program 2 times [2022-04-15 17:59:53,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:59:53,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091400979] [2022-04-15 17:59:53,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:59:53,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:59:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:53,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:59:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:53,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {11660#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {11654#true} is VALID [2022-04-15 17:59:53,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {11654#true} assume true; {11654#true} is VALID [2022-04-15 17:59:53,905 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11654#true} {11654#true} #268#return; {11654#true} is VALID [2022-04-15 17:59:53,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {11654#true} call ULTIMATE.init(); {11660#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:59:53,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {11660#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {11654#true} is VALID [2022-04-15 17:59:53,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {11654#true} assume true; {11654#true} is VALID [2022-04-15 17:59:53,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11654#true} {11654#true} #268#return; {11654#true} is VALID [2022-04-15 17:59:53,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {11654#true} call #t~ret19 := main(); {11654#true} is VALID [2022-04-15 17:59:53,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {11654#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {11654#true} is VALID [2022-04-15 17:59:53,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {11654#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {11654#true} is VALID [2022-04-15 17:59:53,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {11654#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {11654#true} is VALID [2022-04-15 17:59:53,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {11654#true} assume !(0 != ~p1~0); {11654#true} is VALID [2022-04-15 17:59:53,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {11654#true} assume !(0 != ~p2~0); {11654#true} is VALID [2022-04-15 17:59:53,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {11654#true} assume !(0 != ~p3~0); {11654#true} is VALID [2022-04-15 17:59:53,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {11654#true} assume 0 != ~p4~0;~lk4~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 17:59:53,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 17:59:53,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 17:59:53,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 17:59:53,908 INFO L290 TraceCheckUtils]: 15: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 17:59:53,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 17:59:53,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {11659#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 17:59:53,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 17:59:53,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 17:59:53,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 17:59:53,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 17:59:53,911 INFO L290 TraceCheckUtils]: 22: Hoare triple {11659#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 17:59:53,911 INFO L290 TraceCheckUtils]: 23: Hoare triple {11659#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 17:59:53,912 INFO L290 TraceCheckUtils]: 24: Hoare triple {11659#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 17:59:53,912 INFO L290 TraceCheckUtils]: 25: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p4~0; {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 17:59:53,912 INFO L290 TraceCheckUtils]: 26: Hoare triple {11659#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {11655#false} is VALID [2022-04-15 17:59:53,912 INFO L290 TraceCheckUtils]: 27: Hoare triple {11655#false} assume !false; {11655#false} is VALID [2022-04-15 17:59:53,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:59:53,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:59:53,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091400979] [2022-04-15 17:59:53,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091400979] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:53,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:53,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:53,913 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:59:53,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [735922626] [2022-04-15 17:59:53,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [735922626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:53,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:53,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:53,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167380947] [2022-04-15 17:59:53,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:59:53,914 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:59:53,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:59:53,914 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:59:53,932 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:59:53,933 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:59:53,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:53,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:59:53,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:59:53,933 INFO L87 Difference]: Start difference. First operand 357 states and 635 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:59:54,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:54,218 INFO L93 Difference]: Finished difference Result 669 states and 1205 transitions. [2022-04-15 17:59:54,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:59:54,218 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:59:54,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:59:54,218 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:59:54,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2022-04-15 17:59:54,220 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:59:54,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2022-04-15 17:59:54,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 167 transitions. [2022-04-15 17:59:54,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:59:54,384 INFO L225 Difference]: With dead ends: 669 [2022-04-15 17:59:54,384 INFO L226 Difference]: Without dead ends: 667 [2022-04-15 17:59:54,385 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:59:54,387 INFO L913 BasicCegarLoop]: 92 mSDtfsCounter, 215 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:59:54,387 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 99 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:59:54,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-04-15 17:59:54,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 489. [2022-04-15 17:59:54,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:59:54,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 667 states. Second operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 2 states have 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:54,425 INFO L74 IsIncluded]: Start isIncluded. First operand 667 states. Second operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 2 states have 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:54,426 INFO L87 Difference]: Start difference. First operand 667 states. Second operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 2 states have 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:54,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:54,451 INFO L93 Difference]: Finished difference Result 667 states and 1196 transitions. [2022-04-15 17:59:54,451 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1196 transitions. [2022-04-15 17:59:54,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:54,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:54,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 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 667 states. [2022-04-15 17:59:54,454 INFO L87 Difference]: Start difference. First operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 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 667 states. [2022-04-15 17:59:54,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:54,477 INFO L93 Difference]: Finished difference Result 667 states and 1196 transitions. [2022-04-15 17:59:54,477 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1196 transitions. [2022-04-15 17:59:54,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:54,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:54,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:59:54,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:59:54,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 2 states have 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:54,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 859 transitions. [2022-04-15 17:59:54,496 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 859 transitions. Word has length 28 [2022-04-15 17:59:54,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:59:54,496 INFO L478 AbstractCegarLoop]: Abstraction has 489 states and 859 transitions. [2022-04-15 17:59:54,497 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:59:54,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 489 states and 859 transitions. [2022-04-15 17:59:55,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 859 edges. 859 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:59:55,401 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 859 transitions. [2022-04-15 17:59:55,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 17:59:55,402 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:59:55,402 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:59:55,402 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 17:59:55,402 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:59:55,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:59:55,403 INFO L85 PathProgramCache]: Analyzing trace with hash 891441747, now seen corresponding path program 1 times [2022-04-15 17:59:55,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:55,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [93894974] [2022-04-15 17:59:55,403 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:59:55,403 INFO L85 PathProgramCache]: Analyzing trace with hash 891441747, now seen corresponding path program 2 times [2022-04-15 17:59:55,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:59:55,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042447748] [2022-04-15 17:59:55,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:59:55,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:59:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:55,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:59:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:55,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {15322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {15316#true} is VALID [2022-04-15 17:59:55,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {15316#true} assume true; {15316#true} is VALID [2022-04-15 17:59:55,466 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15316#true} {15316#true} #268#return; {15316#true} is VALID [2022-04-15 17:59:55,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {15316#true} call ULTIMATE.init(); {15322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:59:55,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {15322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {15316#true} is VALID [2022-04-15 17:59:55,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {15316#true} assume true; {15316#true} is VALID [2022-04-15 17:59:55,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15316#true} {15316#true} #268#return; {15316#true} is VALID [2022-04-15 17:59:55,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {15316#true} call #t~ret19 := main(); {15316#true} is VALID [2022-04-15 17:59:55,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {15316#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {15316#true} is VALID [2022-04-15 17:59:55,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {15316#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {15316#true} is VALID [2022-04-15 17:59:55,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {15316#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {15316#true} is VALID [2022-04-15 17:59:55,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {15316#true} assume !(0 != ~p1~0); {15316#true} is VALID [2022-04-15 17:59:55,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {15316#true} assume !(0 != ~p2~0); {15316#true} is VALID [2022-04-15 17:59:55,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {15316#true} assume !(0 != ~p3~0); {15316#true} is VALID [2022-04-15 17:59:55,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {15316#true} assume !(0 != ~p4~0); {15321#(= main_~p4~0 0)} is VALID [2022-04-15 17:59:55,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-15 17:59:55,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-15 17:59:55,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-15 17:59:55,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-15 17:59:55,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-15 17:59:55,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {15321#(= main_~p4~0 0)} assume !(0 != ~p10~0); {15321#(= main_~p4~0 0)} is VALID [2022-04-15 17:59:55,470 INFO L290 TraceCheckUtils]: 18: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-15 17:59:55,470 INFO L290 TraceCheckUtils]: 19: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-15 17:59:55,470 INFO L290 TraceCheckUtils]: 20: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-15 17:59:55,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-15 17:59:55,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {15321#(= main_~p4~0 0)} assume !(0 != ~p1~0); {15321#(= main_~p4~0 0)} is VALID [2022-04-15 17:59:55,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {15321#(= main_~p4~0 0)} assume !(0 != ~p2~0); {15321#(= main_~p4~0 0)} is VALID [2022-04-15 17:59:55,472 INFO L290 TraceCheckUtils]: 24: Hoare triple {15321#(= main_~p4~0 0)} assume !(0 != ~p3~0); {15321#(= main_~p4~0 0)} is VALID [2022-04-15 17:59:55,472 INFO L290 TraceCheckUtils]: 25: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p4~0; {15317#false} is VALID [2022-04-15 17:59:55,472 INFO L290 TraceCheckUtils]: 26: Hoare triple {15317#false} assume 1 != ~lk4~0; {15317#false} is VALID [2022-04-15 17:59:55,473 INFO L290 TraceCheckUtils]: 27: Hoare triple {15317#false} assume !false; {15317#false} is VALID [2022-04-15 17:59:55,475 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:55,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:59:55,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042447748] [2022-04-15 17:59:55,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042447748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:55,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:55,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:55,476 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:59:55,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [93894974] [2022-04-15 17:59:55,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [93894974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:55,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:55,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:55,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422138434] [2022-04-15 17:59:55,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:59:55,477 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:59:55,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:59:55,477 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:59:55,494 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:59:55,495 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:59:55,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:55,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:59:55,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:59:55,495 INFO L87 Difference]: Start difference. First operand 489 states and 859 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:59:55,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:55,859 INFO L93 Difference]: Finished difference Result 1165 states and 2061 transitions. [2022-04-15 17:59:55,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:59:55,859 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:59:55,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:59:55,860 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:59:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 255 transitions. [2022-04-15 17:59:55,862 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:59:55,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 255 transitions. [2022-04-15 17:59:55,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 255 transitions. [2022-04-15 17:59:56,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:59:56,095 INFO L225 Difference]: With dead ends: 1165 [2022-04-15 17:59:56,096 INFO L226 Difference]: Without dead ends: 691 [2022-04-15 17:59:56,097 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:59:56,097 INFO L913 BasicCegarLoop]: 126 mSDtfsCounter, 190 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:59:56,098 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 133 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:59:56,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-04-15 17:59:56,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 689. [2022-04-15 17:59:56,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:59:56,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 691 states. Second operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have 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:56,155 INFO L74 IsIncluded]: Start isIncluded. First operand 691 states. Second operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have 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:56,158 INFO L87 Difference]: Start difference. First operand 691 states. Second operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have 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:56,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:56,181 INFO L93 Difference]: Finished difference Result 691 states and 1208 transitions. [2022-04-15 17:59:56,181 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1208 transitions. [2022-04-15 17:59:56,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:56,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:56,184 INFO L74 IsIncluded]: Start isIncluded. First operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 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 691 states. [2022-04-15 17:59:56,185 INFO L87 Difference]: Start difference. First operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 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 691 states. [2022-04-15 17:59:56,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:56,209 INFO L93 Difference]: Finished difference Result 691 states and 1208 transitions. [2022-04-15 17:59:56,209 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1208 transitions. [2022-04-15 17:59:56,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:56,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:56,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:59:56,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:59:56,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have 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:56,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1207 transitions. [2022-04-15 17:59:56,246 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1207 transitions. Word has length 28 [2022-04-15 17:59:56,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:59:56,246 INFO L478 AbstractCegarLoop]: Abstraction has 689 states and 1207 transitions. [2022-04-15 17:59:56,246 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:59:56,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 689 states and 1207 transitions. [2022-04-15 17:59:57,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1207 edges. 1207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:59:57,482 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1207 transitions. [2022-04-15 17:59:57,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 17:59:57,482 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:59:57,483 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:59:57,483 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 17:59:57,483 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:59:57,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:59:57,483 INFO L85 PathProgramCache]: Analyzing trace with hash -435719099, now seen corresponding path program 1 times [2022-04-15 17:59:57,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:57,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1546290221] [2022-04-15 17:59:57,484 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:59:57,484 INFO L85 PathProgramCache]: Analyzing trace with hash -435719099, now seen corresponding path program 2 times [2022-04-15 17:59:57,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:59:57,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196758787] [2022-04-15 17:59:57,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:59:57,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:59:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:57,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:59:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:57,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {20424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {20418#true} is VALID [2022-04-15 17:59:57,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {20418#true} assume true; {20418#true} is VALID [2022-04-15 17:59:57,543 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20418#true} {20418#true} #268#return; {20418#true} is VALID [2022-04-15 17:59:57,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {20418#true} call ULTIMATE.init(); {20424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:59:57,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {20424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {20418#true} is VALID [2022-04-15 17:59:57,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {20418#true} assume true; {20418#true} is VALID [2022-04-15 17:59:57,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20418#true} {20418#true} #268#return; {20418#true} is VALID [2022-04-15 17:59:57,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {20418#true} call #t~ret19 := main(); {20418#true} is VALID [2022-04-15 17:59:57,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {20418#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {20418#true} is VALID [2022-04-15 17:59:57,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {20418#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {20418#true} is VALID [2022-04-15 17:59:57,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {20418#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {20418#true} is VALID [2022-04-15 17:59:57,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {20418#true} assume !(0 != ~p1~0); {20418#true} is VALID [2022-04-15 17:59:57,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {20418#true} assume !(0 != ~p2~0); {20418#true} is VALID [2022-04-15 17:59:57,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {20418#true} assume !(0 != ~p3~0); {20418#true} is VALID [2022-04-15 17:59:57,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {20418#true} assume 0 != ~p4~0;~lk4~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:59:57,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:59:57,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:59:57,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:59:57,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:59:57,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:59:57,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {20423#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {20423#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:59:57,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:59:57,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:59:57,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:59:57,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:59:57,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {20423#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {20423#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:59:57,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {20423#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {20423#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:59:57,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {20423#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {20423#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:59:57,553 INFO L290 TraceCheckUtils]: 25: Hoare triple {20423#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {20419#false} is VALID [2022-04-15 17:59:57,553 INFO L290 TraceCheckUtils]: 26: Hoare triple {20419#false} assume 0 != ~p5~0; {20419#false} is VALID [2022-04-15 17:59:57,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {20419#false} assume 1 != ~lk5~0; {20419#false} is VALID [2022-04-15 17:59:57,553 INFO L290 TraceCheckUtils]: 28: Hoare triple {20419#false} assume !false; {20419#false} is VALID [2022-04-15 17:59:57,553 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:57,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:59:57,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196758787] [2022-04-15 17:59:57,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196758787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:57,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:57,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:57,554 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:59:57,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1546290221] [2022-04-15 17:59:57,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1546290221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:57,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:57,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:57,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227399964] [2022-04-15 17:59:57,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:59:57,555 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:59:57,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:59:57,555 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:59:57,573 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:59:57,573 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:59:57,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:57,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:59:57,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:59:57,573 INFO L87 Difference]: Start difference. First operand 689 states and 1207 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:59:57,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:57,911 INFO L93 Difference]: Finished difference Result 1033 states and 1805 transitions. [2022-04-15 17:59:57,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:59:57,911 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:59:57,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:59:57,911 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:59:57,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2022-04-15 17:59:57,913 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:59:57,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2022-04-15 17:59:57,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 250 transitions. [2022-04-15 17:59:58,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:59:58,147 INFO L225 Difference]: With dead ends: 1033 [2022-04-15 17:59:58,147 INFO L226 Difference]: Without dead ends: 699 [2022-04-15 17:59:58,148 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:59:58,149 INFO L913 BasicCegarLoop]: 137 mSDtfsCounter, 180 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:59:58,149 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 144 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:59:58,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-04-15 17:59:58,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2022-04-15 17:59:58,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:59:58,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have 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:58,209 INFO L74 IsIncluded]: Start isIncluded. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have 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:58,210 INFO L87 Difference]: Start difference. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have 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:58,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:58,231 INFO L93 Difference]: Finished difference Result 699 states and 1208 transitions. [2022-04-15 17:59:58,231 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1208 transitions. [2022-04-15 17:59:58,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:58,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:58,233 INFO L74 IsIncluded]: Start isIncluded. First operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 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 699 states. [2022-04-15 17:59:58,234 INFO L87 Difference]: Start difference. First operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 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 699 states. [2022-04-15 17:59:58,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:58,256 INFO L93 Difference]: Finished difference Result 699 states and 1208 transitions. [2022-04-15 17:59:58,256 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1208 transitions. [2022-04-15 17:59:58,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:58,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:58,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:59:58,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:59:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have 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:58,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1207 transitions. [2022-04-15 17:59:58,289 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1207 transitions. Word has length 29 [2022-04-15 17:59:58,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:59:58,289 INFO L478 AbstractCegarLoop]: Abstraction has 697 states and 1207 transitions. [2022-04-15 17:59:58,289 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:59:58,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 697 states and 1207 transitions. [2022-04-15 17:59:59,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1207 edges. 1207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:59:59,475 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1207 transitions. [2022-04-15 17:59:59,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 17:59:59,476 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:59:59,476 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:59:59,476 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 17:59:59,477 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:59:59,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:59:59,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1865103491, now seen corresponding path program 1 times [2022-04-15 17:59:59,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:59,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1672937576] [2022-04-15 17:59:59,478 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:59:59,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1865103491, now seen corresponding path program 2 times [2022-04-15 17:59:59,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:59:59,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988873977] [2022-04-15 17:59:59,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:59:59,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:59:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:59,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:59:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:59,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {25294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {25288#true} is VALID [2022-04-15 17:59:59,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {25288#true} assume true; {25288#true} is VALID [2022-04-15 17:59:59,531 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25288#true} {25288#true} #268#return; {25288#true} is VALID [2022-04-15 17:59:59,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {25288#true} call ULTIMATE.init(); {25294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:59:59,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {25294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {25288#true} is VALID [2022-04-15 17:59:59,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {25288#true} assume true; {25288#true} is VALID [2022-04-15 17:59:59,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25288#true} {25288#true} #268#return; {25288#true} is VALID [2022-04-15 17:59:59,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {25288#true} call #t~ret19 := main(); {25288#true} is VALID [2022-04-15 17:59:59,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {25288#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {25288#true} is VALID [2022-04-15 17:59:59,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {25288#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {25288#true} is VALID [2022-04-15 17:59:59,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {25288#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {25288#true} is VALID [2022-04-15 17:59:59,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {25288#true} assume !(0 != ~p1~0); {25288#true} is VALID [2022-04-15 17:59:59,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {25288#true} assume !(0 != ~p2~0); {25288#true} is VALID [2022-04-15 17:59:59,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {25288#true} assume !(0 != ~p3~0); {25288#true} is VALID [2022-04-15 17:59:59,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {25288#true} assume !(0 != ~p4~0); {25288#true} is VALID [2022-04-15 17:59:59,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {25288#true} assume 0 != ~p5~0;~lk5~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 17:59:59,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 17:59:59,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 17:59:59,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 17:59:59,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 17:59:59,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {25293#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 17:59:59,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 17:59:59,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 17:59:59,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 17:59:59,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 17:59:59,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {25293#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 17:59:59,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {25293#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 17:59:59,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {25293#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 17:59:59,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {25293#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 17:59:59,538 INFO L290 TraceCheckUtils]: 26: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p5~0; {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 17:59:59,538 INFO L290 TraceCheckUtils]: 27: Hoare triple {25293#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {25289#false} is VALID [2022-04-15 17:59:59,538 INFO L290 TraceCheckUtils]: 28: Hoare triple {25289#false} assume !false; {25289#false} is VALID [2022-04-15 17:59:59,538 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:59,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:59:59,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988873977] [2022-04-15 17:59:59,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988873977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:59,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:59,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:59,539 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:59:59,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1672937576] [2022-04-15 17:59:59,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1672937576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:59,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:59,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:59,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187954305] [2022-04-15 17:59:59,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:59:59,540 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:59:59,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:59:59,540 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:59:59,559 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:59:59,559 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:59:59,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:59,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:59:59,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:59:59,560 INFO L87 Difference]: Start difference. First operand 697 states and 1207 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:59:59,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:59,935 INFO L93 Difference]: Finished difference Result 1293 states and 2273 transitions. [2022-04-15 17:59:59,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:59:59,935 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:59:59,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:59:59,935 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:59:59,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-15 17:59:59,937 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:59:59,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-15 17:59:59,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-15 18:00:00,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:00:00,136 INFO L225 Difference]: With dead ends: 1293 [2022-04-15 18:00:00,136 INFO L226 Difference]: Without dead ends: 1291 [2022-04-15 18:00:00,137 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:00:00,137 INFO L913 BasicCegarLoop]: 91 mSDtfsCounter, 208 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:00:00,138 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 98 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 18:00:00,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2022-04-15 18:00:00,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 969. [2022-04-15 18:00:00,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:00:00,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1291 states. Second operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 2 states have 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:00:00,220 INFO L74 IsIncluded]: Start isIncluded. First operand 1291 states. Second operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 2 states have 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:00:00,221 INFO L87 Difference]: Start difference. First operand 1291 states. Second operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 2 states have 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:00:00,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:00:00,279 INFO L93 Difference]: Finished difference Result 1291 states and 2256 transitions. [2022-04-15 18:00:00,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2256 transitions. [2022-04-15 18:00:00,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:00:00,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:00:00,283 INFO L74 IsIncluded]: Start isIncluded. First operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 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 1291 states. [2022-04-15 18:00:00,284 INFO L87 Difference]: Start difference. First operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 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 1291 states. [2022-04-15 18:00:00,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:00:00,349 INFO L93 Difference]: Finished difference Result 1291 states and 2256 transitions. [2022-04-15 18:00:00,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2256 transitions. [2022-04-15 18:00:00,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:00:00,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:00:00,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:00:00,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:00:00,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 2 states have 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:00:00,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1647 transitions. [2022-04-15 18:00:00,396 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1647 transitions. Word has length 29 [2022-04-15 18:00:00,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:00:00,397 INFO L478 AbstractCegarLoop]: Abstraction has 969 states and 1647 transitions. [2022-04-15 18:00:00,397 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:00:00,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 969 states and 1647 transitions. [2022-04-15 18:00:01,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1647 edges. 1647 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:00:01,921 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1647 transitions. [2022-04-15 18:00:01,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 18:00:01,924 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:00:01,924 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:00:01,924 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 18:00:01,924 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:00:01,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:00:01,924 INFO L85 PathProgramCache]: Analyzing trace with hash 276755589, now seen corresponding path program 1 times [2022-04-15 18:00:01,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:00:01,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1385775765] [2022-04-15 18:00:01,925 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:00:01,925 INFO L85 PathProgramCache]: Analyzing trace with hash 276755589, now seen corresponding path program 2 times [2022-04-15 18:00:01,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:00:01,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638041593] [2022-04-15 18:00:01,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:00:01,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:00:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:00:01,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:00:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:00:01,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {32412#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {32406#true} is VALID [2022-04-15 18:00:01,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {32406#true} assume true; {32406#true} is VALID [2022-04-15 18:00:01,982 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32406#true} {32406#true} #268#return; {32406#true} is VALID [2022-04-15 18:00:01,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {32406#true} call ULTIMATE.init(); {32412#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:00:01,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {32412#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {32406#true} is VALID [2022-04-15 18:00:01,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {32406#true} assume true; {32406#true} is VALID [2022-04-15 18:00:01,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32406#true} {32406#true} #268#return; {32406#true} is VALID [2022-04-15 18:00:01,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {32406#true} call #t~ret19 := main(); {32406#true} is VALID [2022-04-15 18:00:01,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {32406#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {32406#true} is VALID [2022-04-15 18:00:01,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {32406#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {32406#true} is VALID [2022-04-15 18:00:01,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {32406#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {32406#true} is VALID [2022-04-15 18:00:01,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {32406#true} assume !(0 != ~p1~0); {32406#true} is VALID [2022-04-15 18:00:01,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {32406#true} assume !(0 != ~p2~0); {32406#true} is VALID [2022-04-15 18:00:01,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {32406#true} assume !(0 != ~p3~0); {32406#true} is VALID [2022-04-15 18:00:01,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {32406#true} assume !(0 != ~p4~0); {32406#true} is VALID [2022-04-15 18:00:01,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {32406#true} assume !(0 != ~p5~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-15 18:00:01,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-15 18:00:01,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-15 18:00:01,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-15 18:00:01,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-15 18:00:01,997 INFO L290 TraceCheckUtils]: 17: Hoare triple {32411#(= main_~p5~0 0)} assume !(0 != ~p10~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-15 18:00:01,997 INFO L290 TraceCheckUtils]: 18: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-15 18:00:01,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-15 18:00:02,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-15 18:00:02,005 INFO L290 TraceCheckUtils]: 21: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-15 18:00:02,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {32411#(= main_~p5~0 0)} assume !(0 != ~p1~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-15 18:00:02,006 INFO L290 TraceCheckUtils]: 23: Hoare triple {32411#(= main_~p5~0 0)} assume !(0 != ~p2~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-15 18:00:02,007 INFO L290 TraceCheckUtils]: 24: Hoare triple {32411#(= main_~p5~0 0)} assume !(0 != ~p3~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-15 18:00:02,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {32411#(= main_~p5~0 0)} assume !(0 != ~p4~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-15 18:00:02,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p5~0; {32407#false} is VALID [2022-04-15 18:00:02,007 INFO L290 TraceCheckUtils]: 27: Hoare triple {32407#false} assume 1 != ~lk5~0; {32407#false} is VALID [2022-04-15 18:00:02,007 INFO L290 TraceCheckUtils]: 28: Hoare triple {32407#false} assume !false; {32407#false} is VALID [2022-04-15 18:00:02,008 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:00:02,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:00:02,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638041593] [2022-04-15 18:00:02,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638041593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:00:02,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:00:02,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:00:02,008 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:00:02,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1385775765] [2022-04-15 18:00:02,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1385775765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:00:02,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:00:02,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:00:02,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429035229] [2022-04-15 18:00:02,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:00:02,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 18:00:02,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:00:02,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:00:02,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:00:02,028 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:00:02,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:00:02,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:00:02,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:00:02,028 INFO L87 Difference]: Start difference. First operand 969 states and 1647 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:00:02,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:00:02,512 INFO L93 Difference]: Finished difference Result 2301 states and 3937 transitions. [2022-04-15 18:00:02,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:00:02,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 18:00:02,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:00:02,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:00:02,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 252 transitions. [2022-04-15 18:00:02,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:00:02,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 252 transitions. [2022-04-15 18:00:02,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 252 transitions. [2022-04-15 18:00:02,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:00:02,752 INFO L225 Difference]: With dead ends: 2301 [2022-04-15 18:00:02,752 INFO L226 Difference]: Without dead ends: 1355 [2022-04-15 18:00:02,754 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:00:02,754 INFO L913 BasicCegarLoop]: 128 mSDtfsCounter, 184 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:00:02,754 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 135 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:00:02,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-04-15 18:00:02,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1353. [2022-04-15 18:00:02,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:00:02,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have 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:00:02,883 INFO L74 IsIncluded]: Start isIncluded. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have 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:00:02,884 INFO L87 Difference]: Start difference. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have 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:00:02,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:00:02,954 INFO L93 Difference]: Finished difference Result 1355 states and 2296 transitions. [2022-04-15 18:00:02,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 2296 transitions. [2022-04-15 18:00:02,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:00:02,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:00:02,958 INFO L74 IsIncluded]: Start isIncluded. First operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 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 1355 states. [2022-04-15 18:00:02,959 INFO L87 Difference]: Start difference. First operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 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 1355 states. [2022-04-15 18:00:03,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:00:03,021 INFO L93 Difference]: Finished difference Result 1355 states and 2296 transitions. [2022-04-15 18:00:03,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 2296 transitions. [2022-04-15 18:00:03,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:00:03,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:00:03,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:00:03,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:00:03,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have 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:00:03,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 2295 transitions. [2022-04-15 18:00:03,148 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 2295 transitions. Word has length 29 [2022-04-15 18:00:03,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:00:03,148 INFO L478 AbstractCegarLoop]: Abstraction has 1353 states and 2295 transitions. [2022-04-15 18:00:03,149 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:00:03,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1353 states and 2295 transitions. [2022-04-15 18:00:05,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2295 edges. 2295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:00:05,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 2295 transitions. [2022-04-15 18:00:05,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 18:00:05,474 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:00:05,474 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:00:05,474 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 18:00:05,475 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:00:05,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:00:05,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1983846824, now seen corresponding path program 1 times [2022-04-15 18:00:05,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:00:05,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1477518896] [2022-04-15 18:00:05,475 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:00:05,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1983846824, now seen corresponding path program 2 times [2022-04-15 18:00:05,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:00:05,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334617108] [2022-04-15 18:00:05,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:00:05,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:00:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:00:05,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:00:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:00:05,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {42442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {42436#true} is VALID [2022-04-15 18:00:05,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {42436#true} assume true; {42436#true} is VALID [2022-04-15 18:00:05,522 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42436#true} {42436#true} #268#return; {42436#true} is VALID [2022-04-15 18:00:05,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {42436#true} call ULTIMATE.init(); {42442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:00:05,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {42442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {42436#true} is VALID [2022-04-15 18:00:05,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {42436#true} assume true; {42436#true} is VALID [2022-04-15 18:00:05,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42436#true} {42436#true} #268#return; {42436#true} is VALID [2022-04-15 18:00:05,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {42436#true} call #t~ret19 := main(); {42436#true} is VALID [2022-04-15 18:00:05,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {42436#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {42436#true} is VALID [2022-04-15 18:00:05,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {42436#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {42436#true} is VALID [2022-04-15 18:00:05,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {42436#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {42436#true} is VALID [2022-04-15 18:00:05,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {42436#true} assume !(0 != ~p1~0); {42436#true} is VALID [2022-04-15 18:00:05,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {42436#true} assume !(0 != ~p2~0); {42436#true} is VALID [2022-04-15 18:00:05,523 INFO L290 TraceCheckUtils]: 10: Hoare triple {42436#true} assume !(0 != ~p3~0); {42436#true} is VALID [2022-04-15 18:00:05,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {42436#true} assume !(0 != ~p4~0); {42436#true} is VALID [2022-04-15 18:00:05,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {42436#true} assume 0 != ~p5~0;~lk5~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:00:05,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:00:05,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:00:05,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:00:05,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:00:05,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {42441#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:00:05,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:00:05,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:00:05,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:00:05,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:00:05,526 INFO L290 TraceCheckUtils]: 22: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {42441#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:00:05,527 INFO L290 TraceCheckUtils]: 23: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {42441#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:00:05,527 INFO L290 TraceCheckUtils]: 24: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {42441#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:00:05,527 INFO L290 TraceCheckUtils]: 25: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {42441#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:00:05,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {42437#false} is VALID [2022-04-15 18:00:05,528 INFO L290 TraceCheckUtils]: 27: Hoare triple {42437#false} assume 0 != ~p6~0; {42437#false} is VALID [2022-04-15 18:00:05,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {42437#false} assume 1 != ~lk6~0; {42437#false} is VALID [2022-04-15 18:00:05,528 INFO L290 TraceCheckUtils]: 29: Hoare triple {42437#false} assume !false; {42437#false} is VALID [2022-04-15 18:00:05,528 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:00:05,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:00:05,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334617108] [2022-04-15 18:00:05,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334617108] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:00:05,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:00:05,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:00:05,529 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:00:05,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1477518896] [2022-04-15 18:00:05,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1477518896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:00:05,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:00:05,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:00:05,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759666374] [2022-04-15 18:00:05,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:00:05,530 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:00:05,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:00:05,530 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:00:05,549 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:00:05,549 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:00:05,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:00:05,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:00:05,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:00:05,550 INFO L87 Difference]: Start difference. First operand 1353 states and 2295 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:00:05,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:00:05,975 INFO L93 Difference]: Finished difference Result 2029 states and 3433 transitions. [2022-04-15 18:00:05,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:00:05,976 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:00:05,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:00:05,976 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:00:05,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 247 transitions. [2022-04-15 18:00:05,977 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:00:05,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 247 transitions. [2022-04-15 18:00:05,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 247 transitions. [2022-04-15 18:00:06,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:00:06,224 INFO L225 Difference]: With dead ends: 2029 [2022-04-15 18:00:06,224 INFO L226 Difference]: Without dead ends: 1371 [2022-04-15 18:00:06,226 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:00:06,226 INFO L913 BasicCegarLoop]: 134 mSDtfsCounter, 179 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:00:06,226 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 141 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:00:06,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2022-04-15 18:00:06,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1369. [2022-04-15 18:00:06,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:00:06,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1371 states. Second operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have 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:00:06,350 INFO L74 IsIncluded]: Start isIncluded. First operand 1371 states. Second operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have 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:00:06,352 INFO L87 Difference]: Start difference. First operand 1371 states. Second operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have 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:00:06,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:00:06,423 INFO L93 Difference]: Finished difference Result 1371 states and 2296 transitions. [2022-04-15 18:00:06,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 2296 transitions. [2022-04-15 18:00:06,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:00:06,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:00:06,428 INFO L74 IsIncluded]: Start isIncluded. First operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 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 1371 states. [2022-04-15 18:00:06,430 INFO L87 Difference]: Start difference. First operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 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 1371 states. [2022-04-15 18:00:06,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:00:06,502 INFO L93 Difference]: Finished difference Result 1371 states and 2296 transitions. [2022-04-15 18:00:06,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 2296 transitions. [2022-04-15 18:00:06,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:00:06,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:00:06,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:00:06,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:00:06,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have 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:00:06,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2295 transitions. [2022-04-15 18:00:06,620 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2295 transitions. Word has length 30 [2022-04-15 18:00:06,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:00:06,620 INFO L478 AbstractCegarLoop]: Abstraction has 1369 states and 2295 transitions. [2022-04-15 18:00:06,620 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:00:06,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1369 states and 2295 transitions. [2022-04-15 18:00:08,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2295 edges. 2295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:00:08,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2295 transitions. [2022-04-15 18:00:08,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 18:00:08,949 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:00:08,949 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:00:08,949 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 18:00:08,949 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:00:08,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:00:08,950 INFO L85 PathProgramCache]: Analyzing trace with hash -10297882, now seen corresponding path program 1 times [2022-04-15 18:00:08,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:00:08,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [849313961] [2022-04-15 18:00:08,950 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:00:08,951 INFO L85 PathProgramCache]: Analyzing trace with hash -10297882, now seen corresponding path program 2 times [2022-04-15 18:00:08,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:00:08,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351124765] [2022-04-15 18:00:08,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:00:08,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:00:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:00:08,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:00:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:00:09,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {51992#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {51986#true} is VALID [2022-04-15 18:00:09,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {51986#true} assume true; {51986#true} is VALID [2022-04-15 18:00:09,003 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51986#true} {51986#true} #268#return; {51986#true} is VALID [2022-04-15 18:00:09,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {51986#true} call ULTIMATE.init(); {51992#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:00:09,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {51992#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {51986#true} is VALID [2022-04-15 18:00:09,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {51986#true} assume true; {51986#true} is VALID [2022-04-15 18:00:09,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51986#true} {51986#true} #268#return; {51986#true} is VALID [2022-04-15 18:00:09,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {51986#true} call #t~ret19 := main(); {51986#true} is VALID [2022-04-15 18:00:09,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {51986#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {51986#true} is VALID [2022-04-15 18:00:09,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {51986#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {51986#true} is VALID [2022-04-15 18:00:09,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {51986#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {51986#true} is VALID [2022-04-15 18:00:09,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {51986#true} assume !(0 != ~p1~0); {51986#true} is VALID [2022-04-15 18:00:09,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {51986#true} assume !(0 != ~p2~0); {51986#true} is VALID [2022-04-15 18:00:09,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {51986#true} assume !(0 != ~p3~0); {51986#true} is VALID [2022-04-15 18:00:09,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {51986#true} assume !(0 != ~p4~0); {51986#true} is VALID [2022-04-15 18:00:09,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {51986#true} assume !(0 != ~p5~0); {51986#true} is VALID [2022-04-15 18:00:09,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {51986#true} assume 0 != ~p6~0;~lk6~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 18:00:09,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 18:00:09,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 18:00:09,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 18:00:09,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 18:00:09,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 18:00:09,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 18:00:09,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 18:00:09,008 INFO L290 TraceCheckUtils]: 21: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 18:00:09,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 18:00:09,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 18:00:09,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 18:00:09,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 18:00:09,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 18:00:09,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p6~0; {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 18:00:09,011 INFO L290 TraceCheckUtils]: 28: Hoare triple {51991#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {51987#false} is VALID [2022-04-15 18:00:09,011 INFO L290 TraceCheckUtils]: 29: Hoare triple {51987#false} assume !false; {51987#false} is VALID [2022-04-15 18:00:09,011 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:00:09,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:00:09,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351124765] [2022-04-15 18:00:09,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351124765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:00:09,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:00:09,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:00:09,012 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:00:09,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [849313961] [2022-04-15 18:00:09,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [849313961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:00:09,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:00:09,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:00:09,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889509677] [2022-04-15 18:00:09,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:00:09,013 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:00:09,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:00:09,013 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:00:09,034 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:00:09,034 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:00:09,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:00:09,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:00:09,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:00:09,035 INFO L87 Difference]: Start difference. First operand 1369 states and 2295 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:00:09,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:00:09,664 INFO L93 Difference]: Finished difference Result 2509 states and 4281 transitions. [2022-04-15 18:00:09,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:00:09,665 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:00:09,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:00:09,665 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:00:09,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-15 18:00:09,666 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:00:09,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-15 18:00:09,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-04-15 18:00:09,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:00:10,052 INFO L225 Difference]: With dead ends: 2509 [2022-04-15 18:00:10,052 INFO L226 Difference]: Without dead ends: 2507 [2022-04-15 18:00:10,053 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:00:10,053 INFO L913 BasicCegarLoop]: 90 mSDtfsCounter, 201 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:00:10,053 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 97 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 18:00:10,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-04-15 18:00:10,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 1929. [2022-04-15 18:00:10,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:00:10,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2507 states. Second operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 2 states have 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:00:10,246 INFO L74 IsIncluded]: Start isIncluded. First operand 2507 states. Second operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 2 states have 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:00:10,250 INFO L87 Difference]: Start difference. First operand 2507 states. Second operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 2 states have 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:00:10,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:00:10,481 INFO L93 Difference]: Finished difference Result 2507 states and 4248 transitions. [2022-04-15 18:00:10,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 4248 transitions. [2022-04-15 18:00:10,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:00:10,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:00:10,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 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 2507 states. [2022-04-15 18:00:10,492 INFO L87 Difference]: Start difference. First operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 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 2507 states. [2022-04-15 18:00:10,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:00:10,723 INFO L93 Difference]: Finished difference Result 2507 states and 4248 transitions. [2022-04-15 18:00:10,723 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 4248 transitions. [2022-04-15 18:00:10,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:00:10,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:00:10,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:00:10,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:00:10,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 2 states have 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:00:10,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 3159 transitions. [2022-04-15 18:00:10,985 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 3159 transitions. Word has length 30 [2022-04-15 18:00:10,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:00:10,985 INFO L478 AbstractCegarLoop]: Abstraction has 1929 states and 3159 transitions. [2022-04-15 18:00:10,985 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:00:10,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1929 states and 3159 transitions. [2022-04-15 18:00:14,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3159 edges. 3159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:00:14,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 3159 transitions. [2022-04-15 18:00:14,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 18:00:14,256 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:00:14,256 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:00:14,256 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 18:00:14,256 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:00:14,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:00:14,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1598645784, now seen corresponding path program 1 times [2022-04-15 18:00:14,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:00:14,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1362923171] [2022-04-15 18:00:14,257 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:00:14,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1598645784, now seen corresponding path program 2 times [2022-04-15 18:00:14,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:00:14,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971819125] [2022-04-15 18:00:14,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:00:14,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:00:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:00:14,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:00:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:00:14,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {65894#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {65888#true} is VALID [2022-04-15 18:00:14,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {65888#true} assume true; {65888#true} is VALID [2022-04-15 18:00:14,308 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65888#true} {65888#true} #268#return; {65888#true} is VALID [2022-04-15 18:00:14,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {65888#true} call ULTIMATE.init(); {65894#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:00:14,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {65894#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {65888#true} is VALID [2022-04-15 18:00:14,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {65888#true} assume true; {65888#true} is VALID [2022-04-15 18:00:14,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65888#true} {65888#true} #268#return; {65888#true} is VALID [2022-04-15 18:00:14,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {65888#true} call #t~ret19 := main(); {65888#true} is VALID [2022-04-15 18:00:14,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {65888#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {65888#true} is VALID [2022-04-15 18:00:14,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {65888#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {65888#true} is VALID [2022-04-15 18:00:14,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {65888#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {65888#true} is VALID [2022-04-15 18:00:14,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {65888#true} assume !(0 != ~p1~0); {65888#true} is VALID [2022-04-15 18:00:14,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {65888#true} assume !(0 != ~p2~0); {65888#true} is VALID [2022-04-15 18:00:14,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {65888#true} assume !(0 != ~p3~0); {65888#true} is VALID [2022-04-15 18:00:14,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {65888#true} assume !(0 != ~p4~0); {65888#true} is VALID [2022-04-15 18:00:14,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {65888#true} assume !(0 != ~p5~0); {65888#true} is VALID [2022-04-15 18:00:14,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {65888#true} assume !(0 != ~p6~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-15 18:00:14,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-15 18:00:14,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-15 18:00:14,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-15 18:00:14,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p10~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-15 18:00:14,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-15 18:00:14,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-15 18:00:14,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-15 18:00:14,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-15 18:00:14,312 INFO L290 TraceCheckUtils]: 22: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p1~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-15 18:00:14,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p2~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-15 18:00:14,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p3~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-15 18:00:14,313 INFO L290 TraceCheckUtils]: 25: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p4~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-15 18:00:14,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p5~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-15 18:00:14,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p6~0; {65889#false} is VALID [2022-04-15 18:00:14,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {65889#false} assume 1 != ~lk6~0; {65889#false} is VALID [2022-04-15 18:00:14,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {65889#false} assume !false; {65889#false} is VALID [2022-04-15 18:00:14,314 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:00:14,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:00:14,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971819125] [2022-04-15 18:00:14,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971819125] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:00:14,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:00:14,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:00:14,315 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:00:14,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1362923171] [2022-04-15 18:00:14,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1362923171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:00:14,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:00:14,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:00:14,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570091378] [2022-04-15 18:00:14,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:00:14,316 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:00:14,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:00:14,316 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:00:14,340 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:00:14,341 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:00:14,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:00:14,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:00:14,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:00:14,341 INFO L87 Difference]: Start difference. First operand 1929 states and 3159 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:00:15,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:00:15,608 INFO L93 Difference]: Finished difference Result 4557 states and 7513 transitions. [2022-04-15 18:00:15,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:00:15,609 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:00:15,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:00:15,609 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:00:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 249 transitions. [2022-04-15 18:00:15,610 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:00:15,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 249 transitions. [2022-04-15 18:00:15,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 249 transitions. [2022-04-15 18:00:15,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:00:16,076 INFO L225 Difference]: With dead ends: 4557 [2022-04-15 18:00:16,076 INFO L226 Difference]: Without dead ends: 2667 [2022-04-15 18:00:16,079 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:00:16,080 INFO L913 BasicCegarLoop]: 130 mSDtfsCounter, 178 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:00:16,080 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 137 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 18:00:16,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2022-04-15 18:00:16,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 2665. [2022-04-15 18:00:16,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:00:16,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2667 states. Second operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have 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:00:16,345 INFO L74 IsIncluded]: Start isIncluded. First operand 2667 states. Second operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have 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:00:16,349 INFO L87 Difference]: Start difference. First operand 2667 states. Second operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have 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:00:16,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:00:16,539 INFO L93 Difference]: Finished difference Result 2667 states and 4360 transitions. [2022-04-15 18:00:16,539 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 4360 transitions. [2022-04-15 18:00:16,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:00:16,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:00:16,546 INFO L74 IsIncluded]: Start isIncluded. First operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 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 2667 states. [2022-04-15 18:00:16,551 INFO L87 Difference]: Start difference. First operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 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 2667 states. [2022-04-15 18:00:16,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:00:16,757 INFO L93 Difference]: Finished difference Result 2667 states and 4360 transitions. [2022-04-15 18:00:16,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 4360 transitions. [2022-04-15 18:00:16,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:00:16,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:00:16,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:00:16,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:00:16,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have 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:00:17,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2665 states to 2665 states and 4359 transitions. [2022-04-15 18:00:17,084 INFO L78 Accepts]: Start accepts. Automaton has 2665 states and 4359 transitions. Word has length 30 [2022-04-15 18:00:17,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:00:17,084 INFO L478 AbstractCegarLoop]: Abstraction has 2665 states and 4359 transitions. [2022-04-15 18:00:17,084 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:00:17,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2665 states and 4359 transitions. [2022-04-15 18:00:21,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4359 edges. 4359 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:00:21,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2665 states and 4359 transitions. [2022-04-15 18:00:21,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 18:00:21,673 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:00:21,673 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:00:21,673 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 18:00:21,673 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:00:21,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:00:21,673 INFO L85 PathProgramCache]: Analyzing trace with hash -319020550, now seen corresponding path program 1 times [2022-04-15 18:00:21,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:00:21,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1473705738] [2022-04-15 18:00:21,674 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:00:21,674 INFO L85 PathProgramCache]: Analyzing trace with hash -319020550, now seen corresponding path program 2 times [2022-04-15 18:00:21,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:00:21,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006697294] [2022-04-15 18:00:21,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:00:21,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:00:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:00:21,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:00:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:00:21,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {85684#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {85678#true} is VALID [2022-04-15 18:00:21,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {85678#true} assume true; {85678#true} is VALID [2022-04-15 18:00:21,713 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {85678#true} {85678#true} #268#return; {85678#true} is VALID [2022-04-15 18:00:21,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {85678#true} call ULTIMATE.init(); {85684#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:00:21,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {85684#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {85678#true} is VALID [2022-04-15 18:00:21,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {85678#true} assume true; {85678#true} is VALID [2022-04-15 18:00:21,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85678#true} {85678#true} #268#return; {85678#true} is VALID [2022-04-15 18:00:21,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {85678#true} call #t~ret19 := main(); {85678#true} is VALID [2022-04-15 18:00:21,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {85678#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {85678#true} is VALID [2022-04-15 18:00:21,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {85678#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {85678#true} is VALID [2022-04-15 18:00:21,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {85678#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {85678#true} is VALID [2022-04-15 18:00:21,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {85678#true} assume !(0 != ~p1~0); {85678#true} is VALID [2022-04-15 18:00:21,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {85678#true} assume !(0 != ~p2~0); {85678#true} is VALID [2022-04-15 18:00:21,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {85678#true} assume !(0 != ~p3~0); {85678#true} is VALID [2022-04-15 18:00:21,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {85678#true} assume !(0 != ~p4~0); {85678#true} is VALID [2022-04-15 18:00:21,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {85678#true} assume !(0 != ~p5~0); {85678#true} is VALID [2022-04-15 18:00:21,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {85678#true} assume 0 != ~p6~0;~lk6~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-15 18:00:21,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-15 18:00:21,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-15 18:00:21,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-15 18:00:21,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-15 18:00:21,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-15 18:00:21,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-15 18:00:21,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-15 18:00:21,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-15 18:00:21,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-15 18:00:21,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-15 18:00:21,719 INFO L290 TraceCheckUtils]: 24: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-15 18:00:21,719 INFO L290 TraceCheckUtils]: 25: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-15 18:00:21,719 INFO L290 TraceCheckUtils]: 26: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-15 18:00:21,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {85679#false} is VALID [2022-04-15 18:00:21,720 INFO L290 TraceCheckUtils]: 28: Hoare triple {85679#false} assume 0 != ~p7~0; {85679#false} is VALID [2022-04-15 18:00:21,720 INFO L290 TraceCheckUtils]: 29: Hoare triple {85679#false} assume 1 != ~lk7~0; {85679#false} is VALID [2022-04-15 18:00:21,720 INFO L290 TraceCheckUtils]: 30: Hoare triple {85679#false} assume !false; {85679#false} is VALID [2022-04-15 18:00:21,720 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:00:21,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:00:21,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006697294] [2022-04-15 18:00:21,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006697294] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:00:21,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:00:21,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:00:21,721 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:00:21,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1473705738] [2022-04-15 18:00:21,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1473705738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:00:21,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:00:21,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:00:21,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874226887] [2022-04-15 18:00:21,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:00:21,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 18:00:21,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:00:21,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:00:21,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:00:21,745 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:00:21,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:00:21,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:00:21,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:00:21,745 INFO L87 Difference]: Start difference. First operand 2665 states and 4359 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:00:22,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:00:22,819 INFO L93 Difference]: Finished difference Result 3997 states and 6521 transitions. [2022-04-15 18:00:22,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:00:22,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 18:00:22,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:00:22,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:00:22,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2022-04-15 18:00:22,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:00:22,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2022-04-15 18:00:22,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 244 transitions. [2022-04-15 18:00:22,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:00:23,284 INFO L225 Difference]: With dead ends: 3997 [2022-04-15 18:00:23,284 INFO L226 Difference]: Without dead ends: 2699 [2022-04-15 18:00:23,287 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:00:23,288 INFO L913 BasicCegarLoop]: 131 mSDtfsCounter, 178 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:00:23,288 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 138 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:00:23,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2022-04-15 18:00:23,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2697. [2022-04-15 18:00:23,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:00:23,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2699 states. Second operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have 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:00:23,543 INFO L74 IsIncluded]: Start isIncluded. First operand 2699 states. Second operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have 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:00:23,545 INFO L87 Difference]: Start difference. First operand 2699 states. Second operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have 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:00:23,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:00:23,718 INFO L93 Difference]: Finished difference Result 2699 states and 4360 transitions. [2022-04-15 18:00:23,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4360 transitions. [2022-04-15 18:00:23,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:00:23,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:00:23,724 INFO L74 IsIncluded]: Start isIncluded. First operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2699 states. [2022-04-15 18:00:23,726 INFO L87 Difference]: Start difference. First operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2699 states. [2022-04-15 18:00:23,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:00:23,898 INFO L93 Difference]: Finished difference Result 2699 states and 4360 transitions. [2022-04-15 18:00:23,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4360 transitions. [2022-04-15 18:00:23,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:00:23,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:00:23,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:00:23,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:00:23,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have 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:00:24,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2697 states and 4359 transitions. [2022-04-15 18:00:24,238 INFO L78 Accepts]: Start accepts. Automaton has 2697 states and 4359 transitions. Word has length 31 [2022-04-15 18:00:24,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:00:24,238 INFO L478 AbstractCegarLoop]: Abstraction has 2697 states and 4359 transitions. [2022-04-15 18:00:24,238 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:00:24,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2697 states and 4359 transitions. [2022-04-15 18:00:28,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4359 edges. 4359 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:00:28,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 4359 transitions. [2022-04-15 18:00:28,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 18:00:28,830 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:00:28,830 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:00:28,831 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 18:00:28,831 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:00:28,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:00:28,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1981802040, now seen corresponding path program 1 times [2022-04-15 18:00:28,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:00:28,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1246401803] [2022-04-15 18:00:28,831 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:00:28,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1981802040, now seen corresponding path program 2 times [2022-04-15 18:00:28,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:00:28,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682464155] [2022-04-15 18:00:28,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:00:28,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:00:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:00:28,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:00:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:00:28,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {104482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {104476#true} is VALID [2022-04-15 18:00:28,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {104476#true} assume true; {104476#true} is VALID [2022-04-15 18:00:28,897 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {104476#true} {104476#true} #268#return; {104476#true} is VALID [2022-04-15 18:00:28,898 INFO L272 TraceCheckUtils]: 0: Hoare triple {104476#true} call ULTIMATE.init(); {104482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:00:28,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {104482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {104476#true} is VALID [2022-04-15 18:00:28,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {104476#true} assume true; {104476#true} is VALID [2022-04-15 18:00:28,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104476#true} {104476#true} #268#return; {104476#true} is VALID [2022-04-15 18:00:28,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {104476#true} call #t~ret19 := main(); {104476#true} is VALID [2022-04-15 18:00:28,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {104476#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {104476#true} is VALID [2022-04-15 18:00:28,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {104476#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {104476#true} is VALID [2022-04-15 18:00:28,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {104476#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {104476#true} is VALID [2022-04-15 18:00:28,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {104476#true} assume !(0 != ~p1~0); {104476#true} is VALID [2022-04-15 18:00:28,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {104476#true} assume !(0 != ~p2~0); {104476#true} is VALID [2022-04-15 18:00:28,899 INFO L290 TraceCheckUtils]: 10: Hoare triple {104476#true} assume !(0 != ~p3~0); {104476#true} is VALID [2022-04-15 18:00:28,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {104476#true} assume !(0 != ~p4~0); {104476#true} is VALID [2022-04-15 18:00:28,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {104476#true} assume !(0 != ~p5~0); {104476#true} is VALID [2022-04-15 18:00:28,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {104476#true} assume !(0 != ~p6~0); {104476#true} is VALID [2022-04-15 18:00:28,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {104476#true} assume 0 != ~p7~0;~lk7~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 18:00:28,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 18:00:28,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 18:00:28,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 18:00:28,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 18:00:28,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 18:00:28,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 18:00:28,902 INFO L290 TraceCheckUtils]: 21: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 18:00:28,902 INFO L290 TraceCheckUtils]: 22: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 18:00:28,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 18:00:28,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 18:00:28,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 18:00:28,903 INFO L290 TraceCheckUtils]: 26: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 18:00:28,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 18:00:28,904 INFO L290 TraceCheckUtils]: 28: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p7~0; {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 18:00:28,904 INFO L290 TraceCheckUtils]: 29: Hoare triple {104481#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {104477#false} is VALID [2022-04-15 18:00:28,904 INFO L290 TraceCheckUtils]: 30: Hoare triple {104477#false} assume !false; {104477#false} is VALID [2022-04-15 18:00:28,904 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:00:28,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:00:28,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682464155] [2022-04-15 18:00:28,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682464155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:00:28,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:00:28,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:00:28,905 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:00:28,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1246401803] [2022-04-15 18:00:28,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1246401803] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:00:28,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:00:28,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:00:28,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298495236] [2022-04-15 18:00:28,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:00:28,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 18:00:28,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:00:28,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:00:28,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:00:28,927 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:00:28,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:00:28,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:00:28,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:00:28,928 INFO L87 Difference]: Start difference. First operand 2697 states and 4359 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:00:30,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:00:30,423 INFO L93 Difference]: Finished difference Result 4877 states and 8041 transitions. [2022-04-15 18:00:30,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:00:30,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 18:00:30,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:00:30,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:00:30,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-04-15 18:00:30,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:00:30,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-04-15 18:00:30,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 155 transitions. [2022-04-15 18:00:30,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:00:31,478 INFO L225 Difference]: With dead ends: 4877 [2022-04-15 18:00:31,478 INFO L226 Difference]: Without dead ends: 4875 [2022-04-15 18:00:31,479 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:00:31,480 INFO L913 BasicCegarLoop]: 89 mSDtfsCounter, 194 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:00:31,480 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 96 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 18:00:31,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2022-04-15 18:00:31,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 3849. [2022-04-15 18:00:31,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:00:31,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4875 states. Second operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 2 states have 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:00:31,807 INFO L74 IsIncluded]: Start isIncluded. First operand 4875 states. Second operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 2 states have 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:00:31,810 INFO L87 Difference]: Start difference. First operand 4875 states. Second operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 2 states have 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:00:32,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:00:32,433 INFO L93 Difference]: Finished difference Result 4875 states and 7976 transitions. [2022-04-15 18:00:32,433 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 7976 transitions. [2022-04-15 18:00:32,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:00:32,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:00:32,443 INFO L74 IsIncluded]: Start isIncluded. First operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 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 4875 states. [2022-04-15 18:00:32,446 INFO L87 Difference]: Start difference. First operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 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 4875 states. [2022-04-15 18:00:33,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:00:33,050 INFO L93 Difference]: Finished difference Result 4875 states and 7976 transitions. [2022-04-15 18:00:33,050 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 7976 transitions. [2022-04-15 18:00:33,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:00:33,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:00:33,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:00:33,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:00:33,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 2 states have 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:00:33,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 6055 transitions. [2022-04-15 18:00:33,727 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 6055 transitions. Word has length 31 [2022-04-15 18:00:33,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:00:33,727 INFO L478 AbstractCegarLoop]: Abstraction has 3849 states and 6055 transitions. [2022-04-15 18:00:33,727 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:00:33,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3849 states and 6055 transitions. [2022-04-15 18:00:39,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6055 edges. 6055 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:00:39,989 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 6055 transitions. [2022-04-15 18:00:39,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 18:00:39,991 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:00:39,992 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:00:39,992 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 18:00:39,992 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:00:39,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:00:39,992 INFO L85 PathProgramCache]: Analyzing trace with hash 393454138, now seen corresponding path program 1 times [2022-04-15 18:00:39,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:00:39,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [484649080] [2022-04-15 18:00:39,992 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:00:39,992 INFO L85 PathProgramCache]: Analyzing trace with hash 393454138, now seen corresponding path program 2 times [2022-04-15 18:00:39,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:00:39,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652707082] [2022-04-15 18:00:39,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:00:39,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:00:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:00:40,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:00:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:00:40,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {131696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {131690#true} is VALID [2022-04-15 18:00:40,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {131690#true} assume true; {131690#true} is VALID [2022-04-15 18:00:40,052 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {131690#true} {131690#true} #268#return; {131690#true} is VALID [2022-04-15 18:00:40,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {131690#true} call ULTIMATE.init(); {131696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:00:40,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {131696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {131690#true} is VALID [2022-04-15 18:00:40,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {131690#true} assume true; {131690#true} is VALID [2022-04-15 18:00:40,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131690#true} {131690#true} #268#return; {131690#true} is VALID [2022-04-15 18:00:40,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {131690#true} call #t~ret19 := main(); {131690#true} is VALID [2022-04-15 18:00:40,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {131690#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {131690#true} is VALID [2022-04-15 18:00:40,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {131690#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {131690#true} is VALID [2022-04-15 18:00:40,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {131690#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {131690#true} is VALID [2022-04-15 18:00:40,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {131690#true} assume !(0 != ~p1~0); {131690#true} is VALID [2022-04-15 18:00:40,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {131690#true} assume !(0 != ~p2~0); {131690#true} is VALID [2022-04-15 18:00:40,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {131690#true} assume !(0 != ~p3~0); {131690#true} is VALID [2022-04-15 18:00:40,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {131690#true} assume !(0 != ~p4~0); {131690#true} is VALID [2022-04-15 18:00:40,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {131690#true} assume !(0 != ~p5~0); {131690#true} is VALID [2022-04-15 18:00:40,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {131690#true} assume !(0 != ~p6~0); {131690#true} is VALID [2022-04-15 18:00:40,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {131690#true} assume !(0 != ~p7~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-15 18:00:40,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-15 18:00:40,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-15 18:00:40,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p10~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-15 18:00:40,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-15 18:00:40,055 INFO L290 TraceCheckUtils]: 19: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-15 18:00:40,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-15 18:00:40,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-15 18:00:40,056 INFO L290 TraceCheckUtils]: 22: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p1~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-15 18:00:40,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p2~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-15 18:00:40,057 INFO L290 TraceCheckUtils]: 24: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p3~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-15 18:00:40,057 INFO L290 TraceCheckUtils]: 25: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p4~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-15 18:00:40,058 INFO L290 TraceCheckUtils]: 26: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p5~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-15 18:00:40,058 INFO L290 TraceCheckUtils]: 27: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p6~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-15 18:00:40,058 INFO L290 TraceCheckUtils]: 28: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p7~0; {131691#false} is VALID [2022-04-15 18:00:40,058 INFO L290 TraceCheckUtils]: 29: Hoare triple {131691#false} assume 1 != ~lk7~0; {131691#false} is VALID [2022-04-15 18:00:40,058 INFO L290 TraceCheckUtils]: 30: Hoare triple {131691#false} assume !false; {131691#false} is VALID [2022-04-15 18:00:40,059 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:00:40,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:00:40,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652707082] [2022-04-15 18:00:40,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652707082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:00:40,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:00:40,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:00:40,059 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:00:40,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [484649080] [2022-04-15 18:00:40,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [484649080] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:00:40,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:00:40,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:00:40,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408854230] [2022-04-15 18:00:40,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:00:40,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 18:00:40,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:00:40,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:00:40,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:00:40,080 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:00:40,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:00:40,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:00:40,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:00:40,081 INFO L87 Difference]: Start difference. First operand 3849 states and 6055 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:00:44,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:00:44,168 INFO L93 Difference]: Finished difference Result 9037 states and 14313 transitions. [2022-04-15 18:00:44,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:00:44,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 18:00:44,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:00:44,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:00:44,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2022-04-15 18:00:44,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:00:44,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2022-04-15 18:00:44,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 246 transitions. [2022-04-15 18:00:44,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:00:45,451 INFO L225 Difference]: With dead ends: 9037 [2022-04-15 18:00:45,451 INFO L226 Difference]: Without dead ends: 5259 [2022-04-15 18:00:45,456 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:00:45,457 INFO L913 BasicCegarLoop]: 132 mSDtfsCounter, 172 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:00:45,461 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 139 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 18:00:45,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2022-04-15 18:00:45,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 5257. [2022-04-15 18:00:45,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:00:45,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5259 states. Second operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have 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:00:45,916 INFO L74 IsIncluded]: Start isIncluded. First operand 5259 states. Second operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have 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:00:45,922 INFO L87 Difference]: Start difference. First operand 5259 states. Second operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have 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:00:46,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:00:46,611 INFO L93 Difference]: Finished difference Result 5259 states and 8264 transitions. [2022-04-15 18:00:46,611 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 8264 transitions. [2022-04-15 18:00:46,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:00:46,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:00:46,623 INFO L74 IsIncluded]: Start isIncluded. First operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5259 states. [2022-04-15 18:00:46,628 INFO L87 Difference]: Start difference. First operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5259 states. [2022-04-15 18:00:47,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:00:47,362 INFO L93 Difference]: Finished difference Result 5259 states and 8264 transitions. [2022-04-15 18:00:47,362 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 8264 transitions. [2022-04-15 18:00:47,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:00:47,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:00:47,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:00:47,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:00:47,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have 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:00:48,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5257 states to 5257 states and 8263 transitions. [2022-04-15 18:00:48,510 INFO L78 Accepts]: Start accepts. Automaton has 5257 states and 8263 transitions. Word has length 31 [2022-04-15 18:00:48,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:00:48,510 INFO L478 AbstractCegarLoop]: Abstraction has 5257 states and 8263 transitions. [2022-04-15 18:00:48,510 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:00:48,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5257 states and 8263 transitions. [2022-04-15 18:00:57,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8263 edges. 8263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:00:57,699 INFO L276 IsEmpty]: Start isEmpty. Operand 5257 states and 8263 transitions. [2022-04-15 18:00:57,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 18:00:57,703 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:00:57,704 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:00:57,704 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 18:00:57,704 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:00:57,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:00:57,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1306535229, now seen corresponding path program 1 times [2022-04-15 18:00:57,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:00:57,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1719193452] [2022-04-15 18:00:57,704 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:00:57,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1306535229, now seen corresponding path program 2 times [2022-04-15 18:00:57,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:00:57,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415400136] [2022-04-15 18:00:57,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:00:57,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:00:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:00:57,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:00:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:00:57,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {170814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {170808#true} is VALID [2022-04-15 18:00:57,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {170808#true} assume true; {170808#true} is VALID [2022-04-15 18:00:57,754 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {170808#true} {170808#true} #268#return; {170808#true} is VALID [2022-04-15 18:00:57,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {170808#true} call ULTIMATE.init(); {170814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:00:57,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {170814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {170808#true} is VALID [2022-04-15 18:00:57,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {170808#true} assume true; {170808#true} is VALID [2022-04-15 18:00:57,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {170808#true} {170808#true} #268#return; {170808#true} is VALID [2022-04-15 18:00:57,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {170808#true} call #t~ret19 := main(); {170808#true} is VALID [2022-04-15 18:00:57,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {170808#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {170808#true} is VALID [2022-04-15 18:00:57,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {170808#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {170808#true} is VALID [2022-04-15 18:00:57,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {170808#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {170808#true} is VALID [2022-04-15 18:00:57,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {170808#true} assume !(0 != ~p1~0); {170808#true} is VALID [2022-04-15 18:00:57,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {170808#true} assume !(0 != ~p2~0); {170808#true} is VALID [2022-04-15 18:00:57,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {170808#true} assume !(0 != ~p3~0); {170808#true} is VALID [2022-04-15 18:00:57,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {170808#true} assume !(0 != ~p4~0); {170808#true} is VALID [2022-04-15 18:00:57,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {170808#true} assume !(0 != ~p5~0); {170808#true} is VALID [2022-04-15 18:00:57,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {170808#true} assume !(0 != ~p6~0); {170808#true} is VALID [2022-04-15 18:00:57,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {170808#true} assume 0 != ~p7~0;~lk7~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-15 18:00:57,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-15 18:00:57,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-15 18:00:57,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-15 18:00:57,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-15 18:00:57,758 INFO L290 TraceCheckUtils]: 19: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-15 18:00:57,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-15 18:00:57,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-15 18:00:57,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-15 18:00:57,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-15 18:00:57,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-15 18:00:57,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-15 18:00:57,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-15 18:00:57,760 INFO L290 TraceCheckUtils]: 27: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-15 18:00:57,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {170809#false} is VALID [2022-04-15 18:00:57,761 INFO L290 TraceCheckUtils]: 29: Hoare triple {170809#false} assume 0 != ~p8~0; {170809#false} is VALID [2022-04-15 18:00:57,761 INFO L290 TraceCheckUtils]: 30: Hoare triple {170809#false} assume 1 != ~lk8~0; {170809#false} is VALID [2022-04-15 18:00:57,761 INFO L290 TraceCheckUtils]: 31: Hoare triple {170809#false} assume !false; {170809#false} is VALID [2022-04-15 18:00:57,761 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:00:57,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:00:57,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415400136] [2022-04-15 18:00:57,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415400136] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:00:57,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:00:57,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:00:57,762 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:00:57,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1719193452] [2022-04-15 18:00:57,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1719193452] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:00:57,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:00:57,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:00:57,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540536107] [2022-04-15 18:00:57,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:00:57,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 18:00:57,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:00:57,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:00:57,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:00:57,783 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:00:57,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:00:57,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:00:57,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:00:57,784 INFO L87 Difference]: Start difference. First operand 5257 states and 8263 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:01:00,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:01:00,887 INFO L93 Difference]: Finished difference Result 7885 states and 12361 transitions. [2022-04-15 18:01:00,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:01:00,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 18:01:00,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:01:00,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:01:00,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2022-04-15 18:01:00,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:01:00,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2022-04-15 18:01:00,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 241 transitions. [2022-04-15 18:01:01,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:01:02,162 INFO L225 Difference]: With dead ends: 7885 [2022-04-15 18:01:02,162 INFO L226 Difference]: Without dead ends: 5323 [2022-04-15 18:01:02,165 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:01:02,165 INFO L913 BasicCegarLoop]: 128 mSDtfsCounter, 177 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:01:02,165 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 135 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:01:02,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5323 states. [2022-04-15 18:01:02,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5323 to 5321. [2022-04-15 18:01:02,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:01:02,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5323 states. Second operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have 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:01:02,585 INFO L74 IsIncluded]: Start isIncluded. First operand 5323 states. Second operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have 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:01:02,591 INFO L87 Difference]: Start difference. First operand 5323 states. Second operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have 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:01:03,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:01:03,272 INFO L93 Difference]: Finished difference Result 5323 states and 8264 transitions. [2022-04-15 18:01:03,272 INFO L276 IsEmpty]: Start isEmpty. Operand 5323 states and 8264 transitions. [2022-04-15 18:01:03,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:01:03,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:01:03,281 INFO L74 IsIncluded]: Start isIncluded. First operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 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 5323 states. [2022-04-15 18:01:03,286 INFO L87 Difference]: Start difference. First operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 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 5323 states. [2022-04-15 18:01:04,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:01:04,003 INFO L93 Difference]: Finished difference Result 5323 states and 8264 transitions. [2022-04-15 18:01:04,003 INFO L276 IsEmpty]: Start isEmpty. Operand 5323 states and 8264 transitions. [2022-04-15 18:01:04,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:01:04,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:01:04,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:01:04,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:01:04,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have 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:01:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5321 states to 5321 states and 8263 transitions. [2022-04-15 18:01:05,216 INFO L78 Accepts]: Start accepts. Automaton has 5321 states and 8263 transitions. Word has length 32 [2022-04-15 18:01:05,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:01:05,216 INFO L478 AbstractCegarLoop]: Abstraction has 5321 states and 8263 transitions. [2022-04-15 18:01:05,216 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:01:05,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5321 states and 8263 transitions. [2022-04-15 18:01:14,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8263 edges. 8263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:01:14,293 INFO L276 IsEmpty]: Start isEmpty. Operand 5321 states and 8263 transitions. [2022-04-15 18:01:14,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 18:01:14,295 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:01:14,295 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:01:14,296 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 18:01:14,296 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:01:14,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:01:14,296 INFO L85 PathProgramCache]: Analyzing trace with hash -687609477, now seen corresponding path program 1 times [2022-04-15 18:01:14,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:01:14,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1620810279] [2022-04-15 18:01:14,296 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:01:14,296 INFO L85 PathProgramCache]: Analyzing trace with hash -687609477, now seen corresponding path program 2 times [2022-04-15 18:01:14,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:01:14,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477371158] [2022-04-15 18:01:14,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:01:14,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:01:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:01:14,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:01:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:01:14,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {207884#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {207878#true} is VALID [2022-04-15 18:01:14,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {207878#true} assume true; {207878#true} is VALID [2022-04-15 18:01:14,351 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {207878#true} {207878#true} #268#return; {207878#true} is VALID [2022-04-15 18:01:14,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {207878#true} call ULTIMATE.init(); {207884#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:01:14,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {207884#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {207878#true} is VALID [2022-04-15 18:01:14,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {207878#true} assume true; {207878#true} is VALID [2022-04-15 18:01:14,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {207878#true} {207878#true} #268#return; {207878#true} is VALID [2022-04-15 18:01:14,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {207878#true} call #t~ret19 := main(); {207878#true} is VALID [2022-04-15 18:01:14,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {207878#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {207878#true} is VALID [2022-04-15 18:01:14,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {207878#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {207878#true} is VALID [2022-04-15 18:01:14,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {207878#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {207878#true} is VALID [2022-04-15 18:01:14,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {207878#true} assume !(0 != ~p1~0); {207878#true} is VALID [2022-04-15 18:01:14,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {207878#true} assume !(0 != ~p2~0); {207878#true} is VALID [2022-04-15 18:01:14,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {207878#true} assume !(0 != ~p3~0); {207878#true} is VALID [2022-04-15 18:01:14,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {207878#true} assume !(0 != ~p4~0); {207878#true} is VALID [2022-04-15 18:01:14,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {207878#true} assume !(0 != ~p5~0); {207878#true} is VALID [2022-04-15 18:01:14,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {207878#true} assume !(0 != ~p6~0); {207878#true} is VALID [2022-04-15 18:01:14,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {207878#true} assume !(0 != ~p7~0); {207878#true} is VALID [2022-04-15 18:01:14,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {207878#true} assume 0 != ~p8~0;~lk8~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 18:01:14,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 18:01:14,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 18:01:14,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 18:01:14,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 18:01:14,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 18:01:14,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 18:01:14,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 18:01:14,356 INFO L290 TraceCheckUtils]: 23: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 18:01:14,356 INFO L290 TraceCheckUtils]: 24: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 18:01:14,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 18:01:14,357 INFO L290 TraceCheckUtils]: 26: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 18:01:14,357 INFO L290 TraceCheckUtils]: 27: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 18:01:14,357 INFO L290 TraceCheckUtils]: 28: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 18:01:14,358 INFO L290 TraceCheckUtils]: 29: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p8~0; {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 18:01:14,358 INFO L290 TraceCheckUtils]: 30: Hoare triple {207883#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {207879#false} is VALID [2022-04-15 18:01:14,358 INFO L290 TraceCheckUtils]: 31: Hoare triple {207879#false} assume !false; {207879#false} is VALID [2022-04-15 18:01:14,358 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:01:14,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:01:14,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477371158] [2022-04-15 18:01:14,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477371158] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:01:14,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:01:14,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:01:14,359 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:01:14,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1620810279] [2022-04-15 18:01:14,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1620810279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:01:14,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:01:14,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:01:14,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997985488] [2022-04-15 18:01:14,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:01:14,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 18:01:14,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:01:14,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:01:14,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:01:14,379 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:01:14,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:01:14,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:01:14,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:01:14,380 INFO L87 Difference]: Start difference. First operand 5321 states and 8263 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:01:18,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:01:18,958 INFO L93 Difference]: Finished difference Result 9485 states and 15049 transitions. [2022-04-15 18:01:18,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:01:18,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 18:01:18,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:01:18,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:01:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-15 18:01:18,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:01:18,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-15 18:01:18,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-15 18:01:19,063 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 18:01:22,935 INFO L225 Difference]: With dead ends: 9485 [2022-04-15 18:01:22,936 INFO L226 Difference]: Without dead ends: 9483 [2022-04-15 18:01:22,937 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:01:22,938 INFO L913 BasicCegarLoop]: 88 mSDtfsCounter, 187 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:01:22,938 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 95 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 18:01:22,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9483 states. [2022-04-15 18:01:23,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9483 to 7689. [2022-04-15 18:01:23,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:01:23,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9483 states. Second operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 2 states have 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:01:23,606 INFO L74 IsIncluded]: Start isIncluded. First operand 9483 states. Second operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 2 states have 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:01:23,617 INFO L87 Difference]: Start difference. First operand 9483 states. Second operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 2 states have 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:01:25,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:01:25,889 INFO L93 Difference]: Finished difference Result 9483 states and 14920 transitions. [2022-04-15 18:01:25,889 INFO L276 IsEmpty]: Start isEmpty. Operand 9483 states and 14920 transitions. [2022-04-15 18:01:25,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:01:25,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:01:25,949 INFO L74 IsIncluded]: Start isIncluded. First operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 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 9483 states. [2022-04-15 18:01:25,958 INFO L87 Difference]: Start difference. First operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 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 9483 states. [2022-04-15 18:01:28,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:01:28,259 INFO L93 Difference]: Finished difference Result 9483 states and 14920 transitions. [2022-04-15 18:01:28,259 INFO L276 IsEmpty]: Start isEmpty. Operand 9483 states and 14920 transitions. [2022-04-15 18:01:28,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:01:28,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:01:28,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:01:28,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:01:28,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 2 states have 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:01:30,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7689 states to 7689 states and 11591 transitions. [2022-04-15 18:01:30,823 INFO L78 Accepts]: Start accepts. Automaton has 7689 states and 11591 transitions. Word has length 32 [2022-04-15 18:01:30,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:01:30,824 INFO L478 AbstractCegarLoop]: Abstraction has 7689 states and 11591 transitions. [2022-04-15 18:01:30,824 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:01:30,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7689 states and 11591 transitions. [2022-04-15 18:01:43,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11591 edges. 11591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:01:43,614 INFO L276 IsEmpty]: Start isEmpty. Operand 7689 states and 11591 transitions. [2022-04-15 18:01:43,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 18:01:43,619 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:01:43,619 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:01:43,619 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 18:01:43,619 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:01:43,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:01:43,619 INFO L85 PathProgramCache]: Analyzing trace with hash 2019009917, now seen corresponding path program 1 times [2022-04-15 18:01:43,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:01:43,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [516835196] [2022-04-15 18:01:43,620 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:01:43,620 INFO L85 PathProgramCache]: Analyzing trace with hash 2019009917, now seen corresponding path program 2 times [2022-04-15 18:01:43,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:01:43,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391122170] [2022-04-15 18:01:43,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:01:43,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:01:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:01:43,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:01:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:01:43,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {261210#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {261204#true} is VALID [2022-04-15 18:01:43,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {261204#true} assume true; {261204#true} is VALID [2022-04-15 18:01:43,659 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {261204#true} {261204#true} #268#return; {261204#true} is VALID [2022-04-15 18:01:43,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {261204#true} call ULTIMATE.init(); {261210#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:01:43,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {261210#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {261204#true} is VALID [2022-04-15 18:01:43,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {261204#true} assume true; {261204#true} is VALID [2022-04-15 18:01:43,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {261204#true} {261204#true} #268#return; {261204#true} is VALID [2022-04-15 18:01:43,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {261204#true} call #t~ret19 := main(); {261204#true} is VALID [2022-04-15 18:01:43,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {261204#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {261204#true} is VALID [2022-04-15 18:01:43,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {261204#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {261204#true} is VALID [2022-04-15 18:01:43,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {261204#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {261204#true} is VALID [2022-04-15 18:01:43,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {261204#true} assume !(0 != ~p1~0); {261204#true} is VALID [2022-04-15 18:01:43,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {261204#true} assume !(0 != ~p2~0); {261204#true} is VALID [2022-04-15 18:01:43,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {261204#true} assume !(0 != ~p3~0); {261204#true} is VALID [2022-04-15 18:01:43,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {261204#true} assume !(0 != ~p4~0); {261204#true} is VALID [2022-04-15 18:01:43,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {261204#true} assume !(0 != ~p5~0); {261204#true} is VALID [2022-04-15 18:01:43,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {261204#true} assume !(0 != ~p6~0); {261204#true} is VALID [2022-04-15 18:01:43,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {261204#true} assume !(0 != ~p7~0); {261204#true} is VALID [2022-04-15 18:01:43,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {261204#true} assume !(0 != ~p8~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-15 18:01:43,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {261209#(= main_~p8~0 0)} is VALID [2022-04-15 18:01:43,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p10~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-15 18:01:43,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {261209#(= main_~p8~0 0)} is VALID [2022-04-15 18:01:43,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {261209#(= main_~p8~0 0)} is VALID [2022-04-15 18:01:43,662 INFO L290 TraceCheckUtils]: 20: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {261209#(= main_~p8~0 0)} is VALID [2022-04-15 18:01:43,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {261209#(= main_~p8~0 0)} is VALID [2022-04-15 18:01:43,663 INFO L290 TraceCheckUtils]: 22: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p1~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-15 18:01:43,663 INFO L290 TraceCheckUtils]: 23: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p2~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-15 18:01:43,664 INFO L290 TraceCheckUtils]: 24: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p3~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-15 18:01:43,664 INFO L290 TraceCheckUtils]: 25: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p4~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-15 18:01:43,664 INFO L290 TraceCheckUtils]: 26: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p5~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-15 18:01:43,664 INFO L290 TraceCheckUtils]: 27: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p6~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-15 18:01:43,665 INFO L290 TraceCheckUtils]: 28: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p7~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-15 18:01:43,665 INFO L290 TraceCheckUtils]: 29: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p8~0; {261205#false} is VALID [2022-04-15 18:01:43,665 INFO L290 TraceCheckUtils]: 30: Hoare triple {261205#false} assume 1 != ~lk8~0; {261205#false} is VALID [2022-04-15 18:01:43,665 INFO L290 TraceCheckUtils]: 31: Hoare triple {261205#false} assume !false; {261205#false} is VALID [2022-04-15 18:01:43,665 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:01:43,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:01:43,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391122170] [2022-04-15 18:01:43,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391122170] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:01:43,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:01:43,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:01:43,666 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:01:43,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [516835196] [2022-04-15 18:01:43,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [516835196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:01:43,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:01:43,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:01:43,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763043203] [2022-04-15 18:01:43,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:01:43,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 18:01:43,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:01:43,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:01:43,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:01:43,686 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:01:43,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:01:43,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:01:43,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:01:43,687 INFO L87 Difference]: Start difference. First operand 7689 states and 11591 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:01:58,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:01:58,598 INFO L93 Difference]: Finished difference Result 17933 states and 27209 transitions. [2022-04-15 18:01:58,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:01:58,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 18:01:58,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:01:58,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:01:58,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2022-04-15 18:01:58,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:01:58,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2022-04-15 18:01:58,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 243 transitions. [2022-04-15 18:01:58,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:03,150 INFO L225 Difference]: With dead ends: 17933 [2022-04-15 18:02:03,150 INFO L226 Difference]: Without dead ends: 10379 [2022-04-15 18:02:03,158 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:02:03,159 INFO L913 BasicCegarLoop]: 134 mSDtfsCounter, 166 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:02:03,159 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 141 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:02:03,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10379 states. [2022-04-15 18:02:04,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10379 to 10377. [2022-04-15 18:02:04,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:02:04,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10379 states. Second operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:04,053 INFO L74 IsIncluded]: Start isIncluded. First operand 10379 states. Second operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:04,070 INFO L87 Difference]: Start difference. First operand 10379 states. Second operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:06,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:06,728 INFO L93 Difference]: Finished difference Result 10379 states and 15624 transitions. [2022-04-15 18:02:06,728 INFO L276 IsEmpty]: Start isEmpty. Operand 10379 states and 15624 transitions. [2022-04-15 18:02:06,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:06,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:06,754 INFO L74 IsIncluded]: Start isIncluded. First operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 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 10379 states. [2022-04-15 18:02:06,769 INFO L87 Difference]: Start difference. First operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 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 10379 states. [2022-04-15 18:02:09,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:09,595 INFO L93 Difference]: Finished difference Result 10379 states and 15624 transitions. [2022-04-15 18:02:09,595 INFO L276 IsEmpty]: Start isEmpty. Operand 10379 states and 15624 transitions. [2022-04-15 18:02:09,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:09,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:09,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:02:09,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:02:09,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:13,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10377 states to 10377 states and 15623 transitions. [2022-04-15 18:02:13,971 INFO L78 Accepts]: Start accepts. Automaton has 10377 states and 15623 transitions. Word has length 32 [2022-04-15 18:02:13,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:02:13,972 INFO L478 AbstractCegarLoop]: Abstraction has 10377 states and 15623 transitions. [2022-04-15 18:02:13,972 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:13,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10377 states and 15623 transitions. [2022-04-15 18:02:32,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15623 edges. 15623 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:32,202 INFO L276 IsEmpty]: Start isEmpty. Operand 10377 states and 15623 transitions. [2022-04-15 18:02:32,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 18:02:32,207 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:02:32,207 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:02:32,207 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 18:02:32,207 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:02:32,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:02:32,207 INFO L85 PathProgramCache]: Analyzing trace with hash 159157167, now seen corresponding path program 1 times [2022-04-15 18:02:32,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:32,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1935651353] [2022-04-15 18:02:32,208 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:02:32,208 INFO L85 PathProgramCache]: Analyzing trace with hash 159157167, now seen corresponding path program 2 times [2022-04-15 18:02:32,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:02:32,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412768725] [2022-04-15 18:02:32,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:02:32,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:02:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:32,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:02:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:02:32,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {338600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {338594#true} is VALID [2022-04-15 18:02:32,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {338594#true} assume true; {338594#true} is VALID [2022-04-15 18:02:32,247 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {338594#true} {338594#true} #268#return; {338594#true} is VALID [2022-04-15 18:02:32,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {338594#true} call ULTIMATE.init(); {338600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:02:32,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {338600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {338594#true} is VALID [2022-04-15 18:02:32,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {338594#true} assume true; {338594#true} is VALID [2022-04-15 18:02:32,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {338594#true} {338594#true} #268#return; {338594#true} is VALID [2022-04-15 18:02:32,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {338594#true} call #t~ret19 := main(); {338594#true} is VALID [2022-04-15 18:02:32,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {338594#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {338594#true} is VALID [2022-04-15 18:02:32,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {338594#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {338594#true} is VALID [2022-04-15 18:02:32,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {338594#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {338594#true} is VALID [2022-04-15 18:02:32,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {338594#true} assume !(0 != ~p1~0); {338594#true} is VALID [2022-04-15 18:02:32,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {338594#true} assume !(0 != ~p2~0); {338594#true} is VALID [2022-04-15 18:02:32,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {338594#true} assume !(0 != ~p3~0); {338594#true} is VALID [2022-04-15 18:02:32,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {338594#true} assume !(0 != ~p4~0); {338594#true} is VALID [2022-04-15 18:02:32,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {338594#true} assume !(0 != ~p5~0); {338594#true} is VALID [2022-04-15 18:02:32,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {338594#true} assume !(0 != ~p6~0); {338594#true} is VALID [2022-04-15 18:02:32,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {338594#true} assume !(0 != ~p7~0); {338594#true} is VALID [2022-04-15 18:02:32,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {338594#true} assume 0 != ~p8~0;~lk8~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:02:32,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {338599#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:02:32,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:02:32,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {338599#(not (= main_~p8~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:02:32,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {338599#(not (= main_~p8~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:02:32,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {338599#(not (= main_~p8~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:02:32,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {338599#(not (= main_~p8~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:02:32,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:02:32,251 INFO L290 TraceCheckUtils]: 23: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:02:32,251 INFO L290 TraceCheckUtils]: 24: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:02:32,251 INFO L290 TraceCheckUtils]: 25: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:02:32,251 INFO L290 TraceCheckUtils]: 26: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:02:32,252 INFO L290 TraceCheckUtils]: 27: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:02:32,252 INFO L290 TraceCheckUtils]: 28: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:02:32,252 INFO L290 TraceCheckUtils]: 29: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {338595#false} is VALID [2022-04-15 18:02:32,252 INFO L290 TraceCheckUtils]: 30: Hoare triple {338595#false} assume 0 != ~p9~0; {338595#false} is VALID [2022-04-15 18:02:32,252 INFO L290 TraceCheckUtils]: 31: Hoare triple {338595#false} assume 1 != ~lk9~0; {338595#false} is VALID [2022-04-15 18:02:32,252 INFO L290 TraceCheckUtils]: 32: Hoare triple {338595#false} assume !false; {338595#false} is VALID [2022-04-15 18:02:32,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:02:32,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:02:32,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412768725] [2022-04-15 18:02:32,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412768725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:32,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:32,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:32,253 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:02:32,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1935651353] [2022-04-15 18:02:32,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1935651353] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:02:32,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:02:32,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:02:32,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631654569] [2022-04-15 18:02:32,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:02:32,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 18:02:32,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:02:32,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:32,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:32,274 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:02:32,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:02:32,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:02:32,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:02:32,275 INFO L87 Difference]: Start difference. First operand 10377 states and 15623 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:44,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:44,438 INFO L93 Difference]: Finished difference Result 15565 states and 23369 transitions. [2022-04-15 18:02:44,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:02:44,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 18:02:44,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:02:44,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:44,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 238 transitions. [2022-04-15 18:02:44,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:44,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 238 transitions. [2022-04-15 18:02:44,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 238 transitions. [2022-04-15 18:02:44,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 238 edges. 238 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:48,951 INFO L225 Difference]: With dead ends: 15565 [2022-04-15 18:02:48,951 INFO L226 Difference]: Without dead ends: 10507 [2022-04-15 18:02:48,958 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:02:48,958 INFO L913 BasicCegarLoop]: 125 mSDtfsCounter, 176 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:02:48,958 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 132 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:02:48,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10507 states. [2022-04-15 18:02:49,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10507 to 10505. [2022-04-15 18:02:49,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:02:49,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10507 states. Second operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:49,862 INFO L74 IsIncluded]: Start isIncluded. First operand 10507 states. Second operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:49,877 INFO L87 Difference]: Start difference. First operand 10507 states. Second operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:52,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:52,705 INFO L93 Difference]: Finished difference Result 10507 states and 15624 transitions. [2022-04-15 18:02:52,705 INFO L276 IsEmpty]: Start isEmpty. Operand 10507 states and 15624 transitions. [2022-04-15 18:02:52,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:52,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:52,728 INFO L74 IsIncluded]: Start isIncluded. First operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 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 10507 states. [2022-04-15 18:02:52,744 INFO L87 Difference]: Start difference. First operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 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 10507 states. [2022-04-15 18:02:55,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:55,572 INFO L93 Difference]: Finished difference Result 10507 states and 15624 transitions. [2022-04-15 18:02:55,572 INFO L276 IsEmpty]: Start isEmpty. Operand 10507 states and 15624 transitions. [2022-04-15 18:02:55,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:55,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:55,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:02:55,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:02:55,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:00,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10505 states to 10505 states and 15623 transitions. [2022-04-15 18:03:00,144 INFO L78 Accepts]: Start accepts. Automaton has 10505 states and 15623 transitions. Word has length 33 [2022-04-15 18:03:00,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:03:00,145 INFO L478 AbstractCegarLoop]: Abstraction has 10505 states and 15623 transitions. [2022-04-15 18:03:00,145 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:00,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10505 states and 15623 transitions. [2022-04-15 18:03:18,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15623 edges. 15623 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:18,217 INFO L276 IsEmpty]: Start isEmpty. Operand 10505 states and 15623 transitions. [2022-04-15 18:03:18,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 18:03:18,222 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:03:18,222 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:03:18,222 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 18:03:18,222 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:03:18,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:03:18,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1834987539, now seen corresponding path program 1 times [2022-04-15 18:03:18,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:18,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [664556734] [2022-04-15 18:03:18,223 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:03:18,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1834987539, now seen corresponding path program 2 times [2022-04-15 18:03:18,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:03:18,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89415202] [2022-04-15 18:03:18,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:03:18,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:03:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:18,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:03:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:18,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {411766#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {411760#true} is VALID [2022-04-15 18:03:18,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {411760#true} assume true; {411760#true} is VALID [2022-04-15 18:03:18,274 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {411760#true} {411760#true} #268#return; {411760#true} is VALID [2022-04-15 18:03:18,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {411760#true} call ULTIMATE.init(); {411766#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:03:18,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {411766#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {411760#true} is VALID [2022-04-15 18:03:18,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {411760#true} assume true; {411760#true} is VALID [2022-04-15 18:03:18,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {411760#true} {411760#true} #268#return; {411760#true} is VALID [2022-04-15 18:03:18,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {411760#true} call #t~ret19 := main(); {411760#true} is VALID [2022-04-15 18:03:18,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {411760#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {411760#true} is VALID [2022-04-15 18:03:18,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {411760#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {411760#true} is VALID [2022-04-15 18:03:18,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {411760#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {411760#true} is VALID [2022-04-15 18:03:18,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {411760#true} assume !(0 != ~p1~0); {411760#true} is VALID [2022-04-15 18:03:18,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {411760#true} assume !(0 != ~p2~0); {411760#true} is VALID [2022-04-15 18:03:18,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {411760#true} assume !(0 != ~p3~0); {411760#true} is VALID [2022-04-15 18:03:18,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {411760#true} assume !(0 != ~p4~0); {411760#true} is VALID [2022-04-15 18:03:18,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {411760#true} assume !(0 != ~p5~0); {411760#true} is VALID [2022-04-15 18:03:18,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {411760#true} assume !(0 != ~p6~0); {411760#true} is VALID [2022-04-15 18:03:18,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {411760#true} assume !(0 != ~p7~0); {411760#true} is VALID [2022-04-15 18:03:18,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {411760#true} assume !(0 != ~p8~0); {411760#true} is VALID [2022-04-15 18:03:18,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {411760#true} assume 0 != ~p9~0;~lk9~0 := 1; {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 18:03:18,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 18:03:18,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {411765#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 18:03:18,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {411765#(= main_~lk9~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 18:03:18,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {411765#(= main_~lk9~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 18:03:18,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {411765#(= main_~lk9~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 18:03:18,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 18:03:18,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 18:03:18,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 18:03:18,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 18:03:18,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 18:03:18,293 INFO L290 TraceCheckUtils]: 27: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 18:03:18,293 INFO L290 TraceCheckUtils]: 28: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 18:03:18,293 INFO L290 TraceCheckUtils]: 29: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 18:03:18,294 INFO L290 TraceCheckUtils]: 30: Hoare triple {411765#(= main_~lk9~0 1)} assume 0 != ~p9~0; {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 18:03:18,294 INFO L290 TraceCheckUtils]: 31: Hoare triple {411765#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {411761#false} is VALID [2022-04-15 18:03:18,294 INFO L290 TraceCheckUtils]: 32: Hoare triple {411761#false} assume !false; {411761#false} is VALID [2022-04-15 18:03:18,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:03:18,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:03:18,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89415202] [2022-04-15 18:03:18,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89415202] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:18,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:18,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:18,295 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:03:18,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [664556734] [2022-04-15 18:03:18,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [664556734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:18,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:18,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:18,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889042167] [2022-04-15 18:03:18,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:03:18,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 18:03:18,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:03:18,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:18,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:18,320 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:03:18,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:18,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:03:18,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:03:18,321 INFO L87 Difference]: Start difference. First operand 10505 states and 15623 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:34,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:34,896 INFO L93 Difference]: Finished difference Result 18445 states and 28041 transitions. [2022-04-15 18:03:34,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:03:34,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 18:03:34,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:03:34,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:34,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-15 18:03:34,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:34,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-15 18:03:34,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-15 18:03:34,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:48,962 INFO L225 Difference]: With dead ends: 18445 [2022-04-15 18:03:48,963 INFO L226 Difference]: Without dead ends: 18443 [2022-04-15 18:03:48,966 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:03:48,967 INFO L913 BasicCegarLoop]: 87 mSDtfsCounter, 180 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:03:48,967 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 94 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 18:03:48,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18443 states. [2022-04-15 18:03:50,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18443 to 15369. [2022-04-15 18:03:50,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:03:50,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18443 states. Second operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:50,333 INFO L74 IsIncluded]: Start isIncluded. First operand 18443 states. Second operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:50,354 INFO L87 Difference]: Start difference. First operand 18443 states. Second operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:58,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:58,749 INFO L93 Difference]: Finished difference Result 18443 states and 27784 transitions. [2022-04-15 18:03:58,749 INFO L276 IsEmpty]: Start isEmpty. Operand 18443 states and 27784 transitions. [2022-04-15 18:03:58,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:58,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:58,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 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 18443 states. [2022-04-15 18:03:58,805 INFO L87 Difference]: Start difference. First operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 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 18443 states. [2022-04-15 18:04:07,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:07,575 INFO L93 Difference]: Finished difference Result 18443 states and 27784 transitions. [2022-04-15 18:04:07,575 INFO L276 IsEmpty]: Start isEmpty. Operand 18443 states and 27784 transitions. [2022-04-15 18:04:07,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:07,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:07,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:04:07,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:04:07,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 2 states have 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:18,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15369 states to 15369 states and 22151 transitions. [2022-04-15 18:04:18,073 INFO L78 Accepts]: Start accepts. Automaton has 15369 states and 22151 transitions. Word has length 33 [2022-04-15 18:04:18,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:04:18,073 INFO L478 AbstractCegarLoop]: Abstraction has 15369 states and 22151 transitions. [2022-04-15 18:04:18,073 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:04:18,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15369 states and 22151 transitions. [2022-04-15 18:04:43,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22151 edges. 22151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:04:43,567 INFO L276 IsEmpty]: Start isEmpty. Operand 15369 states and 22151 transitions. [2022-04-15 18:04:43,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 18:04:43,576 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:04:43,577 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:04:43,577 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 18:04:43,577 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:04:43,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:04:43,577 INFO L85 PathProgramCache]: Analyzing trace with hash 871631855, now seen corresponding path program 1 times [2022-04-15 18:04:43,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:43,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [984458984] [2022-04-15 18:04:43,577 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:04:43,578 INFO L85 PathProgramCache]: Analyzing trace with hash 871631855, now seen corresponding path program 2 times [2022-04-15 18:04:43,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:04:43,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816417265] [2022-04-15 18:04:43,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:04:43,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:04:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:43,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:04:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:43,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {516292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {516286#true} is VALID [2022-04-15 18:04:43,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {516286#true} assume true; {516286#true} is VALID [2022-04-15 18:04:43,614 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {516286#true} {516286#true} #268#return; {516286#true} is VALID [2022-04-15 18:04:43,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {516286#true} call ULTIMATE.init(); {516292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:04:43,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {516292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {516286#true} is VALID [2022-04-15 18:04:43,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {516286#true} assume true; {516286#true} is VALID [2022-04-15 18:04:43,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {516286#true} {516286#true} #268#return; {516286#true} is VALID [2022-04-15 18:04:43,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {516286#true} call #t~ret19 := main(); {516286#true} is VALID [2022-04-15 18:04:43,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {516286#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {516286#true} is VALID [2022-04-15 18:04:43,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {516286#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {516286#true} is VALID [2022-04-15 18:04:43,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {516286#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {516286#true} is VALID [2022-04-15 18:04:43,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {516286#true} assume !(0 != ~p1~0); {516286#true} is VALID [2022-04-15 18:04:43,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {516286#true} assume !(0 != ~p2~0); {516286#true} is VALID [2022-04-15 18:04:43,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {516286#true} assume !(0 != ~p3~0); {516286#true} is VALID [2022-04-15 18:04:43,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {516286#true} assume !(0 != ~p4~0); {516286#true} is VALID [2022-04-15 18:04:43,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {516286#true} assume !(0 != ~p5~0); {516286#true} is VALID [2022-04-15 18:04:43,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {516286#true} assume !(0 != ~p6~0); {516286#true} is VALID [2022-04-15 18:04:43,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {516286#true} assume !(0 != ~p7~0); {516286#true} is VALID [2022-04-15 18:04:43,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {516286#true} assume !(0 != ~p8~0); {516286#true} is VALID [2022-04-15 18:04:43,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {516286#true} assume !(0 != ~p9~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-15 18:04:43,617 INFO L290 TraceCheckUtils]: 17: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p10~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-15 18:04:43,617 INFO L290 TraceCheckUtils]: 18: Hoare triple {516291#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {516291#(= main_~p9~0 0)} is VALID [2022-04-15 18:04:43,617 INFO L290 TraceCheckUtils]: 19: Hoare triple {516291#(= main_~p9~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {516291#(= main_~p9~0 0)} is VALID [2022-04-15 18:04:43,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {516291#(= main_~p9~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {516291#(= main_~p9~0 0)} is VALID [2022-04-15 18:04:43,618 INFO L290 TraceCheckUtils]: 21: Hoare triple {516291#(= main_~p9~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {516291#(= main_~p9~0 0)} is VALID [2022-04-15 18:04:43,618 INFO L290 TraceCheckUtils]: 22: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p1~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-15 18:04:43,619 INFO L290 TraceCheckUtils]: 23: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p2~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-15 18:04:43,619 INFO L290 TraceCheckUtils]: 24: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p3~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-15 18:04:43,619 INFO L290 TraceCheckUtils]: 25: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p4~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-15 18:04:43,619 INFO L290 TraceCheckUtils]: 26: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p5~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-15 18:04:43,620 INFO L290 TraceCheckUtils]: 27: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p6~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-15 18:04:43,620 INFO L290 TraceCheckUtils]: 28: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p7~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-15 18:04:43,620 INFO L290 TraceCheckUtils]: 29: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p8~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-15 18:04:43,621 INFO L290 TraceCheckUtils]: 30: Hoare triple {516291#(= main_~p9~0 0)} assume 0 != ~p9~0; {516287#false} is VALID [2022-04-15 18:04:43,621 INFO L290 TraceCheckUtils]: 31: Hoare triple {516287#false} assume 1 != ~lk9~0; {516287#false} is VALID [2022-04-15 18:04:43,621 INFO L290 TraceCheckUtils]: 32: Hoare triple {516287#false} assume !false; {516287#false} is VALID [2022-04-15 18:04:43,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:04:43,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:04:43,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816417265] [2022-04-15 18:04:43,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816417265] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:43,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:43,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:43,622 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:04:43,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [984458984] [2022-04-15 18:04:43,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [984458984] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:43,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:43,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:43,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608352200] [2022-04-15 18:04:43,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:04:43,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 18:04:43,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:04:43,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:04:43,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:04:43,644 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:04:43,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:43,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:04:43,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:04:43,645 INFO L87 Difference]: Start difference. First operand 15369 states and 22151 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:06:12,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:06:12,135 INFO L93 Difference]: Finished difference Result 35597 states and 51593 transitions. [2022-04-15 18:06:12,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:06:12,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 18:06:12,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:06:12,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:06:12,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2022-04-15 18:06:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:06:12,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2022-04-15 18:06:12,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 240 transitions. [2022-04-15 18:06:12,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:06:29,738 INFO L225 Difference]: With dead ends: 35597 [2022-04-15 18:06:29,738 INFO L226 Difference]: Without dead ends: 20491 [2022-04-15 18:06:29,755 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:06:29,755 INFO L913 BasicCegarLoop]: 136 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:06:29,756 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 143 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:06:29,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20491 states. [2022-04-15 18:06:31,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20491 to 20489. [2022-04-15 18:06:31,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:06:31,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20491 states. Second operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have 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:31,578 INFO L74 IsIncluded]: Start isIncluded. First operand 20491 states. Second operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have 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:31,603 INFO L87 Difference]: Start difference. First operand 20491 states. Second operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have 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:42,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:06:42,613 INFO L93 Difference]: Finished difference Result 20491 states and 29448 transitions. [2022-04-15 18:06:42,613 INFO L276 IsEmpty]: Start isEmpty. Operand 20491 states and 29448 transitions. [2022-04-15 18:06:42,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:06:42,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:06:42,653 INFO L74 IsIncluded]: Start isIncluded. First operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 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 20491 states. [2022-04-15 18:06:42,679 INFO L87 Difference]: Start difference. First operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 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 20491 states. [2022-04-15 18:06:54,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:06:54,814 INFO L93 Difference]: Finished difference Result 20491 states and 29448 transitions. [2022-04-15 18:06:54,814 INFO L276 IsEmpty]: Start isEmpty. Operand 20491 states and 29448 transitions. [2022-04-15 18:06:54,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:06:54,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:06:54,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:06:54,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:06:54,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:07:14,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20489 states to 20489 states and 29447 transitions. [2022-04-15 18:07:14,823 INFO L78 Accepts]: Start accepts. Automaton has 20489 states and 29447 transitions. Word has length 33 [2022-04-15 18:07:14,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:07:14,824 INFO L478 AbstractCegarLoop]: Abstraction has 20489 states and 29447 transitions. [2022-04-15 18:07:14,824 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:07:14,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20489 states and 29447 transitions. [2022-04-15 18:07:50,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29447 edges. 29447 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:07:50,205 INFO L276 IsEmpty]: Start isEmpty. Operand 20489 states and 29447 transitions. [2022-04-15 18:07:50,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 18:07:50,217 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:07:50,217 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:07:50,217 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 18:07:50,217 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:07:50,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:07:50,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1049824046, now seen corresponding path program 1 times [2022-04-15 18:07:50,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:07:50,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1814126449] [2022-04-15 18:07:50,218 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:07:50,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1049824046, now seen corresponding path program 2 times [2022-04-15 18:07:50,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:07:50,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004914274] [2022-04-15 18:07:50,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:07:50,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:07:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:07:50,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:07:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:07:50,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {669458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {669452#true} is VALID [2022-04-15 18:07:50,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {669452#true} assume true; {669452#true} is VALID [2022-04-15 18:07:50,255 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {669452#true} {669452#true} #268#return; {669452#true} is VALID [2022-04-15 18:07:50,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {669452#true} call ULTIMATE.init(); {669458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:07:50,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {669458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {669452#true} is VALID [2022-04-15 18:07:50,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {669452#true} assume true; {669452#true} is VALID [2022-04-15 18:07:50,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {669452#true} {669452#true} #268#return; {669452#true} is VALID [2022-04-15 18:07:50,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {669452#true} call #t~ret19 := main(); {669452#true} is VALID [2022-04-15 18:07:50,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {669452#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {669452#true} is VALID [2022-04-15 18:07:50,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {669452#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {669452#true} is VALID [2022-04-15 18:07:50,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {669452#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {669452#true} is VALID [2022-04-15 18:07:50,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {669452#true} assume !(0 != ~p1~0); {669452#true} is VALID [2022-04-15 18:07:50,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {669452#true} assume !(0 != ~p2~0); {669452#true} is VALID [2022-04-15 18:07:50,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {669452#true} assume !(0 != ~p3~0); {669452#true} is VALID [2022-04-15 18:07:50,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {669452#true} assume !(0 != ~p4~0); {669452#true} is VALID [2022-04-15 18:07:50,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {669452#true} assume !(0 != ~p5~0); {669452#true} is VALID [2022-04-15 18:07:50,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {669452#true} assume !(0 != ~p6~0); {669452#true} is VALID [2022-04-15 18:07:50,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {669452#true} assume !(0 != ~p7~0); {669452#true} is VALID [2022-04-15 18:07:50,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {669452#true} assume !(0 != ~p8~0); {669452#true} is VALID [2022-04-15 18:07:50,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {669452#true} assume 0 != ~p9~0;~lk9~0 := 1; {669457#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:07:50,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:07:50,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {669457#(not (= main_~p9~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {669457#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:07:50,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {669457#(not (= main_~p9~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {669457#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:07:50,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {669457#(not (= main_~p9~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {669457#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:07:50,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {669457#(not (= main_~p9~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {669457#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:07:50,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:07:50,259 INFO L290 TraceCheckUtils]: 23: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:07:50,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:07:50,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:07:50,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:07:50,261 INFO L290 TraceCheckUtils]: 27: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:07:50,261 INFO L290 TraceCheckUtils]: 28: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:07:50,261 INFO L290 TraceCheckUtils]: 29: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:07:50,262 INFO L290 TraceCheckUtils]: 30: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {669453#false} is VALID [2022-04-15 18:07:50,262 INFO L290 TraceCheckUtils]: 31: Hoare triple {669453#false} assume 0 != ~p10~0; {669453#false} is VALID [2022-04-15 18:07:50,262 INFO L290 TraceCheckUtils]: 32: Hoare triple {669453#false} assume 1 != ~lk10~0; {669453#false} is VALID [2022-04-15 18:07:50,262 INFO L290 TraceCheckUtils]: 33: Hoare triple {669453#false} assume !false; {669453#false} is VALID [2022-04-15 18:07:50,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:07:50,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:07:50,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004914274] [2022-04-15 18:07:50,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004914274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:07:50,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:07:50,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:07:50,263 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:07:50,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1814126449] [2022-04-15 18:07:50,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1814126449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:07:50,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:07:50,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:07:50,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293512523] [2022-04-15 18:07:50,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:07:50,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 18:07:50,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:07:50,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:07:50,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:07:50,286 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:07:50,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:07:50,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:07:50,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:07:50,287 INFO L87 Difference]: Start difference. First operand 20489 states and 29447 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:10:10,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:10:10,032 INFO L93 Difference]: Finished difference Result 30733 states and 44041 transitions. [2022-04-15 18:10:10,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:10:10,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 18:10:10,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:10:10,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:10:10,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 235 transitions. [2022-04-15 18:10:10,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:10:10,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 235 transitions. [2022-04-15 18:10:10,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 235 transitions. [2022-04-15 18:10:10,181 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 18:10:30,162 INFO L225 Difference]: With dead ends: 30733 [2022-04-15 18:10:30,163 INFO L226 Difference]: Without dead ends: 20747 [2022-04-15 18:10:30,177 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:10:30,177 INFO L913 BasicCegarLoop]: 122 mSDtfsCounter, 175 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:10:30,177 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 129 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 18:10:30,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20747 states. [2022-04-15 18:10:32,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20747 to 20745. [2022-04-15 18:10:32,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:10:32,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20747 states. Second operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:10:32,158 INFO L74 IsIncluded]: Start isIncluded. First operand 20747 states. Second operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:10:32,185 INFO L87 Difference]: Start difference. First operand 20747 states. Second operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:10:43,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:10:43,052 INFO L93 Difference]: Finished difference Result 20747 states and 29448 transitions. [2022-04-15 18:10:43,052 INFO L276 IsEmpty]: Start isEmpty. Operand 20747 states and 29448 transitions. [2022-04-15 18:10:43,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:10:43,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:10:43,094 INFO L74 IsIncluded]: Start isIncluded. First operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 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 20747 states. [2022-04-15 18:10:43,122 INFO L87 Difference]: Start difference. First operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 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 20747 states. [2022-04-15 18:10:54,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:10:54,255 INFO L93 Difference]: Finished difference Result 20747 states and 29448 transitions. [2022-04-15 18:10:54,255 INFO L276 IsEmpty]: Start isEmpty. Operand 20747 states and 29448 transitions. [2022-04-15 18:10:54,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:10:54,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:10:54,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:10:54,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:10:54,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:11:14,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20745 states to 20745 states and 29447 transitions. [2022-04-15 18:11:14,998 INFO L78 Accepts]: Start accepts. Automaton has 20745 states and 29447 transitions. Word has length 34 [2022-04-15 18:11:14,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:11:14,998 INFO L478 AbstractCegarLoop]: Abstraction has 20745 states and 29447 transitions. [2022-04-15 18:11:14,998 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:11:14,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20745 states and 29447 transitions. [2022-04-15 18:11:50,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29447 edges. 29447 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:11:50,737 INFO L276 IsEmpty]: Start isEmpty. Operand 20745 states and 29447 transitions. [2022-04-15 18:11:50,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 18:11:50,751 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:11:50,751 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:11:50,751 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 18:11:50,751 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:11:50,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:11:50,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1250998544, now seen corresponding path program 1 times [2022-04-15 18:11:50,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:11:50,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [909520405] [2022-04-15 18:11:50,752 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:11:50,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1250998544, now seen corresponding path program 2 times [2022-04-15 18:11:50,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:11:50,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435413316] [2022-04-15 18:11:50,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:11:50,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:11:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:11:50,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:11:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:11:50,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {813920#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {813914#true} is VALID [2022-04-15 18:11:50,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {813914#true} assume true; {813914#true} is VALID [2022-04-15 18:11:50,788 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {813914#true} {813914#true} #268#return; {813914#true} is VALID [2022-04-15 18:11:50,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {813914#true} call ULTIMATE.init(); {813920#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:11:50,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {813920#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {813914#true} is VALID [2022-04-15 18:11:50,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {813914#true} assume true; {813914#true} is VALID [2022-04-15 18:11:50,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {813914#true} {813914#true} #268#return; {813914#true} is VALID [2022-04-15 18:11:50,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {813914#true} call #t~ret19 := main(); {813914#true} is VALID [2022-04-15 18:11:50,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {813914#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {813914#true} is VALID [2022-04-15 18:11:50,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {813914#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {813914#true} is VALID [2022-04-15 18:11:50,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {813914#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {813914#true} is VALID [2022-04-15 18:11:50,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {813914#true} assume !(0 != ~p1~0); {813914#true} is VALID [2022-04-15 18:11:50,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {813914#true} assume !(0 != ~p2~0); {813914#true} is VALID [2022-04-15 18:11:50,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {813914#true} assume !(0 != ~p3~0); {813914#true} is VALID [2022-04-15 18:11:50,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {813914#true} assume !(0 != ~p4~0); {813914#true} is VALID [2022-04-15 18:11:50,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {813914#true} assume !(0 != ~p5~0); {813914#true} is VALID [2022-04-15 18:11:50,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {813914#true} assume !(0 != ~p6~0); {813914#true} is VALID [2022-04-15 18:11:50,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {813914#true} assume !(0 != ~p7~0); {813914#true} is VALID [2022-04-15 18:11:50,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {813914#true} assume !(0 != ~p8~0); {813914#true} is VALID [2022-04-15 18:11:50,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {813914#true} assume !(0 != ~p9~0); {813914#true} is VALID [2022-04-15 18:11:50,791 INFO L290 TraceCheckUtils]: 17: Hoare triple {813914#true} assume !(0 != ~p10~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-15 18:11:50,791 INFO L290 TraceCheckUtils]: 18: Hoare triple {813919#(= main_~p10~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {813919#(= main_~p10~0 0)} is VALID [2022-04-15 18:11:50,791 INFO L290 TraceCheckUtils]: 19: Hoare triple {813919#(= main_~p10~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {813919#(= main_~p10~0 0)} is VALID [2022-04-15 18:11:50,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {813919#(= main_~p10~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {813919#(= main_~p10~0 0)} is VALID [2022-04-15 18:11:50,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {813919#(= main_~p10~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {813919#(= main_~p10~0 0)} is VALID [2022-04-15 18:11:50,792 INFO L290 TraceCheckUtils]: 22: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p1~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-15 18:11:50,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p2~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-15 18:11:50,793 INFO L290 TraceCheckUtils]: 24: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p3~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-15 18:11:50,793 INFO L290 TraceCheckUtils]: 25: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p4~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-15 18:11:50,794 INFO L290 TraceCheckUtils]: 26: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p5~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-15 18:11:50,794 INFO L290 TraceCheckUtils]: 27: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p6~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-15 18:11:50,794 INFO L290 TraceCheckUtils]: 28: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p7~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-15 18:11:50,795 INFO L290 TraceCheckUtils]: 29: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p8~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-15 18:11:50,795 INFO L290 TraceCheckUtils]: 30: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p9~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-15 18:11:50,795 INFO L290 TraceCheckUtils]: 31: Hoare triple {813919#(= main_~p10~0 0)} assume 0 != ~p10~0; {813915#false} is VALID [2022-04-15 18:11:50,795 INFO L290 TraceCheckUtils]: 32: Hoare triple {813915#false} assume 1 != ~lk10~0; {813915#false} is VALID [2022-04-15 18:11:50,796 INFO L290 TraceCheckUtils]: 33: Hoare triple {813915#false} assume !false; {813915#false} is VALID [2022-04-15 18:11:50,796 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:11:50,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:11:50,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435413316] [2022-04-15 18:11:50,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435413316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:11:50,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:11:50,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:11:50,796 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:11:50,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [909520405] [2022-04-15 18:11:50,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [909520405] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:11:50,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:11:50,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:11:50,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779952538] [2022-04-15 18:11:50,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:11:50,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 18:11:50,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:11:50,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:11:50,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:11:50,817 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:11:50,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:11:50,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:11:50,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:11:50,818 INFO L87 Difference]: Start difference. First operand 20745 states and 29447 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)