/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_13.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 17:58:12,588 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 17:58:12,589 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 17:58:12,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 17:58:12,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 17:58:12,632 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 17:58:12,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 17:58:12,640 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 17:58:12,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 17:58:12,645 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 17:58:12,646 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 17:58:12,648 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 17:58:12,648 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 17:58:12,650 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 17:58:12,651 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 17:58:12,654 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 17:58:12,654 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 17:58:12,655 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 17:58:12,657 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 17:58:12,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 17:58:12,664 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 17:58:12,665 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 17:58:12,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 17:58:12,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 17:58:12,668 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 17:58:12,674 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 17:58:12,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 17:58:12,675 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 17:58:12,676 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 17:58:12,676 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 17:58:12,677 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 17:58:12,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 17:58:12,679 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 17:58:12,680 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 17:58:12,680 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 17:58:12,681 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 17:58:12,682 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 17:58:12,682 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 17:58:12,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 17:58:12,682 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 17:58:12,683 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 17:58:12,685 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 17:58:12,686 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:58:12,696 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 17:58:12,697 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 17:58:12,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 17:58:12,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 17:58:12,698 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 17:58:12,698 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 17:58:12,698 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 17:58:12,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 17:58:12,699 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 17:58:12,700 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 17:58:12,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 17:58:12,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 17:58:12,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 17:58:12,700 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 17:58:12,700 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 17:58:12,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 17:58:12,701 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 17:58:12,701 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 17:58:12,701 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 17:58:12,701 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 17:58:12,701 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 17:58:12,701 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 17:58:12,701 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:58:12,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 17:58:12,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 17:58:12,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 17:58:12,977 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 17:58:12,978 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 17:58:12,979 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_13.c [2022-04-15 17:58:13,038 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4b8451d3/928a01fbabeb4dd5acbb35b565f63d55/FLAGb672c2c2e [2022-04-15 17:58:13,489 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 17:58:13,490 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c [2022-04-15 17:58:13,502 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4b8451d3/928a01fbabeb4dd5acbb35b565f63d55/FLAGb672c2c2e [2022-04-15 17:58:13,913 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4b8451d3/928a01fbabeb4dd5acbb35b565f63d55 [2022-04-15 17:58:13,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 17:58:13,917 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 17:58:13,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 17:58:13,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 17:58:13,939 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 17:58:13,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:58:13" (1/1) ... [2022-04-15 17:58:13,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cefeca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:58:13, skipping insertion in model container [2022-04-15 17:58:13,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:58:13" (1/1) ... [2022-04-15 17:58:13,954 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 17:58:14,011 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 17:58:14,249 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_13.c[4936,4949] [2022-04-15 17:58:14,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 17:58:14,274 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 17:58:14,313 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_13.c[4936,4949] [2022-04-15 17:58:14,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 17:58:14,328 INFO L208 MainTranslator]: Completed translation [2022-04-15 17:58:14,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:58:14 WrapperNode [2022-04-15 17:58:14,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 17:58:14,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 17:58:14,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 17:58:14,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 17:58:14,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:58:14" (1/1) ... [2022-04-15 17:58:14,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:58:14" (1/1) ... [2022-04-15 17:58:14,355 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:58:14" (1/1) ... [2022-04-15 17:58:14,355 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:58:14" (1/1) ... [2022-04-15 17:58:14,369 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:58:14" (1/1) ... [2022-04-15 17:58:14,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:58:14" (1/1) ... [2022-04-15 17:58:14,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:58:14" (1/1) ... [2022-04-15 17:58:14,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 17:58:14,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 17:58:14,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 17:58:14,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 17:58:14,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:58:14" (1/1) ... [2022-04-15 17:58:14,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 17:58:14,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:58:14,416 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:58:14,443 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:58:14,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 17:58:14,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 17:58:14,465 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 17:58:14,465 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 17:58:14,465 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 17:58:14,465 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 17:58:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 17:58:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 17:58:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 17:58:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 17:58:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 17:58:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 17:58:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 17:58:14,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 17:58:14,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 17:58:14,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 17:58:14,548 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 17:58:14,550 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 17:58:14,777 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 17:58:14,799 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 17:58:14,800 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 17:58:14,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:58:14 BoogieIcfgContainer [2022-04-15 17:58:14,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 17:58:14,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 17:58:14,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 17:58:14,806 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 17:58:14,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:58:13" (1/3) ... [2022-04-15 17:58:14,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@732c97a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:58:14, skipping insertion in model container [2022-04-15 17:58:14,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:58:14" (2/3) ... [2022-04-15 17:58:14,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@732c97a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:58:14, skipping insertion in model container [2022-04-15 17:58:14,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:58:14" (3/3) ... [2022-04-15 17:58:14,808 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2022-04-15 17:58:14,812 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 17:58:14,813 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 17:58:14,857 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 17:58:14,862 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:58:14,862 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 17:58:14,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 49 states have internal predecessors, (91), 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:58:14,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 17:58:14,889 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:58:14,890 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:58:14,890 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:58:14,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:58:14,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1751582771, now seen corresponding path program 1 times [2022-04-15 17:58:14,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:14,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1693441616] [2022-04-15 17:58:14,912 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:58:14,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1751582771, now seen corresponding path program 2 times [2022-04-15 17:58:14,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:58:14,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204021777] [2022-04-15 17:58:14,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:58:14,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:58:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:15,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:58:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:15,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {63#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {57#true} is VALID [2022-04-15 17:58:15,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {57#true} assume true; {57#true} is VALID [2022-04-15 17:58:15,265 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57#true} {57#true} #251#return; {57#true} is VALID [2022-04-15 17:58:15,268 INFO L272 TraceCheckUtils]: 0: Hoare triple {57#true} call ULTIMATE.init(); {63#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:58:15,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {57#true} is VALID [2022-04-15 17:58:15,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {57#true} assume true; {57#true} is VALID [2022-04-15 17:58:15,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57#true} {57#true} #251#return; {57#true} is VALID [2022-04-15 17:58:15,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {57#true} call #t~ret18 := main(); {57#true} is VALID [2022-04-15 17:58:15,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {57#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;havoc ~cond~0; {57#true} is VALID [2022-04-15 17:58:15,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {57#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {57#true} is VALID [2022-04-15 17:58:15,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {57#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; {57#true} is VALID [2022-04-15 17:58:15,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {57#true} assume 0 != ~p1~0;~lk1~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-15 17:58:15,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {62#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {62#(= main_~lk1~0 1)} is VALID [2022-04-15 17:58:15,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-15 17:58:15,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-15 17:58:15,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-15 17:58:15,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-15 17:58:15,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-15 17:58:15,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-15 17:58:15,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-15 17:58:15,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {62#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {62#(= main_~lk1~0 1)} is VALID [2022-04-15 17:58:15,280 INFO L290 TraceCheckUtils]: 18: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-15 17:58:15,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-15 17:58:15,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-15 17:58:15,283 INFO L290 TraceCheckUtils]: 21: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p1~0; {62#(= main_~lk1~0 1)} is VALID [2022-04-15 17:58:15,283 INFO L290 TraceCheckUtils]: 22: Hoare triple {62#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {58#false} is VALID [2022-04-15 17:58:15,284 INFO L290 TraceCheckUtils]: 23: Hoare triple {58#false} assume !false; {58#false} is VALID [2022-04-15 17:58:15,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:58:15,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:58:15,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204021777] [2022-04-15 17:58:15,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204021777] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:15,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:15,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:15,290 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:58:15,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1693441616] [2022-04-15 17:58:15,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1693441616] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:15,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:15,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:15,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23430985] [2022-04-15 17:58:15,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:58:15,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 17:58:15,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:58:15,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:15,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:15,342 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:58:15,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:15,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:58:15,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:58:15,369 INFO L87 Difference]: Start difference. First operand has 54 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 49 states have internal predecessors, (91), 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.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:15,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:15,816 INFO L93 Difference]: Finished difference Result 106 states and 187 transitions. [2022-04-15 17:58:15,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:58:15,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 17:58:15,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:58:15,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:15,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-15 17:58:15,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:15,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-15 17:58:15,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 187 transitions. [2022-04-15 17:58:16,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:16,047 INFO L225 Difference]: With dead ends: 106 [2022-04-15 17:58:16,047 INFO L226 Difference]: Without dead ends: 91 [2022-04-15 17:58:16,050 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:58:16,052 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 225 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:58:16,056 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 107 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:58:16,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-15 17:58:16,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 63. [2022-04-15 17:58:16,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:58:16,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:16,093 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:16,093 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:16,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:16,101 INFO L93 Difference]: Finished difference Result 91 states and 165 transitions. [2022-04-15 17:58:16,102 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 165 transitions. [2022-04-15 17:58:16,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:16,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:16,103 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 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 91 states. [2022-04-15 17:58:16,104 INFO L87 Difference]: Start difference. First operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 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 91 states. [2022-04-15 17:58:16,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:16,111 INFO L93 Difference]: Finished difference Result 91 states and 165 transitions. [2022-04-15 17:58:16,111 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 165 transitions. [2022-04-15 17:58:16,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:16,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:16,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:58:16,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:58:16,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:16,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 114 transitions. [2022-04-15 17:58:16,118 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 114 transitions. Word has length 24 [2022-04-15 17:58:16,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:58:16,119 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 114 transitions. [2022-04-15 17:58:16,119 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:16,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 114 transitions. [2022-04-15 17:58:16,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:16,227 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 114 transitions. [2022-04-15 17:58:16,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 17:58:16,227 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:58:16,228 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:58:16,228 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 17:58:16,228 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:58:16,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:58:16,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1522316171, now seen corresponding path program 1 times [2022-04-15 17:58:16,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:16,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2032174482] [2022-04-15 17:58:16,230 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:58:16,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1522316171, now seen corresponding path program 2 times [2022-04-15 17:58:16,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:58:16,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764678426] [2022-04-15 17:58:16,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:58:16,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:58:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:16,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:58:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:16,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {595#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {589#true} is VALID [2022-04-15 17:58:16,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {589#true} assume true; {589#true} is VALID [2022-04-15 17:58:16,324 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {589#true} {589#true} #251#return; {589#true} is VALID [2022-04-15 17:58:16,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {589#true} call ULTIMATE.init(); {595#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:58:16,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {595#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {589#true} is VALID [2022-04-15 17:58:16,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {589#true} assume true; {589#true} is VALID [2022-04-15 17:58:16,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {589#true} {589#true} #251#return; {589#true} is VALID [2022-04-15 17:58:16,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {589#true} call #t~ret18 := main(); {589#true} is VALID [2022-04-15 17:58:16,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {589#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;havoc ~cond~0; {589#true} is VALID [2022-04-15 17:58:16,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {589#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {589#true} is VALID [2022-04-15 17:58:16,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {589#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; {589#true} is VALID [2022-04-15 17:58:16,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {589#true} assume !(0 != ~p1~0); {594#(= main_~p1~0 0)} is VALID [2022-04-15 17:58:16,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {594#(= main_~p1~0 0)} assume !(0 != ~p2~0); {594#(= main_~p1~0 0)} is VALID [2022-04-15 17:58:16,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-15 17:58:16,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-15 17:58:16,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-15 17:58:16,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-15 17:58:16,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-15 17:58:16,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-15 17:58:16,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-15 17:58:16,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {594#(= main_~p1~0 0)} assume !(0 != ~p10~0); {594#(= main_~p1~0 0)} is VALID [2022-04-15 17:58:16,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-15 17:58:16,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-15 17:58:16,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-15 17:58:16,338 INFO L290 TraceCheckUtils]: 21: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p1~0; {590#false} is VALID [2022-04-15 17:58:16,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {590#false} assume 1 != ~lk1~0; {590#false} is VALID [2022-04-15 17:58:16,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {590#false} assume !false; {590#false} is VALID [2022-04-15 17:58:16,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:58:16,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:58:16,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764678426] [2022-04-15 17:58:16,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764678426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:16,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:16,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:16,344 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:58:16,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2032174482] [2022-04-15 17:58:16,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2032174482] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:16,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:16,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:16,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603170017] [2022-04-15 17:58:16,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:58:16,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 17:58:16,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:58:16,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:16,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:16,371 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:58:16,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:16,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:58:16,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:58:16,372 INFO L87 Difference]: Start difference. First operand 63 states and 114 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:16,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:16,628 INFO L93 Difference]: Finished difference Result 148 states and 273 transitions. [2022-04-15 17:58:16,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:58:16,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 17:58:16,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:58:16,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:16,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2022-04-15 17:58:16,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:16,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2022-04-15 17:58:16,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 246 transitions. [2022-04-15 17:58:16,871 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 17:58:16,873 INFO L225 Difference]: With dead ends: 148 [2022-04-15 17:58:16,874 INFO L226 Difference]: Without dead ends: 91 [2022-04-15 17:58:16,874 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 17:58:16,875 INFO L913 BasicCegarLoop]: 112 mSDtfsCounter, 193 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 119 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 17:58:16,876 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 119 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:58:16,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-15 17:58:16,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2022-04-15 17:58:16,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:58:16,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:16,892 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:16,892 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:16,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:16,896 INFO L93 Difference]: Finished difference Result 91 states and 163 transitions. [2022-04-15 17:58:16,896 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2022-04-15 17:58:16,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:16,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:16,898 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 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 91 states. [2022-04-15 17:58:16,898 INFO L87 Difference]: Start difference. First operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 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 91 states. [2022-04-15 17:58:16,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:16,902 INFO L93 Difference]: Finished difference Result 91 states and 163 transitions. [2022-04-15 17:58:16,902 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2022-04-15 17:58:16,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:16,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:16,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:58:16,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:58:16,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:16,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 162 transitions. [2022-04-15 17:58:16,908 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 162 transitions. Word has length 24 [2022-04-15 17:58:16,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:58:16,908 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 162 transitions. [2022-04-15 17:58:16,908 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:16,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 162 transitions. [2022-04-15 17:58:17,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:17,058 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 162 transitions. [2022-04-15 17:58:17,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 17:58:17,059 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:58:17,059 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:58:17,059 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 17:58:17,059 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:58:17,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:58:17,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1535721358, now seen corresponding path program 1 times [2022-04-15 17:58:17,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:17,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1114766177] [2022-04-15 17:58:17,061 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:58:17,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1535721358, now seen corresponding path program 2 times [2022-04-15 17:58:17,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:58:17,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418485692] [2022-04-15 17:58:17,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:58:17,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:58:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:17,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:58:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:17,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {1263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1257#true} is VALID [2022-04-15 17:58:17,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {1257#true} assume true; {1257#true} is VALID [2022-04-15 17:58:17,118 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1257#true} {1257#true} #251#return; {1257#true} is VALID [2022-04-15 17:58:17,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {1257#true} call ULTIMATE.init(); {1263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:58:17,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {1263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1257#true} is VALID [2022-04-15 17:58:17,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {1257#true} assume true; {1257#true} is VALID [2022-04-15 17:58:17,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1257#true} {1257#true} #251#return; {1257#true} is VALID [2022-04-15 17:58:17,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {1257#true} call #t~ret18 := main(); {1257#true} is VALID [2022-04-15 17:58:17,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {1257#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;havoc ~cond~0; {1257#true} is VALID [2022-04-15 17:58:17,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {1257#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {1257#true} is VALID [2022-04-15 17:58:17,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {1257#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; {1257#true} is VALID [2022-04-15 17:58:17,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {1257#true} assume 0 != ~p1~0;~lk1~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:58:17,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {1262#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {1262#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:58:17,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:58:17,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:58:17,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:58:17,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:58:17,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:58:17,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:58:17,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:58:17,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {1262#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {1262#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:58:17,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:58:17,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:58:17,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:58:17,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {1262#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1258#false} is VALID [2022-04-15 17:58:17,125 INFO L290 TraceCheckUtils]: 22: Hoare triple {1258#false} assume 0 != ~p2~0; {1258#false} is VALID [2022-04-15 17:58:17,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {1258#false} assume 1 != ~lk2~0; {1258#false} is VALID [2022-04-15 17:58:17,126 INFO L290 TraceCheckUtils]: 24: Hoare triple {1258#false} assume !false; {1258#false} is VALID [2022-04-15 17:58:17,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:58:17,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:58:17,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418485692] [2022-04-15 17:58:17,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418485692] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:17,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:17,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:17,127 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:58:17,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1114766177] [2022-04-15 17:58:17,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1114766177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:17,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:17,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:17,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982193892] [2022-04-15 17:58:17,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:58:17,128 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:58:17,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:58:17,129 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:58:17,146 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:58:17,146 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:58:17,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:17,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:58:17,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:58:17,147 INFO L87 Difference]: Start difference. First operand 89 states and 162 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:58:17,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:17,407 INFO L93 Difference]: Finished difference Result 136 states and 244 transitions. [2022-04-15 17:58:17,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:58:17,407 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:58:17,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:58:17,408 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:58:17,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2022-04-15 17:58:17,411 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:58:17,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2022-04-15 17:58:17,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 241 transitions. [2022-04-15 17:58:17,636 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 17:58:17,639 INFO L225 Difference]: With dead ends: 136 [2022-04-15 17:58:17,640 INFO L226 Difference]: Without dead ends: 94 [2022-04-15 17:58:17,640 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:58:17,643 INFO L913 BasicCegarLoop]: 136 mSDtfsCounter, 170 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 143 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.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:58:17,647 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 143 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:58:17,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-15 17:58:17,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2022-04-15 17:58:17,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:58:17,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:17,665 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:17,665 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:17,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:17,672 INFO L93 Difference]: Finished difference Result 94 states and 165 transitions. [2022-04-15 17:58:17,672 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 165 transitions. [2022-04-15 17:58:17,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:17,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:17,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 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 94 states. [2022-04-15 17:58:17,678 INFO L87 Difference]: Start difference. First operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 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 94 states. [2022-04-15 17:58:17,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:17,684 INFO L93 Difference]: Finished difference Result 94 states and 165 transitions. [2022-04-15 17:58:17,685 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 165 transitions. [2022-04-15 17:58:17,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:17,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:17,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:58:17,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:58:17,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:17,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 164 transitions. [2022-04-15 17:58:17,689 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 164 transitions. Word has length 25 [2022-04-15 17:58:17,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:58:17,689 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 164 transitions. [2022-04-15 17:58:17,689 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:58:17,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 164 transitions. [2022-04-15 17:58:17,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:17,871 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 164 transitions. [2022-04-15 17:58:17,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 17:58:17,872 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:58:17,872 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:58:17,872 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 17:58:17,874 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:58:17,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:58:17,875 INFO L85 PathProgramCache]: Analyzing trace with hash -52626544, now seen corresponding path program 1 times [2022-04-15 17:58:17,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:17,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1977918701] [2022-04-15 17:58:17,879 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:58:17,882 INFO L85 PathProgramCache]: Analyzing trace with hash -52626544, now seen corresponding path program 2 times [2022-04-15 17:58:17,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:58:17,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676606649] [2022-04-15 17:58:17,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:58:17,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:58:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:17,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:58:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:17,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {1919#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1913#true} is VALID [2022-04-15 17:58:17,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {1913#true} assume true; {1913#true} is VALID [2022-04-15 17:58:17,950 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1913#true} {1913#true} #251#return; {1913#true} is VALID [2022-04-15 17:58:17,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {1913#true} call ULTIMATE.init(); {1919#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:58:17,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {1919#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1913#true} is VALID [2022-04-15 17:58:17,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {1913#true} assume true; {1913#true} is VALID [2022-04-15 17:58:17,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1913#true} {1913#true} #251#return; {1913#true} is VALID [2022-04-15 17:58:17,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {1913#true} call #t~ret18 := main(); {1913#true} is VALID [2022-04-15 17:58:17,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {1913#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;havoc ~cond~0; {1913#true} is VALID [2022-04-15 17:58:17,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {1913#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {1913#true} is VALID [2022-04-15 17:58:17,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {1913#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; {1913#true} is VALID [2022-04-15 17:58:17,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {1913#true} assume !(0 != ~p1~0); {1913#true} is VALID [2022-04-15 17:58:17,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {1913#true} assume !(0 != ~p2~0); {1918#(= main_~p2~0 0)} is VALID [2022-04-15 17:58:17,953 INFO L290 TraceCheckUtils]: 10: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-15 17:58:17,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-15 17:58:17,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-15 17:58:17,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-15 17:58:17,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-15 17:58:17,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-15 17:58:17,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-15 17:58:17,956 INFO L290 TraceCheckUtils]: 17: Hoare triple {1918#(= main_~p2~0 0)} assume !(0 != ~p10~0); {1918#(= main_~p2~0 0)} is VALID [2022-04-15 17:58:17,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-15 17:58:17,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-15 17:58:17,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-15 17:58:17,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {1918#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1918#(= main_~p2~0 0)} is VALID [2022-04-15 17:58:17,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p2~0; {1914#false} is VALID [2022-04-15 17:58:17,959 INFO L290 TraceCheckUtils]: 23: Hoare triple {1914#false} assume 1 != ~lk2~0; {1914#false} is VALID [2022-04-15 17:58:17,959 INFO L290 TraceCheckUtils]: 24: Hoare triple {1914#false} assume !false; {1914#false} is VALID [2022-04-15 17:58:17,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:58:17,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:58:17,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676606649] [2022-04-15 17:58:17,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676606649] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:17,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:17,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:17,960 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:58:17,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1977918701] [2022-04-15 17:58:17,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1977918701] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:17,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:17,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:17,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111630762] [2022-04-15 17:58:17,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:58:17,961 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:58:17,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:58:17,962 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:58:17,979 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:58:17,979 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:58:17,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:17,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:58:17,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:58:17,980 INFO L87 Difference]: Start difference. First operand 92 states and 164 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:58:18,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:18,237 INFO L93 Difference]: Finished difference Result 256 states and 468 transitions. [2022-04-15 17:58:18,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:58:18,237 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:58:18,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:58:18,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:58:18,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2022-04-15 17:58:18,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:58:18,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2022-04-15 17:58:18,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 244 transitions. [2022-04-15 17:58:18,438 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 17:58:18,441 INFO L225 Difference]: With dead ends: 256 [2022-04-15 17:58:18,441 INFO L226 Difference]: Without dead ends: 173 [2022-04-15 17:58:18,442 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 17:58:18,444 INFO L913 BasicCegarLoop]: 90 mSDtfsCounter, 214 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 97 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 17:58:18,445 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 97 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:58:18,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-15 17:58:18,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2022-04-15 17:58:18,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:58:18,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:18,466 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:18,466 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:18,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:18,471 INFO L93 Difference]: Finished difference Result 173 states and 310 transitions. [2022-04-15 17:58:18,471 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 310 transitions. [2022-04-15 17:58:18,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:18,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:18,472 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 173 states. [2022-04-15 17:58:18,473 INFO L87 Difference]: Start difference. First operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 173 states. [2022-04-15 17:58:18,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:18,478 INFO L93 Difference]: Finished difference Result 173 states and 310 transitions. [2022-04-15 17:58:18,478 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 310 transitions. [2022-04-15 17:58:18,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:18,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:18,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:58:18,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:58:18,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:18,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 309 transitions. [2022-04-15 17:58:18,484 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 309 transitions. Word has length 25 [2022-04-15 17:58:18,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:58:18,485 INFO L478 AbstractCegarLoop]: Abstraction has 171 states and 309 transitions. [2022-04-15 17:58:18,485 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:58:18,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 171 states and 309 transitions. [2022-04-15 17:58:18,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 309 edges. 309 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:18,799 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 309 transitions. [2022-04-15 17:58:18,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 17:58:18,801 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:58:18,801 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:58:18,801 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 17:58:18,801 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:58:18,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:58:18,802 INFO L85 PathProgramCache]: Analyzing trace with hash 968441810, now seen corresponding path program 1 times [2022-04-15 17:58:18,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:18,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1324312423] [2022-04-15 17:58:18,803 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:58:18,803 INFO L85 PathProgramCache]: Analyzing trace with hash 968441810, now seen corresponding path program 2 times [2022-04-15 17:58:18,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:58:18,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540836116] [2022-04-15 17:58:18,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:58:18,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:58:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:18,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:58:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:18,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {3131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3125#true} is VALID [2022-04-15 17:58:18,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {3125#true} assume true; {3125#true} is VALID [2022-04-15 17:58:18,881 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3125#true} {3125#true} #251#return; {3125#true} is VALID [2022-04-15 17:58:18,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {3125#true} call ULTIMATE.init(); {3131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:58:18,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {3131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3125#true} is VALID [2022-04-15 17:58:18,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {3125#true} assume true; {3125#true} is VALID [2022-04-15 17:58:18,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3125#true} {3125#true} #251#return; {3125#true} is VALID [2022-04-15 17:58:18,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {3125#true} call #t~ret18 := main(); {3125#true} is VALID [2022-04-15 17:58:18,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {3125#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;havoc ~cond~0; {3125#true} is VALID [2022-04-15 17:58:18,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {3125#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {3125#true} is VALID [2022-04-15 17:58:18,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {3125#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; {3125#true} is VALID [2022-04-15 17:58:18,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {3125#true} assume !(0 != ~p1~0); {3125#true} is VALID [2022-04-15 17:58:18,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {3125#true} assume 0 != ~p2~0;~lk2~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-15 17:58:18,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-15 17:58:18,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-15 17:58:18,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-15 17:58:18,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-15 17:58:18,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-15 17:58:18,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-15 17:58:18,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-15 17:58:18,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {3130#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {3130#(= main_~lk2~0 1)} is VALID [2022-04-15 17:58:18,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-15 17:58:18,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-15 17:58:18,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-15 17:58:18,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {3130#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {3130#(= main_~lk2~0 1)} is VALID [2022-04-15 17:58:18,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p2~0; {3130#(= main_~lk2~0 1)} is VALID [2022-04-15 17:58:18,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {3130#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {3126#false} is VALID [2022-04-15 17:58:18,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {3126#false} assume !false; {3126#false} is VALID [2022-04-15 17:58:18,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:58:18,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:58:18,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540836116] [2022-04-15 17:58:18,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540836116] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:18,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:18,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:18,891 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:58:18,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1324312423] [2022-04-15 17:58:18,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1324312423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:18,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:18,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:18,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944958170] [2022-04-15 17:58:18,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:58:18,892 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:58:18,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:58:18,892 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:58:18,909 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:58:18,909 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:58:18,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:18,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:58:18,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:58:18,910 INFO L87 Difference]: Start difference. First operand 171 states and 309 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:58:19,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:19,174 INFO L93 Difference]: Finished difference Result 223 states and 403 transitions. [2022-04-15 17:58:19,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:58:19,174 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:58:19,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:58:19,175 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:58:19,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2022-04-15 17:58:19,177 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:58:19,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2022-04-15 17:58:19,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 160 transitions. [2022-04-15 17:58:19,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:19,316 INFO L225 Difference]: With dead ends: 223 [2022-04-15 17:58:19,316 INFO L226 Difference]: Without dead ends: 221 [2022-04-15 17:58:19,316 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:58:19,317 INFO L913 BasicCegarLoop]: 157 mSDtfsCounter, 139 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 164 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.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:58:19,317 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 164 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:58:19,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-04-15 17:58:19,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 171. [2022-04-15 17:58:19,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:58:19,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states. Second operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:19,334 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:19,335 INFO L87 Difference]: Start difference. First operand 221 states. Second operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:19,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:19,342 INFO L93 Difference]: Finished difference Result 221 states and 400 transitions. [2022-04-15 17:58:19,342 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 400 transitions. [2022-04-15 17:58:19,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:19,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:19,343 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 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 221 states. [2022-04-15 17:58:19,344 INFO L87 Difference]: Start difference. First operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 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 221 states. [2022-04-15 17:58:19,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:19,350 INFO L93 Difference]: Finished difference Result 221 states and 400 transitions. [2022-04-15 17:58:19,350 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 400 transitions. [2022-04-15 17:58:19,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:19,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:19,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:58:19,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:58:19,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:19,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 307 transitions. [2022-04-15 17:58:19,357 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 307 transitions. Word has length 25 [2022-04-15 17:58:19,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:58:19,358 INFO L478 AbstractCegarLoop]: Abstraction has 171 states and 307 transitions. [2022-04-15 17:58:19,358 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:58:19,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 171 states and 307 transitions. [2022-04-15 17:58:19,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 307 edges. 307 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:19,645 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 307 transitions. [2022-04-15 17:58:19,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 17:58:19,645 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:58:19,645 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:58:19,646 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 17:58:19,646 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:58:19,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:58:19,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1631210112, now seen corresponding path program 1 times [2022-04-15 17:58:19,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:19,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1569285950] [2022-04-15 17:58:19,647 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:58:19,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1631210112, now seen corresponding path program 2 times [2022-04-15 17:58:19,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:58:19,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974719936] [2022-04-15 17:58:19,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:58:19,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:58:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:19,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:58:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:19,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {4373#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {4367#true} is VALID [2022-04-15 17:58:19,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {4367#true} assume true; {4367#true} is VALID [2022-04-15 17:58:19,715 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4367#true} {4367#true} #251#return; {4367#true} is VALID [2022-04-15 17:58:19,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {4367#true} call ULTIMATE.init(); {4373#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:58:19,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {4373#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {4367#true} is VALID [2022-04-15 17:58:19,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {4367#true} assume true; {4367#true} is VALID [2022-04-15 17:58:19,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4367#true} {4367#true} #251#return; {4367#true} is VALID [2022-04-15 17:58:19,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {4367#true} call #t~ret18 := main(); {4367#true} is VALID [2022-04-15 17:58:19,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {4367#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;havoc ~cond~0; {4367#true} is VALID [2022-04-15 17:58:19,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {4367#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {4367#true} is VALID [2022-04-15 17:58:19,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {4367#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; {4367#true} is VALID [2022-04-15 17:58:19,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {4367#true} assume !(0 != ~p1~0); {4367#true} is VALID [2022-04-15 17:58:19,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {4367#true} assume !(0 != ~p2~0); {4367#true} is VALID [2022-04-15 17:58:19,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {4367#true} assume 0 != ~p3~0;~lk3~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-15 17:58:19,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-15 17:58:19,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-15 17:58:19,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-15 17:58:19,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-15 17:58:19,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-15 17:58:19,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-15 17:58:19,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {4372#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {4372#(= main_~lk3~0 1)} is VALID [2022-04-15 17:58:19,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-15 17:58:19,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-15 17:58:19,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-15 17:58:19,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {4372#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {4372#(= main_~lk3~0 1)} is VALID [2022-04-15 17:58:19,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {4372#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {4372#(= main_~lk3~0 1)} is VALID [2022-04-15 17:58:19,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p3~0; {4372#(= main_~lk3~0 1)} is VALID [2022-04-15 17:58:19,723 INFO L290 TraceCheckUtils]: 24: Hoare triple {4372#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {4368#false} is VALID [2022-04-15 17:58:19,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {4368#false} assume !false; {4368#false} is VALID [2022-04-15 17:58:19,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:58:19,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:58:19,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974719936] [2022-04-15 17:58:19,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974719936] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:19,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:19,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:19,724 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:58:19,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1569285950] [2022-04-15 17:58:19,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1569285950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:19,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:19,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:19,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176757738] [2022-04-15 17:58:19,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:58:19,725 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:58:19,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:58:19,726 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:58:19,743 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:58:19,743 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:58:19,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:19,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:58:19,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:58:19,744 INFO L87 Difference]: Start difference. First operand 171 states and 307 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:58:20,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:20,004 INFO L93 Difference]: Finished difference Result 323 states and 587 transitions. [2022-04-15 17:58:20,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:58:20,004 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:58:20,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:58:20,005 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:58:20,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-15 17:58:20,007 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:58:20,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-15 17:58:20,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-04-15 17:58:20,133 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 17:58:20,143 INFO L225 Difference]: With dead ends: 323 [2022-04-15 17:58:20,143 INFO L226 Difference]: Without dead ends: 321 [2022-04-15 17:58:20,143 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:58:20,145 INFO L913 BasicCegarLoop]: 87 mSDtfsCounter, 205 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 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 17:58:20,145 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [205 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 17:58:20,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-04-15 17:58:20,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 231. [2022-04-15 17:58:20,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:58:20,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:20,168 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:20,168 INFO L87 Difference]: Start difference. First operand 321 states. Second operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:20,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:20,177 INFO L93 Difference]: Finished difference Result 321 states and 582 transitions. [2022-04-15 17:58:20,177 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 582 transitions. [2022-04-15 17:58:20,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:20,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:20,179 INFO L74 IsIncluded]: Start isIncluded. First operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 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 321 states. [2022-04-15 17:58:20,179 INFO L87 Difference]: Start difference. First operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 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 321 states. [2022-04-15 17:58:20,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:20,188 INFO L93 Difference]: Finished difference Result 321 states and 582 transitions. [2022-04-15 17:58:20,188 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 582 transitions. [2022-04-15 17:58:20,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:20,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:20,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:58:20,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:58:20,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:20,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 413 transitions. [2022-04-15 17:58:20,195 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 413 transitions. Word has length 26 [2022-04-15 17:58:20,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:58:20,196 INFO L478 AbstractCegarLoop]: Abstraction has 231 states and 413 transitions. [2022-04-15 17:58:20,196 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:58:20,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 231 states and 413 transitions. [2022-04-15 17:58:20,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 413 edges. 413 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:20,568 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 413 transitions. [2022-04-15 17:58:20,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 17:58:20,568 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:58:20,568 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:58:20,568 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 17:58:20,568 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:58:20,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:58:20,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1642688830, now seen corresponding path program 1 times [2022-04-15 17:58:20,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:20,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1042552780] [2022-04-15 17:58:20,569 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:58:20,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1642688830, now seen corresponding path program 2 times [2022-04-15 17:58:20,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:58:20,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278820451] [2022-04-15 17:58:20,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:58:20,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:58:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:20,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:58:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:20,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {6135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {6129#true} is VALID [2022-04-15 17:58:20,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {6129#true} assume true; {6129#true} is VALID [2022-04-15 17:58:20,640 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6129#true} {6129#true} #251#return; {6129#true} is VALID [2022-04-15 17:58:20,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {6129#true} call ULTIMATE.init(); {6135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:58:20,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {6135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {6129#true} is VALID [2022-04-15 17:58:20,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {6129#true} assume true; {6129#true} is VALID [2022-04-15 17:58:20,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6129#true} {6129#true} #251#return; {6129#true} is VALID [2022-04-15 17:58:20,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {6129#true} call #t~ret18 := main(); {6129#true} is VALID [2022-04-15 17:58:20,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {6129#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;havoc ~cond~0; {6129#true} is VALID [2022-04-15 17:58:20,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {6129#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {6129#true} is VALID [2022-04-15 17:58:20,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {6129#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; {6129#true} is VALID [2022-04-15 17:58:20,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {6129#true} assume !(0 != ~p1~0); {6129#true} is VALID [2022-04-15 17:58:20,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {6129#true} assume !(0 != ~p2~0); {6129#true} is VALID [2022-04-15 17:58:20,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {6129#true} assume !(0 != ~p3~0); {6134#(= main_~p3~0 0)} is VALID [2022-04-15 17:58:20,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-15 17:58:20,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-15 17:58:20,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-15 17:58:20,655 INFO L290 TraceCheckUtils]: 14: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-15 17:58:20,655 INFO L290 TraceCheckUtils]: 15: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-15 17:58:20,655 INFO L290 TraceCheckUtils]: 16: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-15 17:58:20,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {6134#(= main_~p3~0 0)} assume !(0 != ~p10~0); {6134#(= main_~p3~0 0)} is VALID [2022-04-15 17:58:20,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-15 17:58:20,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-15 17:58:20,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-15 17:58:20,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {6134#(= main_~p3~0 0)} assume !(0 != ~p1~0); {6134#(= main_~p3~0 0)} is VALID [2022-04-15 17:58:20,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {6134#(= main_~p3~0 0)} assume !(0 != ~p2~0); {6134#(= main_~p3~0 0)} is VALID [2022-04-15 17:58:20,658 INFO L290 TraceCheckUtils]: 23: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p3~0; {6130#false} is VALID [2022-04-15 17:58:20,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {6130#false} assume 1 != ~lk3~0; {6130#false} is VALID [2022-04-15 17:58:20,658 INFO L290 TraceCheckUtils]: 25: Hoare triple {6130#false} assume !false; {6130#false} is VALID [2022-04-15 17:58:20,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:58:20,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:58:20,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278820451] [2022-04-15 17:58:20,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278820451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:20,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:20,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:20,659 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:58:20,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1042552780] [2022-04-15 17:58:20,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1042552780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:20,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:20,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:20,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416855807] [2022-04-15 17:58:20,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:58:20,660 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:58:20,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:58:20,661 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:58:20,678 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:58:20,678 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:58:20,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:20,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:58:20,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:58:20,679 INFO L87 Difference]: Start difference. First operand 231 states and 413 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:58:20,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:20,930 INFO L93 Difference]: Finished difference Result 551 states and 995 transitions. [2022-04-15 17:58:20,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:58:20,931 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:58:20,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:58:20,931 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:58:20,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2022-04-15 17:58:20,933 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:58:20,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2022-04-15 17:58:20,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 240 transitions. [2022-04-15 17:58:21,099 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 17:58:21,108 INFO L225 Difference]: With dead ends: 551 [2022-04-15 17:58:21,108 INFO L226 Difference]: Without dead ends: 329 [2022-04-15 17:58:21,109 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:58:21,109 INFO L913 BasicCegarLoop]: 116 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 123 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.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:58:21,110 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 123 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:58:21,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-15 17:58:21,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2022-04-15 17:58:21,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:58:21,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:21,134 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:21,135 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:21,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:21,143 INFO L93 Difference]: Finished difference Result 329 states and 584 transitions. [2022-04-15 17:58:21,143 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 584 transitions. [2022-04-15 17:58:21,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:21,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:21,145 INFO L74 IsIncluded]: Start isIncluded. First operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 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 329 states. [2022-04-15 17:58:21,146 INFO L87 Difference]: Start difference. First operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 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 329 states. [2022-04-15 17:58:21,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:21,154 INFO L93 Difference]: Finished difference Result 329 states and 584 transitions. [2022-04-15 17:58:21,154 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 584 transitions. [2022-04-15 17:58:21,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:21,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:21,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:58:21,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:58:21,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:21,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 583 transitions. [2022-04-15 17:58:21,165 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 583 transitions. Word has length 26 [2022-04-15 17:58:21,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:58:21,166 INFO L478 AbstractCegarLoop]: Abstraction has 327 states and 583 transitions. [2022-04-15 17:58:21,166 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:58:21,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 327 states and 583 transitions. [2022-04-15 17:58:21,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 583 edges. 583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:21,689 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 583 transitions. [2022-04-15 17:58:21,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 17:58:21,690 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:58:21,690 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:58:21,690 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 17:58:21,690 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:58:21,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:58:21,691 INFO L85 PathProgramCache]: Analyzing trace with hash 972307173, now seen corresponding path program 1 times [2022-04-15 17:58:21,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:21,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [483990563] [2022-04-15 17:58:21,691 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:58:21,691 INFO L85 PathProgramCache]: Analyzing trace with hash 972307173, now seen corresponding path program 2 times [2022-04-15 17:58:21,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:58:21,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000271893] [2022-04-15 17:58:21,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:58:21,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:58:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:21,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:58:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:21,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {8561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {8555#true} is VALID [2022-04-15 17:58:21,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {8555#true} assume true; {8555#true} is VALID [2022-04-15 17:58:21,771 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8555#true} {8555#true} #251#return; {8555#true} is VALID [2022-04-15 17:58:21,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {8555#true} call ULTIMATE.init(); {8561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:58:21,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {8561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {8555#true} is VALID [2022-04-15 17:58:21,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {8555#true} assume true; {8555#true} is VALID [2022-04-15 17:58:21,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8555#true} {8555#true} #251#return; {8555#true} is VALID [2022-04-15 17:58:21,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {8555#true} call #t~ret18 := main(); {8555#true} is VALID [2022-04-15 17:58:21,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {8555#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;havoc ~cond~0; {8555#true} is VALID [2022-04-15 17:58:21,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {8555#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {8555#true} is VALID [2022-04-15 17:58:21,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {8555#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; {8555#true} is VALID [2022-04-15 17:58:21,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {8555#true} assume !(0 != ~p1~0); {8555#true} is VALID [2022-04-15 17:58:21,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {8555#true} assume !(0 != ~p2~0); {8555#true} is VALID [2022-04-15 17:58:21,776 INFO L290 TraceCheckUtils]: 10: Hoare triple {8555#true} assume 0 != ~p3~0;~lk3~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:58:21,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:58:21,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:58:21,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:58:21,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:58:21,786 INFO L290 TraceCheckUtils]: 15: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:58:21,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:58:21,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {8560#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {8560#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:58:21,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:58:21,787 INFO L290 TraceCheckUtils]: 19: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:58:21,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:58:21,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {8560#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {8560#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:58:21,788 INFO L290 TraceCheckUtils]: 22: Hoare triple {8560#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {8560#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:58:21,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {8560#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {8556#false} is VALID [2022-04-15 17:58:21,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {8556#false} assume 0 != ~p4~0; {8556#false} is VALID [2022-04-15 17:58:21,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {8556#false} assume 1 != ~lk4~0; {8556#false} is VALID [2022-04-15 17:58:21,789 INFO L290 TraceCheckUtils]: 26: Hoare triple {8556#false} assume !false; {8556#false} is VALID [2022-04-15 17:58:21,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:58:21,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:58:21,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000271893] [2022-04-15 17:58:21,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000271893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:21,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:21,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:21,790 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:58:21,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [483990563] [2022-04-15 17:58:21,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [483990563] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:21,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:21,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:21,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133376511] [2022-04-15 17:58:21,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:58:21,791 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:58:21,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:58:21,791 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:58:21,814 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:58:21,814 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:58:21,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:21,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:58:21,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:58:21,815 INFO L87 Difference]: Start difference. First operand 327 states and 583 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:58:22,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:22,072 INFO L93 Difference]: Finished difference Result 493 states and 877 transitions. [2022-04-15 17:58:22,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:58:22,073 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:58:22,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:58:22,073 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:58:22,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 235 transitions. [2022-04-15 17:58:22,075 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:58:22,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 235 transitions. [2022-04-15 17:58:22,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 235 transitions. [2022-04-15 17:58:22,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:22,259 INFO L225 Difference]: With dead ends: 493 [2022-04-15 17:58:22,259 INFO L226 Difference]: Without dead ends: 335 [2022-04-15 17:58:22,259 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:58:22,260 INFO L913 BasicCegarLoop]: 130 mSDtfsCounter, 168 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 137 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 17:58:22,260 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 137 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:58:22,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-04-15 17:58:22,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333. [2022-04-15 17:58:22,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:58:22,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 335 states. Second operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:22,286 INFO L74 IsIncluded]: Start isIncluded. First operand 335 states. Second operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:22,286 INFO L87 Difference]: Start difference. First operand 335 states. Second operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:22,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:22,294 INFO L93 Difference]: Finished difference Result 335 states and 588 transitions. [2022-04-15 17:58:22,294 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 588 transitions. [2022-04-15 17:58:22,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:22,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:22,296 INFO L74 IsIncluded]: Start isIncluded. First operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 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 335 states. [2022-04-15 17:58:22,297 INFO L87 Difference]: Start difference. First operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 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 335 states. [2022-04-15 17:58:22,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:22,304 INFO L93 Difference]: Finished difference Result 335 states and 588 transitions. [2022-04-15 17:58:22,304 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 588 transitions. [2022-04-15 17:58:22,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:22,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:22,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:58:22,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:58:22,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:22,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 587 transitions. [2022-04-15 17:58:22,315 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 587 transitions. Word has length 27 [2022-04-15 17:58:22,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:58:22,315 INFO L478 AbstractCegarLoop]: Abstraction has 333 states and 587 transitions. [2022-04-15 17:58:22,315 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:58:22,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 333 states and 587 transitions. [2022-04-15 17:58:22,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 587 edges. 587 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:22,911 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 587 transitions. [2022-04-15 17:58:22,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 17:58:22,913 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:58:22,913 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:58:22,914 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 17:58:22,915 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:58:22,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:58:22,916 INFO L85 PathProgramCache]: Analyzing trace with hash -616040729, now seen corresponding path program 1 times [2022-04-15 17:58:22,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:22,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2019958592] [2022-04-15 17:58:22,916 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:58:22,916 INFO L85 PathProgramCache]: Analyzing trace with hash -616040729, now seen corresponding path program 2 times [2022-04-15 17:58:22,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:58:22,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978305727] [2022-04-15 17:58:22,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:58:22,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:58:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:22,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:58:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:22,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {10895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {10889#true} is VALID [2022-04-15 17:58:22,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {10889#true} assume true; {10889#true} is VALID [2022-04-15 17:58:22,997 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10889#true} {10889#true} #251#return; {10889#true} is VALID [2022-04-15 17:58:22,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {10889#true} call ULTIMATE.init(); {10895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:58:22,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {10895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {10889#true} is VALID [2022-04-15 17:58:22,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {10889#true} assume true; {10889#true} is VALID [2022-04-15 17:58:22,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10889#true} {10889#true} #251#return; {10889#true} is VALID [2022-04-15 17:58:22,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {10889#true} call #t~ret18 := main(); {10889#true} is VALID [2022-04-15 17:58:22,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {10889#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;havoc ~cond~0; {10889#true} is VALID [2022-04-15 17:58:22,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {10889#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {10889#true} is VALID [2022-04-15 17:58:22,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {10889#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; {10889#true} is VALID [2022-04-15 17:58:22,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {10889#true} assume !(0 != ~p1~0); {10889#true} is VALID [2022-04-15 17:58:22,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {10889#true} assume !(0 != ~p2~0); {10889#true} is VALID [2022-04-15 17:58:22,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {10889#true} assume !(0 != ~p3~0); {10889#true} is VALID [2022-04-15 17:58:23,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {10889#true} assume 0 != ~p4~0;~lk4~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-15 17:58:23,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-15 17:58:23,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-15 17:58:23,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-15 17:58:23,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-15 17:58:23,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-15 17:58:23,005 INFO L290 TraceCheckUtils]: 17: Hoare triple {10894#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {10894#(= main_~lk4~0 1)} is VALID [2022-04-15 17:58:23,006 INFO L290 TraceCheckUtils]: 18: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-15 17:58:23,006 INFO L290 TraceCheckUtils]: 19: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-15 17:58:23,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-15 17:58:23,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {10894#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {10894#(= main_~lk4~0 1)} is VALID [2022-04-15 17:58:23,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {10894#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {10894#(= main_~lk4~0 1)} is VALID [2022-04-15 17:58:23,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {10894#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {10894#(= main_~lk4~0 1)} is VALID [2022-04-15 17:58:23,008 INFO L290 TraceCheckUtils]: 24: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p4~0; {10894#(= main_~lk4~0 1)} is VALID [2022-04-15 17:58:23,008 INFO L290 TraceCheckUtils]: 25: Hoare triple {10894#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {10890#false} is VALID [2022-04-15 17:58:23,008 INFO L290 TraceCheckUtils]: 26: Hoare triple {10890#false} assume !false; {10890#false} is VALID [2022-04-15 17:58:23,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 17:58:23,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:58:23,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978305727] [2022-04-15 17:58:23,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978305727] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:23,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:23,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:23,009 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:58:23,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2019958592] [2022-04-15 17:58:23,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2019958592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:23,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:23,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:23,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534186260] [2022-04-15 17:58:23,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:58:23,010 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:58:23,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:58:23,010 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:58:23,035 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:58:23,036 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:58:23,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:23,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:58:23,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:58:23,036 INFO L87 Difference]: Start difference. First operand 333 states and 587 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:58:23,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:23,329 INFO L93 Difference]: Finished difference Result 621 states and 1109 transitions. [2022-04-15 17:58:23,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:58:23,330 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:58:23,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:58:23,330 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:58:23,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-04-15 17:58:23,332 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:58:23,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-04-15 17:58:23,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 155 transitions. [2022-04-15 17:58:23,467 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 17:58:23,494 INFO L225 Difference]: With dead ends: 621 [2022-04-15 17:58:23,494 INFO L226 Difference]: Without dead ends: 619 [2022-04-15 17:58:23,495 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:58:23,495 INFO L913 BasicCegarLoop]: 86 mSDtfsCounter, 198 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 93 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.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:58:23,495 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 93 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:58:23,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-04-15 17:58:23,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 457. [2022-04-15 17:58:23,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:58:23,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 619 states. Second operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:23,530 INFO L74 IsIncluded]: Start isIncluded. First operand 619 states. Second operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:23,539 INFO L87 Difference]: Start difference. First operand 619 states. Second operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:23,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:23,561 INFO L93 Difference]: Finished difference Result 619 states and 1100 transitions. [2022-04-15 17:58:23,561 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 1100 transitions. [2022-04-15 17:58:23,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:23,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:23,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 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 619 states. [2022-04-15 17:58:23,564 INFO L87 Difference]: Start difference. First operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 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 619 states. [2022-04-15 17:58:23,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:23,585 INFO L93 Difference]: Finished difference Result 619 states and 1100 transitions. [2022-04-15 17:58:23,585 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 1100 transitions. [2022-04-15 17:58:23,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:23,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:23,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:58:23,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:58:23,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:23,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 795 transitions. [2022-04-15 17:58:23,606 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 795 transitions. Word has length 27 [2022-04-15 17:58:23,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:58:23,606 INFO L478 AbstractCegarLoop]: Abstraction has 457 states and 795 transitions. [2022-04-15 17:58:23,606 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:58:23,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 457 states and 795 transitions. [2022-04-15 17:58:24,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 795 edges. 795 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:24,368 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 795 transitions. [2022-04-15 17:58:24,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 17:58:24,368 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:58:24,368 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:58:24,369 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 17:58:24,369 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:58:24,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:58:24,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1637109083, now seen corresponding path program 1 times [2022-04-15 17:58:24,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:24,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1213273098] [2022-04-15 17:58:24,370 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:58:24,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1637109083, now seen corresponding path program 2 times [2022-04-15 17:58:24,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:58:24,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331668222] [2022-04-15 17:58:24,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:58:24,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:58:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:24,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:58:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:24,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {14301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {14295#true} is VALID [2022-04-15 17:58:24,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-15 17:58:24,426 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14295#true} {14295#true} #251#return; {14295#true} is VALID [2022-04-15 17:58:24,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {14295#true} call ULTIMATE.init(); {14301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:58:24,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {14301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {14295#true} is VALID [2022-04-15 17:58:24,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-15 17:58:24,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14295#true} {14295#true} #251#return; {14295#true} is VALID [2022-04-15 17:58:24,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {14295#true} call #t~ret18 := main(); {14295#true} is VALID [2022-04-15 17:58:24,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {14295#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;havoc ~cond~0; {14295#true} is VALID [2022-04-15 17:58:24,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {14295#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {14295#true} is VALID [2022-04-15 17:58:24,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {14295#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; {14295#true} is VALID [2022-04-15 17:58:24,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {14295#true} assume !(0 != ~p1~0); {14295#true} is VALID [2022-04-15 17:58:24,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {14295#true} assume !(0 != ~p2~0); {14295#true} is VALID [2022-04-15 17:58:24,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {14295#true} assume !(0 != ~p3~0); {14295#true} is VALID [2022-04-15 17:58:24,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {14295#true} assume !(0 != ~p4~0); {14300#(= main_~p4~0 0)} is VALID [2022-04-15 17:58:24,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-15 17:58:24,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-15 17:58:24,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-15 17:58:24,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-15 17:58:24,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-15 17:58:24,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {14300#(= main_~p4~0 0)} assume !(0 != ~p10~0); {14300#(= main_~p4~0 0)} is VALID [2022-04-15 17:58:24,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-15 17:58:24,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-15 17:58:24,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-15 17:58:24,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {14300#(= main_~p4~0 0)} assume !(0 != ~p1~0); {14300#(= main_~p4~0 0)} is VALID [2022-04-15 17:58:24,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {14300#(= main_~p4~0 0)} assume !(0 != ~p2~0); {14300#(= main_~p4~0 0)} is VALID [2022-04-15 17:58:24,432 INFO L290 TraceCheckUtils]: 23: Hoare triple {14300#(= main_~p4~0 0)} assume !(0 != ~p3~0); {14300#(= main_~p4~0 0)} is VALID [2022-04-15 17:58:24,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p4~0; {14296#false} is VALID [2022-04-15 17:58:24,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {14296#false} assume 1 != ~lk4~0; {14296#false} is VALID [2022-04-15 17:58:24,433 INFO L290 TraceCheckUtils]: 26: Hoare triple {14296#false} assume !false; {14296#false} is VALID [2022-04-15 17:58:24,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:58:24,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:58:24,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331668222] [2022-04-15 17:58:24,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331668222] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:24,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:24,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:24,434 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:58:24,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1213273098] [2022-04-15 17:58:24,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1213273098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:24,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:24,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:24,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716762528] [2022-04-15 17:58:24,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:58:24,435 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:58:24,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:58:24,435 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:58:24,452 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:58:24,452 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:58:24,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:24,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:58:24,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:58:24,453 INFO L87 Difference]: Start difference. First operand 457 states and 795 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:58:24,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:24,788 INFO L93 Difference]: Finished difference Result 1085 states and 1901 transitions. [2022-04-15 17:58:24,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:58:24,788 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:58:24,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:58:24,788 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:58:24,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions. [2022-04-15 17:58:24,790 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:58:24,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions. [2022-04-15 17:58:24,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 237 transitions. [2022-04-15 17:58:24,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:25,002 INFO L225 Difference]: With dead ends: 1085 [2022-04-15 17:58:25,002 INFO L226 Difference]: Without dead ends: 643 [2022-04-15 17:58:25,004 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:58:25,004 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 175 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:58:25,005 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 125 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:58:25,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2022-04-15 17:58:25,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 641. [2022-04-15 17:58:25,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:58:25,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 643 states. Second operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:25,063 INFO L74 IsIncluded]: Start isIncluded. First operand 643 states. Second operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:25,064 INFO L87 Difference]: Start difference. First operand 643 states. Second operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:25,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:25,085 INFO L93 Difference]: Finished difference Result 643 states and 1112 transitions. [2022-04-15 17:58:25,085 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1112 transitions. [2022-04-15 17:58:25,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:25,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:25,088 INFO L74 IsIncluded]: Start isIncluded. First operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 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 643 states. [2022-04-15 17:58:25,089 INFO L87 Difference]: Start difference. First operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 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 643 states. [2022-04-15 17:58:25,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:25,110 INFO L93 Difference]: Finished difference Result 643 states and 1112 transitions. [2022-04-15 17:58:25,110 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1112 transitions. [2022-04-15 17:58:25,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:25,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:25,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:58:25,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:58:25,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:25,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1111 transitions. [2022-04-15 17:58:25,142 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1111 transitions. Word has length 27 [2022-04-15 17:58:25,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:58:25,142 INFO L478 AbstractCegarLoop]: Abstraction has 641 states and 1111 transitions. [2022-04-15 17:58:25,142 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:58:25,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 641 states and 1111 transitions. [2022-04-15 17:58:26,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1111 edges. 1111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:26,312 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1111 transitions. [2022-04-15 17:58:26,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 17:58:26,313 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:58:26,313 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:58:26,313 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 17:58:26,314 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:58:26,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:58:26,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1917179981, now seen corresponding path program 1 times [2022-04-15 17:58:26,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:26,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1704196227] [2022-04-15 17:58:26,314 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:58:26,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1917179981, now seen corresponding path program 2 times [2022-04-15 17:58:26,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:58:26,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451653163] [2022-04-15 17:58:26,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:58:26,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:58:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:26,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:58:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:26,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {19051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {19045#true} is VALID [2022-04-15 17:58:26,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {19045#true} assume true; {19045#true} is VALID [2022-04-15 17:58:26,354 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19045#true} {19045#true} #251#return; {19045#true} is VALID [2022-04-15 17:58:26,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {19045#true} call ULTIMATE.init(); {19051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:58:26,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {19051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {19045#true} is VALID [2022-04-15 17:58:26,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {19045#true} assume true; {19045#true} is VALID [2022-04-15 17:58:26,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19045#true} {19045#true} #251#return; {19045#true} is VALID [2022-04-15 17:58:26,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {19045#true} call #t~ret18 := main(); {19045#true} is VALID [2022-04-15 17:58:26,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {19045#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;havoc ~cond~0; {19045#true} is VALID [2022-04-15 17:58:26,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {19045#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {19045#true} is VALID [2022-04-15 17:58:26,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {19045#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; {19045#true} is VALID [2022-04-15 17:58:26,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {19045#true} assume !(0 != ~p1~0); {19045#true} is VALID [2022-04-15 17:58:26,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {19045#true} assume !(0 != ~p2~0); {19045#true} is VALID [2022-04-15 17:58:26,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {19045#true} assume !(0 != ~p3~0); {19045#true} is VALID [2022-04-15 17:58:26,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {19045#true} assume 0 != ~p4~0;~lk4~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:58:26,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:58:26,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:58:26,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:58:26,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:58:26,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:58:26,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {19050#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {19050#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:58:26,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:58:26,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:58:26,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:58:26,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {19050#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {19050#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:58:26,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {19050#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {19050#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:58:26,361 INFO L290 TraceCheckUtils]: 23: Hoare triple {19050#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {19050#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:58:26,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {19050#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {19046#false} is VALID [2022-04-15 17:58:26,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {19046#false} assume 0 != ~p5~0; {19046#false} is VALID [2022-04-15 17:58:26,361 INFO L290 TraceCheckUtils]: 26: Hoare triple {19046#false} assume 1 != ~lk5~0; {19046#false} is VALID [2022-04-15 17:58:26,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {19046#false} assume !false; {19046#false} is VALID [2022-04-15 17:58:26,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:58:26,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:58:26,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451653163] [2022-04-15 17:58:26,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451653163] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:26,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:26,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:26,362 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:58:26,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1704196227] [2022-04-15 17:58:26,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1704196227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:26,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:26,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:26,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676004523] [2022-04-15 17:58:26,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:58:26,363 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:58:26,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:58:26,364 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:58:26,381 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:58:26,381 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:58:26,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:26,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:58:26,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:58:26,382 INFO L87 Difference]: Start difference. First operand 641 states and 1111 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:58:26,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:26,685 INFO L93 Difference]: Finished difference Result 961 states and 1661 transitions. [2022-04-15 17:58:26,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:58:26,686 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:58:26,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:58:26,686 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:58:26,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 232 transitions. [2022-04-15 17:58:26,688 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:58:26,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 232 transitions. [2022-04-15 17:58:26,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 232 transitions. [2022-04-15 17:58:26,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 232 edges. 232 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:26,901 INFO L225 Difference]: With dead ends: 961 [2022-04-15 17:58:26,901 INFO L226 Difference]: Without dead ends: 651 [2022-04-15 17:58:26,902 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:58:26,902 INFO L913 BasicCegarLoop]: 127 mSDtfsCounter, 167 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:58:26,903 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 134 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:58:26,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2022-04-15 17:58:26,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 649. [2022-04-15 17:58:26,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:58:26,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 651 states. Second operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:26,953 INFO L74 IsIncluded]: Start isIncluded. First operand 651 states. Second operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:26,953 INFO L87 Difference]: Start difference. First operand 651 states. Second operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:26,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:26,975 INFO L93 Difference]: Finished difference Result 651 states and 1112 transitions. [2022-04-15 17:58:26,975 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1112 transitions. [2022-04-15 17:58:26,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:26,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:26,977 INFO L74 IsIncluded]: Start isIncluded. First operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 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 651 states. [2022-04-15 17:58:26,978 INFO L87 Difference]: Start difference. First operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 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 651 states. [2022-04-15 17:58:26,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:26,999 INFO L93 Difference]: Finished difference Result 651 states and 1112 transitions. [2022-04-15 17:58:27,000 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1112 transitions. [2022-04-15 17:58:27,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:27,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:27,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:58:27,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:58:27,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:27,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1111 transitions. [2022-04-15 17:58:27,033 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1111 transitions. Word has length 28 [2022-04-15 17:58:27,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:58:27,033 INFO L478 AbstractCegarLoop]: Abstraction has 649 states and 1111 transitions. [2022-04-15 17:58:27,033 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:58:27,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 649 states and 1111 transitions. [2022-04-15 17:58:28,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1111 edges. 1111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:28,147 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1111 transitions. [2022-04-15 17:58:28,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 17:58:28,148 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:58:28,148 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:58:28,148 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 17:58:28,148 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:58:28,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:58:28,149 INFO L85 PathProgramCache]: Analyzing trace with hash 789439413, now seen corresponding path program 1 times [2022-04-15 17:58:28,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:28,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1322795872] [2022-04-15 17:58:28,149 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:58:28,149 INFO L85 PathProgramCache]: Analyzing trace with hash 789439413, now seen corresponding path program 2 times [2022-04-15 17:58:28,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:58:28,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739914302] [2022-04-15 17:58:28,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:58:28,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:58:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:28,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:58:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:28,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {23585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {23579#true} is VALID [2022-04-15 17:58:28,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {23579#true} assume true; {23579#true} is VALID [2022-04-15 17:58:28,200 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23579#true} {23579#true} #251#return; {23579#true} is VALID [2022-04-15 17:58:28,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {23579#true} call ULTIMATE.init(); {23585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:58:28,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {23585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {23579#true} is VALID [2022-04-15 17:58:28,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {23579#true} assume true; {23579#true} is VALID [2022-04-15 17:58:28,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23579#true} {23579#true} #251#return; {23579#true} is VALID [2022-04-15 17:58:28,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {23579#true} call #t~ret18 := main(); {23579#true} is VALID [2022-04-15 17:58:28,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {23579#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;havoc ~cond~0; {23579#true} is VALID [2022-04-15 17:58:28,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {23579#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {23579#true} is VALID [2022-04-15 17:58:28,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {23579#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; {23579#true} is VALID [2022-04-15 17:58:28,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {23579#true} assume !(0 != ~p1~0); {23579#true} is VALID [2022-04-15 17:58:28,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {23579#true} assume !(0 != ~p2~0); {23579#true} is VALID [2022-04-15 17:58:28,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {23579#true} assume !(0 != ~p3~0); {23579#true} is VALID [2022-04-15 17:58:28,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {23579#true} assume !(0 != ~p4~0); {23579#true} is VALID [2022-04-15 17:58:28,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {23579#true} assume 0 != ~p5~0;~lk5~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-15 17:58:28,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-15 17:58:28,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-15 17:58:28,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-15 17:58:28,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-15 17:58:28,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {23584#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {23584#(= main_~lk5~0 1)} is VALID [2022-04-15 17:58:28,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-15 17:58:28,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-15 17:58:28,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-15 17:58:28,205 INFO L290 TraceCheckUtils]: 21: Hoare triple {23584#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {23584#(= main_~lk5~0 1)} is VALID [2022-04-15 17:58:28,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {23584#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {23584#(= main_~lk5~0 1)} is VALID [2022-04-15 17:58:28,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {23584#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {23584#(= main_~lk5~0 1)} is VALID [2022-04-15 17:58:28,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {23584#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {23584#(= main_~lk5~0 1)} is VALID [2022-04-15 17:58:28,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p5~0; {23584#(= main_~lk5~0 1)} is VALID [2022-04-15 17:58:28,207 INFO L290 TraceCheckUtils]: 26: Hoare triple {23584#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {23580#false} is VALID [2022-04-15 17:58:28,207 INFO L290 TraceCheckUtils]: 27: Hoare triple {23580#false} assume !false; {23580#false} is VALID [2022-04-15 17:58:28,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:58:28,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:58:28,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739914302] [2022-04-15 17:58:28,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739914302] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:28,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:28,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:28,208 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:58:28,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1322795872] [2022-04-15 17:58:28,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1322795872] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:28,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:28,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:28,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197632503] [2022-04-15 17:58:28,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:58:28,209 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:58:28,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:58:28,209 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:58:28,226 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:58:28,226 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:58:28,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:28,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:58:28,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:58:28,227 INFO L87 Difference]: Start difference. First operand 649 states and 1111 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:58:28,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:28,560 INFO L93 Difference]: Finished difference Result 1197 states and 2081 transitions. [2022-04-15 17:58:28,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:58:28,561 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:58:28,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:58:28,561 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:58:28,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-15 17:58:28,564 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:58:28,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-15 17:58:28,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-15 17:58:28,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:28,743 INFO L225 Difference]: With dead ends: 1197 [2022-04-15 17:58:28,743 INFO L226 Difference]: Without dead ends: 1195 [2022-04-15 17:58:28,743 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:58:28,744 INFO L913 BasicCegarLoop]: 85 mSDtfsCounter, 191 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 92 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.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:58:28,744 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 92 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:58:28,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2022-04-15 17:58:28,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 905. [2022-04-15 17:58:28,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:58:28,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1195 states. Second operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:28,822 INFO L74 IsIncluded]: Start isIncluded. First operand 1195 states. Second operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:28,823 INFO L87 Difference]: Start difference. First operand 1195 states. Second operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:28,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:28,888 INFO L93 Difference]: Finished difference Result 1195 states and 2064 transitions. [2022-04-15 17:58:28,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 2064 transitions. [2022-04-15 17:58:28,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:28,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:28,892 INFO L74 IsIncluded]: Start isIncluded. First operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 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 1195 states. [2022-04-15 17:58:28,894 INFO L87 Difference]: Start difference. First operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 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 1195 states. [2022-04-15 17:58:28,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:28,955 INFO L93 Difference]: Finished difference Result 1195 states and 2064 transitions. [2022-04-15 17:58:28,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 2064 transitions. [2022-04-15 17:58:28,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:28,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:28,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:58:28,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:58:28,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1519 transitions. [2022-04-15 17:58:29,015 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1519 transitions. Word has length 28 [2022-04-15 17:58:29,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:58:29,015 INFO L478 AbstractCegarLoop]: Abstraction has 905 states and 1519 transitions. [2022-04-15 17:58:29,015 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:58:29,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 905 states and 1519 transitions. [2022-04-15 17:58:30,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1519 edges. 1519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:30,530 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1519 transitions. [2022-04-15 17:58:30,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 17:58:30,532 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:58:30,532 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:58:30,532 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 17:58:30,532 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:58:30,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:58:30,532 INFO L85 PathProgramCache]: Analyzing trace with hash -231628941, now seen corresponding path program 1 times [2022-04-15 17:58:30,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:30,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2051246810] [2022-04-15 17:58:30,533 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:58:30,533 INFO L85 PathProgramCache]: Analyzing trace with hash -231628941, now seen corresponding path program 2 times [2022-04-15 17:58:30,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:58:30,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316173245] [2022-04-15 17:58:30,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:58:30,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:58:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:30,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:58:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:30,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {30191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {30185#true} is VALID [2022-04-15 17:58:30,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {30185#true} assume true; {30185#true} is VALID [2022-04-15 17:58:30,585 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30185#true} {30185#true} #251#return; {30185#true} is VALID [2022-04-15 17:58:30,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {30185#true} call ULTIMATE.init(); {30191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:58:30,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {30191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {30185#true} is VALID [2022-04-15 17:58:30,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {30185#true} assume true; {30185#true} is VALID [2022-04-15 17:58:30,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30185#true} {30185#true} #251#return; {30185#true} is VALID [2022-04-15 17:58:30,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {30185#true} call #t~ret18 := main(); {30185#true} is VALID [2022-04-15 17:58:30,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {30185#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;havoc ~cond~0; {30185#true} is VALID [2022-04-15 17:58:30,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {30185#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {30185#true} is VALID [2022-04-15 17:58:30,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {30185#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; {30185#true} is VALID [2022-04-15 17:58:30,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {30185#true} assume !(0 != ~p1~0); {30185#true} is VALID [2022-04-15 17:58:30,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {30185#true} assume !(0 != ~p2~0); {30185#true} is VALID [2022-04-15 17:58:30,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {30185#true} assume !(0 != ~p3~0); {30185#true} is VALID [2022-04-15 17:58:30,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {30185#true} assume !(0 != ~p4~0); {30185#true} is VALID [2022-04-15 17:58:30,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {30185#true} assume !(0 != ~p5~0); {30190#(= main_~p5~0 0)} is VALID [2022-04-15 17:58:30,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {30190#(= main_~p5~0 0)} is VALID [2022-04-15 17:58:30,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {30190#(= main_~p5~0 0)} is VALID [2022-04-15 17:58:30,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {30190#(= main_~p5~0 0)} is VALID [2022-04-15 17:58:30,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {30190#(= main_~p5~0 0)} is VALID [2022-04-15 17:58:30,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {30190#(= main_~p5~0 0)} assume !(0 != ~p10~0); {30190#(= main_~p5~0 0)} is VALID [2022-04-15 17:58:30,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {30190#(= main_~p5~0 0)} is VALID [2022-04-15 17:58:30,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {30190#(= main_~p5~0 0)} is VALID [2022-04-15 17:58:30,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {30190#(= main_~p5~0 0)} is VALID [2022-04-15 17:58:30,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {30190#(= main_~p5~0 0)} assume !(0 != ~p1~0); {30190#(= main_~p5~0 0)} is VALID [2022-04-15 17:58:30,591 INFO L290 TraceCheckUtils]: 22: Hoare triple {30190#(= main_~p5~0 0)} assume !(0 != ~p2~0); {30190#(= main_~p5~0 0)} is VALID [2022-04-15 17:58:30,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {30190#(= main_~p5~0 0)} assume !(0 != ~p3~0); {30190#(= main_~p5~0 0)} is VALID [2022-04-15 17:58:30,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {30190#(= main_~p5~0 0)} assume !(0 != ~p4~0); {30190#(= main_~p5~0 0)} is VALID [2022-04-15 17:58:30,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p5~0; {30186#false} is VALID [2022-04-15 17:58:30,596 INFO L290 TraceCheckUtils]: 26: Hoare triple {30186#false} assume 1 != ~lk5~0; {30186#false} is VALID [2022-04-15 17:58:30,596 INFO L290 TraceCheckUtils]: 27: Hoare triple {30186#false} assume !false; {30186#false} is VALID [2022-04-15 17:58:30,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:58:30,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:58:30,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316173245] [2022-04-15 17:58:30,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316173245] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:30,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:30,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:30,597 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:58:30,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2051246810] [2022-04-15 17:58:30,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2051246810] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:30,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:30,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:30,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358646506] [2022-04-15 17:58:30,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:58:30,598 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:58:30,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:58:30,598 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:58:30,616 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:58:30,616 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:58:30,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:30,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:58:30,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:58:30,616 INFO L87 Difference]: Start difference. First operand 905 states and 1519 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:58:31,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:31,132 INFO L93 Difference]: Finished difference Result 2141 states and 3617 transitions. [2022-04-15 17:58:31,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:58:31,132 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:58:31,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:58:31,132 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:58:31,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 234 transitions. [2022-04-15 17:58:31,134 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:58:31,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 234 transitions. [2022-04-15 17:58:31,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 234 transitions. [2022-04-15 17:58:31,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:31,344 INFO L225 Difference]: With dead ends: 2141 [2022-04-15 17:58:31,344 INFO L226 Difference]: Without dead ends: 1259 [2022-04-15 17:58:31,346 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 17:58:31,346 INFO L913 BasicCegarLoop]: 120 mSDtfsCounter, 169 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:58:31,347 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 127 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:58:31,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2022-04-15 17:58:31,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1257. [2022-04-15 17:58:31,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:58:31,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1259 states. Second operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:31,471 INFO L74 IsIncluded]: Start isIncluded. First operand 1259 states. Second operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:31,473 INFO L87 Difference]: Start difference. First operand 1259 states. Second operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:31,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:31,538 INFO L93 Difference]: Finished difference Result 1259 states and 2104 transitions. [2022-04-15 17:58:31,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 2104 transitions. [2022-04-15 17:58:31,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:31,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:31,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 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 1259 states. [2022-04-15 17:58:31,544 INFO L87 Difference]: Start difference. First operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 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 1259 states. [2022-04-15 17:58:31,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:31,611 INFO L93 Difference]: Finished difference Result 1259 states and 2104 transitions. [2022-04-15 17:58:31,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 2104 transitions. [2022-04-15 17:58:31,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:31,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:31,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:58:31,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:58:31,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:31,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 2103 transitions. [2022-04-15 17:58:31,729 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 2103 transitions. Word has length 28 [2022-04-15 17:58:31,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:58:31,730 INFO L478 AbstractCegarLoop]: Abstraction has 1257 states and 2103 transitions. [2022-04-15 17:58:31,734 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:58:31,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1257 states and 2103 transitions. [2022-04-15 17:58:33,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2103 edges. 2103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:33,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 2103 transitions. [2022-04-15 17:58:33,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 17:58:33,744 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:58:33,744 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:58:33,744 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 17:58:33,744 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:58:33,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:58:33,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1296968198, now seen corresponding path program 1 times [2022-04-15 17:58:33,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:33,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1481513466] [2022-04-15 17:58:33,745 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:58:33,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1296968198, now seen corresponding path program 2 times [2022-04-15 17:58:33,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:58:33,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638479928] [2022-04-15 17:58:33,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:58:33,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:58:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:33,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:58:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:33,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {39517#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {39511#true} is VALID [2022-04-15 17:58:33,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {39511#true} assume true; {39511#true} is VALID [2022-04-15 17:58:33,836 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39511#true} {39511#true} #251#return; {39511#true} is VALID [2022-04-15 17:58:33,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {39511#true} call ULTIMATE.init(); {39517#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:58:33,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {39517#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {39511#true} is VALID [2022-04-15 17:58:33,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {39511#true} assume true; {39511#true} is VALID [2022-04-15 17:58:33,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39511#true} {39511#true} #251#return; {39511#true} is VALID [2022-04-15 17:58:33,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {39511#true} call #t~ret18 := main(); {39511#true} is VALID [2022-04-15 17:58:33,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {39511#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;havoc ~cond~0; {39511#true} is VALID [2022-04-15 17:58:33,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {39511#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {39511#true} is VALID [2022-04-15 17:58:33,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {39511#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; {39511#true} is VALID [2022-04-15 17:58:33,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {39511#true} assume !(0 != ~p1~0); {39511#true} is VALID [2022-04-15 17:58:33,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {39511#true} assume !(0 != ~p2~0); {39511#true} is VALID [2022-04-15 17:58:33,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {39511#true} assume !(0 != ~p3~0); {39511#true} is VALID [2022-04-15 17:58:33,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {39511#true} assume !(0 != ~p4~0); {39511#true} is VALID [2022-04-15 17:58:33,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {39511#true} assume 0 != ~p5~0;~lk5~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:58:33,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:58:33,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:58:33,840 INFO L290 TraceCheckUtils]: 15: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:58:33,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:58:33,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {39516#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:58:33,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:58:33,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:58:33,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:58:33,842 INFO L290 TraceCheckUtils]: 21: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {39516#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:58:33,844 INFO L290 TraceCheckUtils]: 22: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {39516#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:58:33,845 INFO L290 TraceCheckUtils]: 23: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {39516#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:58:33,845 INFO L290 TraceCheckUtils]: 24: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {39516#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:58:33,845 INFO L290 TraceCheckUtils]: 25: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {39512#false} is VALID [2022-04-15 17:58:33,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {39512#false} assume 0 != ~p6~0; {39512#false} is VALID [2022-04-15 17:58:33,846 INFO L290 TraceCheckUtils]: 27: Hoare triple {39512#false} assume 1 != ~lk6~0; {39512#false} is VALID [2022-04-15 17:58:33,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {39512#false} assume !false; {39512#false} is VALID [2022-04-15 17:58:33,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:58:33,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:58:33,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638479928] [2022-04-15 17:58:33,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638479928] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:33,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:33,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:33,847 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:58:33,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1481513466] [2022-04-15 17:58:33,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1481513466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:33,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:33,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:33,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11098574] [2022-04-15 17:58:33,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:58:33,848 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:58:33,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:58:33,848 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:58:33,867 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:58:33,867 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:58:33,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:33,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:58:33,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:58:33,868 INFO L87 Difference]: Start difference. First operand 1257 states and 2103 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:58:34,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:34,298 INFO L93 Difference]: Finished difference Result 1885 states and 3145 transitions. [2022-04-15 17:58:34,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:58:34,298 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:58:34,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:58:34,298 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:58:34,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 229 transitions. [2022-04-15 17:58:34,300 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:58:34,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 229 transitions. [2022-04-15 17:58:34,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 229 transitions. [2022-04-15 17:58:34,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 229 edges. 229 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:34,528 INFO L225 Difference]: With dead ends: 1885 [2022-04-15 17:58:34,528 INFO L226 Difference]: Without dead ends: 1275 [2022-04-15 17:58:34,529 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:58:34,529 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 166 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:58:34,530 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 131 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:58:34,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2022-04-15 17:58:34,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1273. [2022-04-15 17:58:34,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:58:34,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1275 states. Second operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:34,661 INFO L74 IsIncluded]: Start isIncluded. First operand 1275 states. Second operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:34,663 INFO L87 Difference]: Start difference. First operand 1275 states. Second operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:34,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:34,730 INFO L93 Difference]: Finished difference Result 1275 states and 2104 transitions. [2022-04-15 17:58:34,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2104 transitions. [2022-04-15 17:58:34,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:34,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:34,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 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 1275 states. [2022-04-15 17:58:34,737 INFO L87 Difference]: Start difference. First operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 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 1275 states. [2022-04-15 17:58:34,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:34,810 INFO L93 Difference]: Finished difference Result 1275 states and 2104 transitions. [2022-04-15 17:58:34,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2104 transitions. [2022-04-15 17:58:34,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:34,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:34,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:58:34,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:58:34,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:34,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 2103 transitions. [2022-04-15 17:58:34,894 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 2103 transitions. Word has length 29 [2022-04-15 17:58:34,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:58:34,894 INFO L478 AbstractCegarLoop]: Abstraction has 1273 states and 2103 transitions. [2022-04-15 17:58:34,894 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:58:34,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1273 states and 2103 transitions. [2022-04-15 17:58:36,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2103 edges. 2103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:36,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 2103 transitions. [2022-04-15 17:58:36,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 17:58:36,911 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:58:36,911 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:58:36,911 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 17:58:36,911 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:58:36,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:58:36,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1409651196, now seen corresponding path program 1 times [2022-04-15 17:58:36,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:36,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1286366869] [2022-04-15 17:58:36,914 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:58:36,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1409651196, now seen corresponding path program 2 times [2022-04-15 17:58:36,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:58:36,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17557190] [2022-04-15 17:58:36,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:58:36,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:58:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:36,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:58:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:36,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {48395#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {48389#true} is VALID [2022-04-15 17:58:36,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {48389#true} assume true; {48389#true} is VALID [2022-04-15 17:58:36,960 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48389#true} {48389#true} #251#return; {48389#true} is VALID [2022-04-15 17:58:36,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {48389#true} call ULTIMATE.init(); {48395#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:58:36,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {48395#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {48389#true} is VALID [2022-04-15 17:58:36,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {48389#true} assume true; {48389#true} is VALID [2022-04-15 17:58:36,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48389#true} {48389#true} #251#return; {48389#true} is VALID [2022-04-15 17:58:36,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {48389#true} call #t~ret18 := main(); {48389#true} is VALID [2022-04-15 17:58:36,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {48389#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;havoc ~cond~0; {48389#true} is VALID [2022-04-15 17:58:36,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {48389#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {48389#true} is VALID [2022-04-15 17:58:36,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {48389#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; {48389#true} is VALID [2022-04-15 17:58:36,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {48389#true} assume !(0 != ~p1~0); {48389#true} is VALID [2022-04-15 17:58:36,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {48389#true} assume !(0 != ~p2~0); {48389#true} is VALID [2022-04-15 17:58:36,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {48389#true} assume !(0 != ~p3~0); {48389#true} is VALID [2022-04-15 17:58:36,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {48389#true} assume !(0 != ~p4~0); {48389#true} is VALID [2022-04-15 17:58:36,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {48389#true} assume !(0 != ~p5~0); {48389#true} is VALID [2022-04-15 17:58:36,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {48389#true} assume 0 != ~p6~0;~lk6~0 := 1; {48394#(= main_~lk6~0 1)} is VALID [2022-04-15 17:58:36,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {48394#(= main_~lk6~0 1)} is VALID [2022-04-15 17:58:36,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {48394#(= main_~lk6~0 1)} is VALID [2022-04-15 17:58:36,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {48394#(= main_~lk6~0 1)} is VALID [2022-04-15 17:58:36,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {48394#(= main_~lk6~0 1)} is VALID [2022-04-15 17:58:36,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {48394#(= main_~lk6~0 1)} is VALID [2022-04-15 17:58:36,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {48394#(= main_~lk6~0 1)} is VALID [2022-04-15 17:58:36,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {48394#(= main_~lk6~0 1)} is VALID [2022-04-15 17:58:36,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {48394#(= main_~lk6~0 1)} is VALID [2022-04-15 17:58:36,967 INFO L290 TraceCheckUtils]: 22: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {48394#(= main_~lk6~0 1)} is VALID [2022-04-15 17:58:36,967 INFO L290 TraceCheckUtils]: 23: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {48394#(= main_~lk6~0 1)} is VALID [2022-04-15 17:58:36,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {48394#(= main_~lk6~0 1)} is VALID [2022-04-15 17:58:36,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {48394#(= main_~lk6~0 1)} is VALID [2022-04-15 17:58:36,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p6~0; {48394#(= main_~lk6~0 1)} is VALID [2022-04-15 17:58:36,968 INFO L290 TraceCheckUtils]: 27: Hoare triple {48394#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {48390#false} is VALID [2022-04-15 17:58:36,969 INFO L290 TraceCheckUtils]: 28: Hoare triple {48390#false} assume !false; {48390#false} is VALID [2022-04-15 17:58:36,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:58:36,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:58:36,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17557190] [2022-04-15 17:58:36,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17557190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:36,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:36,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:36,970 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:58:36,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1286366869] [2022-04-15 17:58:36,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1286366869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:36,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:36,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:36,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850512796] [2022-04-15 17:58:36,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:58:36,972 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:58:36,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:58:36,972 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:58:36,989 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:58:36,990 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:58:36,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:36,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:58:36,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:58:36,990 INFO L87 Difference]: Start difference. First operand 1273 states and 2103 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:58:37,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:37,522 INFO L93 Difference]: Finished difference Result 2317 states and 3897 transitions. [2022-04-15 17:58:37,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:58:37,523 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:58:37,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:58:37,523 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:58:37,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-15 17:58:37,524 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:58:37,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-15 17:58:37,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-15 17:58:37,630 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 17:58:37,878 INFO L225 Difference]: With dead ends: 2317 [2022-04-15 17:58:37,878 INFO L226 Difference]: Without dead ends: 2315 [2022-04-15 17:58:37,879 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:58:37,879 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 184 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 91 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.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:58:37,879 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 91 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:58:37,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2022-04-15 17:58:38,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 1801. [2022-04-15 17:58:38,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:58:38,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2315 states. Second operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:38,048 INFO L74 IsIncluded]: Start isIncluded. First operand 2315 states. Second operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:38,050 INFO L87 Difference]: Start difference. First operand 2315 states. Second operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:38,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:38,257 INFO L93 Difference]: Finished difference Result 2315 states and 3864 transitions. [2022-04-15 17:58:38,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3864 transitions. [2022-04-15 17:58:38,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:38,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:38,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 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 2315 states. [2022-04-15 17:58:38,266 INFO L87 Difference]: Start difference. First operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 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 2315 states. [2022-04-15 17:58:38,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:38,464 INFO L93 Difference]: Finished difference Result 2315 states and 3864 transitions. [2022-04-15 17:58:38,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3864 transitions. [2022-04-15 17:58:38,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:38,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:38,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:58:38,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:58:38,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:38,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2903 transitions. [2022-04-15 17:58:38,621 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2903 transitions. Word has length 29 [2022-04-15 17:58:38,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:58:38,621 INFO L478 AbstractCegarLoop]: Abstraction has 1801 states and 2903 transitions. [2022-04-15 17:58:38,622 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:58:38,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1801 states and 2903 transitions. [2022-04-15 17:58:41,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2903 edges. 2903 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:41,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2903 transitions. [2022-04-15 17:58:41,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 17:58:41,497 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:58:41,497 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:58:41,497 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 17:58:41,497 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:58:41,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:58:41,498 INFO L85 PathProgramCache]: Analyzing trace with hash 388582842, now seen corresponding path program 1 times [2022-04-15 17:58:41,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:41,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1325553307] [2022-04-15 17:58:41,498 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:58:41,498 INFO L85 PathProgramCache]: Analyzing trace with hash 388582842, now seen corresponding path program 2 times [2022-04-15 17:58:41,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:58:41,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664810064] [2022-04-15 17:58:41,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:58:41,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:58:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:41,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:58:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:41,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {61273#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {61267#true} is VALID [2022-04-15 17:58:41,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 17:58:41,571 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61267#true} {61267#true} #251#return; {61267#true} is VALID [2022-04-15 17:58:41,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {61267#true} call ULTIMATE.init(); {61273#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:58:41,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {61273#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {61267#true} is VALID [2022-04-15 17:58:41,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 17:58:41,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61267#true} {61267#true} #251#return; {61267#true} is VALID [2022-04-15 17:58:41,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {61267#true} call #t~ret18 := main(); {61267#true} is VALID [2022-04-15 17:58:41,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {61267#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;havoc ~cond~0; {61267#true} is VALID [2022-04-15 17:58:41,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {61267#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {61267#true} is VALID [2022-04-15 17:58:41,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {61267#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; {61267#true} is VALID [2022-04-15 17:58:41,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {61267#true} assume !(0 != ~p1~0); {61267#true} is VALID [2022-04-15 17:58:41,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {61267#true} assume !(0 != ~p2~0); {61267#true} is VALID [2022-04-15 17:58:41,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {61267#true} assume !(0 != ~p3~0); {61267#true} is VALID [2022-04-15 17:58:41,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {61267#true} assume !(0 != ~p4~0); {61267#true} is VALID [2022-04-15 17:58:41,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {61267#true} assume !(0 != ~p5~0); {61267#true} is VALID [2022-04-15 17:58:41,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {61267#true} assume !(0 != ~p6~0); {61272#(= main_~p6~0 0)} is VALID [2022-04-15 17:58:41,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {61272#(= main_~p6~0 0)} is VALID [2022-04-15 17:58:41,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {61272#(= main_~p6~0 0)} is VALID [2022-04-15 17:58:41,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {61272#(= main_~p6~0 0)} is VALID [2022-04-15 17:58:41,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p10~0); {61272#(= main_~p6~0 0)} is VALID [2022-04-15 17:58:41,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {61272#(= main_~p6~0 0)} is VALID [2022-04-15 17:58:41,575 INFO L290 TraceCheckUtils]: 19: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {61272#(= main_~p6~0 0)} is VALID [2022-04-15 17:58:41,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {61272#(= main_~p6~0 0)} is VALID [2022-04-15 17:58:41,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p1~0); {61272#(= main_~p6~0 0)} is VALID [2022-04-15 17:58:41,576 INFO L290 TraceCheckUtils]: 22: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p2~0); {61272#(= main_~p6~0 0)} is VALID [2022-04-15 17:58:41,576 INFO L290 TraceCheckUtils]: 23: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p3~0); {61272#(= main_~p6~0 0)} is VALID [2022-04-15 17:58:41,577 INFO L290 TraceCheckUtils]: 24: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p4~0); {61272#(= main_~p6~0 0)} is VALID [2022-04-15 17:58:41,577 INFO L290 TraceCheckUtils]: 25: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p5~0); {61272#(= main_~p6~0 0)} is VALID [2022-04-15 17:58:41,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p6~0; {61268#false} is VALID [2022-04-15 17:58:41,577 INFO L290 TraceCheckUtils]: 27: Hoare triple {61268#false} assume 1 != ~lk6~0; {61268#false} is VALID [2022-04-15 17:58:41,577 INFO L290 TraceCheckUtils]: 28: Hoare triple {61268#false} assume !false; {61268#false} is VALID [2022-04-15 17:58:41,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:58:41,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:58:41,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664810064] [2022-04-15 17:58:41,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664810064] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:41,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:41,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:41,578 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:58:41,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1325553307] [2022-04-15 17:58:41,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1325553307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:41,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:41,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:41,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158336867] [2022-04-15 17:58:41,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:58:41,579 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:58:41,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:58:41,579 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:58:41,598 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:58:41,598 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:58:41,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:41,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:58:41,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:58:41,598 INFO L87 Difference]: Start difference. First operand 1801 states and 2903 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:58:42,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:42,827 INFO L93 Difference]: Finished difference Result 4237 states and 6873 transitions. [2022-04-15 17:58:42,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:58:42,827 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:58:42,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:58:42,828 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:58:42,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 231 transitions. [2022-04-15 17:58:42,830 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:58:42,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 231 transitions. [2022-04-15 17:58:42,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 231 transitions. [2022-04-15 17:58:42,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 231 edges. 231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:43,289 INFO L225 Difference]: With dead ends: 4237 [2022-04-15 17:58:43,289 INFO L226 Difference]: Without dead ends: 2475 [2022-04-15 17:58:43,292 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 17:58:43,293 INFO L913 BasicCegarLoop]: 122 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:58:43,293 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 129 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:58:43,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2022-04-15 17:58:43,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2473. [2022-04-15 17:58:43,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:58:43,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2475 states. Second operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:43,541 INFO L74 IsIncluded]: Start isIncluded. First operand 2475 states. Second operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:43,544 INFO L87 Difference]: Start difference. First operand 2475 states. Second operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:43,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:43,702 INFO L93 Difference]: Finished difference Result 2475 states and 3976 transitions. [2022-04-15 17:58:43,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3976 transitions. [2022-04-15 17:58:43,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:43,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:43,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 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 2475 states. [2022-04-15 17:58:43,711 INFO L87 Difference]: Start difference. First operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 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 2475 states. [2022-04-15 17:58:43,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:43,883 INFO L93 Difference]: Finished difference Result 2475 states and 3976 transitions. [2022-04-15 17:58:43,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3976 transitions. [2022-04-15 17:58:43,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:43,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:43,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:58:43,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:58:43,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:44,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 3975 transitions. [2022-04-15 17:58:44,169 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 3975 transitions. Word has length 29 [2022-04-15 17:58:44,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:58:44,170 INFO L478 AbstractCegarLoop]: Abstraction has 2473 states and 3975 transitions. [2022-04-15 17:58:44,170 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:58:44,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2473 states and 3975 transitions. [2022-04-15 17:58:48,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3975 edges. 3975 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:48,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3975 transitions. [2022-04-15 17:58:48,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 17:58:48,221 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:58:48,221 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:58:48,221 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 17:58:48,221 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:58:48,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:58:48,222 INFO L85 PathProgramCache]: Analyzing trace with hash 749728232, now seen corresponding path program 1 times [2022-04-15 17:58:48,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:48,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [680412922] [2022-04-15 17:58:48,222 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:58:48,222 INFO L85 PathProgramCache]: Analyzing trace with hash 749728232, now seen corresponding path program 2 times [2022-04-15 17:58:48,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:58:48,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845951573] [2022-04-15 17:58:48,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:58:48,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:58:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:48,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:58:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:48,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {79655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {79649#true} is VALID [2022-04-15 17:58:48,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {79649#true} assume true; {79649#true} is VALID [2022-04-15 17:58:48,269 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {79649#true} {79649#true} #251#return; {79649#true} is VALID [2022-04-15 17:58:48,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {79649#true} call ULTIMATE.init(); {79655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:58:48,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {79655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {79649#true} is VALID [2022-04-15 17:58:48,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {79649#true} assume true; {79649#true} is VALID [2022-04-15 17:58:48,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79649#true} {79649#true} #251#return; {79649#true} is VALID [2022-04-15 17:58:48,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {79649#true} call #t~ret18 := main(); {79649#true} is VALID [2022-04-15 17:58:48,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {79649#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;havoc ~cond~0; {79649#true} is VALID [2022-04-15 17:58:48,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {79649#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {79649#true} is VALID [2022-04-15 17:58:48,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {79649#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; {79649#true} is VALID [2022-04-15 17:58:48,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {79649#true} assume !(0 != ~p1~0); {79649#true} is VALID [2022-04-15 17:58:48,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {79649#true} assume !(0 != ~p2~0); {79649#true} is VALID [2022-04-15 17:58:48,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {79649#true} assume !(0 != ~p3~0); {79649#true} is VALID [2022-04-15 17:58:48,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {79649#true} assume !(0 != ~p4~0); {79649#true} is VALID [2022-04-15 17:58:48,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {79649#true} assume !(0 != ~p5~0); {79649#true} is VALID [2022-04-15 17:58:48,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {79649#true} assume 0 != ~p6~0;~lk6~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:58:48,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:58:48,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:58:48,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:58:48,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {79654#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:58:48,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:58:48,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:58:48,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:58:48,274 INFO L290 TraceCheckUtils]: 21: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {79654#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:58:48,274 INFO L290 TraceCheckUtils]: 22: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {79654#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:58:48,275 INFO L290 TraceCheckUtils]: 23: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {79654#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:58:48,276 INFO L290 TraceCheckUtils]: 24: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {79654#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:58:48,276 INFO L290 TraceCheckUtils]: 25: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {79654#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:58:48,277 INFO L290 TraceCheckUtils]: 26: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {79650#false} is VALID [2022-04-15 17:58:48,277 INFO L290 TraceCheckUtils]: 27: Hoare triple {79650#false} assume 0 != ~p7~0; {79650#false} is VALID [2022-04-15 17:58:48,277 INFO L290 TraceCheckUtils]: 28: Hoare triple {79650#false} assume 1 != ~lk7~0; {79650#false} is VALID [2022-04-15 17:58:48,277 INFO L290 TraceCheckUtils]: 29: Hoare triple {79650#false} assume !false; {79650#false} is VALID [2022-04-15 17:58:48,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:58:48,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:58:48,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845951573] [2022-04-15 17:58:48,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845951573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:48,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:48,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:48,278 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:58:48,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [680412922] [2022-04-15 17:58:48,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [680412922] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:48,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:48,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:48,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356337986] [2022-04-15 17:58:48,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:58:48,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 17:58:48,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:58:48,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:48,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:48,297 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:58:48,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:48,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:58:48,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:58:48,298 INFO L87 Difference]: Start difference. First operand 2473 states and 3975 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:49,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:49,254 INFO L93 Difference]: Finished difference Result 3709 states and 5945 transitions. [2022-04-15 17:58:49,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:58:49,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 17:58:49,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:58:49,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:49,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2022-04-15 17:58:49,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:49,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2022-04-15 17:58:49,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 226 transitions. [2022-04-15 17:58:49,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:49,707 INFO L225 Difference]: With dead ends: 3709 [2022-04-15 17:58:49,707 INFO L226 Difference]: Without dead ends: 2507 [2022-04-15 17:58:49,709 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:58:49,710 INFO L913 BasicCegarLoop]: 121 mSDtfsCounter, 165 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:58:49,710 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 128 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:58:49,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-04-15 17:58:49,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2505. [2022-04-15 17:58:49,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:58:49,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2507 states. Second operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:49,913 INFO L74 IsIncluded]: Start isIncluded. First operand 2507 states. Second operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:49,915 INFO L87 Difference]: Start difference. First operand 2507 states. Second operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:50,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:50,091 INFO L93 Difference]: Finished difference Result 2507 states and 3976 transitions. [2022-04-15 17:58:50,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3976 transitions. [2022-04-15 17:58:50,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:50,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:50,096 INFO L74 IsIncluded]: Start isIncluded. First operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 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 17:58:50,098 INFO L87 Difference]: Start difference. First operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 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 17:58:50,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:50,261 INFO L93 Difference]: Finished difference Result 2507 states and 3976 transitions. [2022-04-15 17:58:50,261 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3976 transitions. [2022-04-15 17:58:50,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:50,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:50,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:58:50,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:58:50,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:50,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 3975 transitions. [2022-04-15 17:58:50,549 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 3975 transitions. Word has length 30 [2022-04-15 17:58:50,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:58:50,550 INFO L478 AbstractCegarLoop]: Abstraction has 2505 states and 3975 transitions. [2022-04-15 17:58:50,550 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:50,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2505 states and 3975 transitions. [2022-04-15 17:58:54,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3975 edges. 3975 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:54,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 3975 transitions. [2022-04-15 17:58:54,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 17:58:54,628 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:58:54,628 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:58:54,628 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 17:58:54,628 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:58:54,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:58:54,629 INFO L85 PathProgramCache]: Analyzing trace with hash -838619670, now seen corresponding path program 1 times [2022-04-15 17:58:54,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:54,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1328581590] [2022-04-15 17:58:54,629 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:58:54,629 INFO L85 PathProgramCache]: Analyzing trace with hash -838619670, now seen corresponding path program 2 times [2022-04-15 17:58:54,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:58:54,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665992910] [2022-04-15 17:58:54,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:58:54,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:58:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:54,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:58:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:54,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {97109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {97103#true} is VALID [2022-04-15 17:58:54,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {97103#true} assume true; {97103#true} is VALID [2022-04-15 17:58:54,665 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {97103#true} {97103#true} #251#return; {97103#true} is VALID [2022-04-15 17:58:54,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {97103#true} call ULTIMATE.init(); {97109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:58:54,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {97109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {97103#true} is VALID [2022-04-15 17:58:54,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {97103#true} assume true; {97103#true} is VALID [2022-04-15 17:58:54,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97103#true} {97103#true} #251#return; {97103#true} is VALID [2022-04-15 17:58:54,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {97103#true} call #t~ret18 := main(); {97103#true} is VALID [2022-04-15 17:58:54,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {97103#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;havoc ~cond~0; {97103#true} is VALID [2022-04-15 17:58:54,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {97103#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {97103#true} is VALID [2022-04-15 17:58:54,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {97103#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; {97103#true} is VALID [2022-04-15 17:58:54,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {97103#true} assume !(0 != ~p1~0); {97103#true} is VALID [2022-04-15 17:58:54,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {97103#true} assume !(0 != ~p2~0); {97103#true} is VALID [2022-04-15 17:58:54,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {97103#true} assume !(0 != ~p3~0); {97103#true} is VALID [2022-04-15 17:58:54,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {97103#true} assume !(0 != ~p4~0); {97103#true} is VALID [2022-04-15 17:58:54,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {97103#true} assume !(0 != ~p5~0); {97103#true} is VALID [2022-04-15 17:58:54,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {97103#true} assume !(0 != ~p6~0); {97103#true} is VALID [2022-04-15 17:58:54,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {97103#true} assume 0 != ~p7~0;~lk7~0 := 1; {97108#(= main_~lk7~0 1)} is VALID [2022-04-15 17:58:54,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {97108#(= main_~lk7~0 1)} is VALID [2022-04-15 17:58:54,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {97108#(= main_~lk7~0 1)} is VALID [2022-04-15 17:58:54,668 INFO L290 TraceCheckUtils]: 17: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {97108#(= main_~lk7~0 1)} is VALID [2022-04-15 17:58:54,669 INFO L290 TraceCheckUtils]: 18: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {97108#(= main_~lk7~0 1)} is VALID [2022-04-15 17:58:54,669 INFO L290 TraceCheckUtils]: 19: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {97108#(= main_~lk7~0 1)} is VALID [2022-04-15 17:58:54,669 INFO L290 TraceCheckUtils]: 20: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {97108#(= main_~lk7~0 1)} is VALID [2022-04-15 17:58:54,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {97108#(= main_~lk7~0 1)} is VALID [2022-04-15 17:58:54,670 INFO L290 TraceCheckUtils]: 22: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {97108#(= main_~lk7~0 1)} is VALID [2022-04-15 17:58:54,670 INFO L290 TraceCheckUtils]: 23: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {97108#(= main_~lk7~0 1)} is VALID [2022-04-15 17:58:54,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {97108#(= main_~lk7~0 1)} is VALID [2022-04-15 17:58:54,671 INFO L290 TraceCheckUtils]: 25: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {97108#(= main_~lk7~0 1)} is VALID [2022-04-15 17:58:54,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {97108#(= main_~lk7~0 1)} is VALID [2022-04-15 17:58:54,672 INFO L290 TraceCheckUtils]: 27: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p7~0; {97108#(= main_~lk7~0 1)} is VALID [2022-04-15 17:58:54,672 INFO L290 TraceCheckUtils]: 28: Hoare triple {97108#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {97104#false} is VALID [2022-04-15 17:58:54,672 INFO L290 TraceCheckUtils]: 29: Hoare triple {97104#false} assume !false; {97104#false} is VALID [2022-04-15 17:58:54,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:58:54,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:58:54,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665992910] [2022-04-15 17:58:54,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665992910] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:54,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:54,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:54,673 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:58:54,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1328581590] [2022-04-15 17:58:54,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1328581590] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:54,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:54,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:54,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863795337] [2022-04-15 17:58:54,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:58:54,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 17:58:54,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:58:54,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:54,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:54,694 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:58:54,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:54,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:58:54,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:58:54,695 INFO L87 Difference]: Start difference. First operand 2505 states and 3975 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:56,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:56,107 INFO L93 Difference]: Finished difference Result 4493 states and 7273 transitions. [2022-04-15 17:58:56,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:58:56,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 17:58:56,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:58:56,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:56,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2022-04-15 17:58:56,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:56,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2022-04-15 17:58:56,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 143 transitions. [2022-04-15 17:58:56,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:57,141 INFO L225 Difference]: With dead ends: 4493 [2022-04-15 17:58:57,141 INFO L226 Difference]: Without dead ends: 4491 [2022-04-15 17:58:57,142 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:58:57,142 INFO L913 BasicCegarLoop]: 83 mSDtfsCounter, 177 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:58:57,143 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 90 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:58:57,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states. [2022-04-15 17:58:57,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 3593. [2022-04-15 17:58:57,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:58:57,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4491 states. Second operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:57,454 INFO L74 IsIncluded]: Start isIncluded. First operand 4491 states. Second operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:57,459 INFO L87 Difference]: Start difference. First operand 4491 states. Second operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:57,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:57,997 INFO L93 Difference]: Finished difference Result 4491 states and 7208 transitions. [2022-04-15 17:58:57,997 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 7208 transitions. [2022-04-15 17:58:58,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:58,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:58,007 INFO L74 IsIncluded]: Start isIncluded. First operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 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 4491 states. [2022-04-15 17:58:58,010 INFO L87 Difference]: Start difference. First operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 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 4491 states. [2022-04-15 17:58:58,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:58,557 INFO L93 Difference]: Finished difference Result 4491 states and 7208 transitions. [2022-04-15 17:58:58,557 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 7208 transitions. [2022-04-15 17:58:58,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:58,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:58,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:58:58,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:58:58,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:59,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3593 states to 3593 states and 5543 transitions. [2022-04-15 17:58:59,186 INFO L78 Accepts]: Start accepts. Automaton has 3593 states and 5543 transitions. Word has length 30 [2022-04-15 17:58:59,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:58:59,186 INFO L478 AbstractCegarLoop]: Abstraction has 3593 states and 5543 transitions. [2022-04-15 17:58:59,186 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:59,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3593 states and 5543 transitions. [2022-04-15 17:59:04,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5543 edges. 5543 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:59:04,802 INFO L276 IsEmpty]: Start isEmpty. Operand 3593 states and 5543 transitions. [2022-04-15 17:59:04,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 17:59:04,805 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:59:04,805 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:59:04,805 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 17:59:04,805 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:59:04,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:59:04,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1859688024, now seen corresponding path program 1 times [2022-04-15 17:59:04,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:04,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1718994448] [2022-04-15 17:59:04,806 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:59:04,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1859688024, now seen corresponding path program 2 times [2022-04-15 17:59:04,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:59:04,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787900394] [2022-04-15 17:59:04,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:59:04,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:59:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:04,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:59:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:04,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {122275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {122269#true} is VALID [2022-04-15 17:59:04,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {122269#true} assume true; {122269#true} is VALID [2022-04-15 17:59:04,861 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {122269#true} {122269#true} #251#return; {122269#true} is VALID [2022-04-15 17:59:04,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {122269#true} call ULTIMATE.init(); {122275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:59:04,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {122275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {122269#true} is VALID [2022-04-15 17:59:04,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {122269#true} assume true; {122269#true} is VALID [2022-04-15 17:59:04,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122269#true} {122269#true} #251#return; {122269#true} is VALID [2022-04-15 17:59:04,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {122269#true} call #t~ret18 := main(); {122269#true} is VALID [2022-04-15 17:59:04,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {122269#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;havoc ~cond~0; {122269#true} is VALID [2022-04-15 17:59:04,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {122269#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {122269#true} is VALID [2022-04-15 17:59:04,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {122269#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; {122269#true} is VALID [2022-04-15 17:59:04,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {122269#true} assume !(0 != ~p1~0); {122269#true} is VALID [2022-04-15 17:59:04,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {122269#true} assume !(0 != ~p2~0); {122269#true} is VALID [2022-04-15 17:59:04,862 INFO L290 TraceCheckUtils]: 10: Hoare triple {122269#true} assume !(0 != ~p3~0); {122269#true} is VALID [2022-04-15 17:59:04,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {122269#true} assume !(0 != ~p4~0); {122269#true} is VALID [2022-04-15 17:59:04,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {122269#true} assume !(0 != ~p5~0); {122269#true} is VALID [2022-04-15 17:59:04,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {122269#true} assume !(0 != ~p6~0); {122269#true} is VALID [2022-04-15 17:59:04,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {122269#true} assume !(0 != ~p7~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-15 17:59:04,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {122274#(= main_~p7~0 0)} is VALID [2022-04-15 17:59:04,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {122274#(= main_~p7~0 0)} is VALID [2022-04-15 17:59:04,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p10~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-15 17:59:04,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {122274#(= main_~p7~0 0)} is VALID [2022-04-15 17:59:04,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {122274#(= main_~p7~0 0)} is VALID [2022-04-15 17:59:04,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {122274#(= main_~p7~0 0)} is VALID [2022-04-15 17:59:04,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p1~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-15 17:59:04,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p2~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-15 17:59:04,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p3~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-15 17:59:04,866 INFO L290 TraceCheckUtils]: 24: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p4~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-15 17:59:04,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p5~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-15 17:59:04,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p6~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-15 17:59:04,867 INFO L290 TraceCheckUtils]: 27: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p7~0; {122270#false} is VALID [2022-04-15 17:59:04,868 INFO L290 TraceCheckUtils]: 28: Hoare triple {122270#false} assume 1 != ~lk7~0; {122270#false} is VALID [2022-04-15 17:59:04,868 INFO L290 TraceCheckUtils]: 29: Hoare triple {122270#false} assume !false; {122270#false} is VALID [2022-04-15 17:59:04,868 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:04,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:59:04,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787900394] [2022-04-15 17:59:04,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787900394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:04,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:04,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:04,869 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:59:04,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1718994448] [2022-04-15 17:59:04,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1718994448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:04,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:04,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:04,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112290706] [2022-04-15 17:59:04,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:59:04,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 17:59:04,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:59:04,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:59:04,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:59:04,889 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:59:04,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:04,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:59:04,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:59:04,890 INFO L87 Difference]: Start difference. First operand 3593 states and 5543 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:59:08,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:08,614 INFO L93 Difference]: Finished difference Result 8397 states and 13033 transitions. [2022-04-15 17:59:08,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:59:08,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 17:59:08,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:59:08,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:59:08,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2022-04-15 17:59:08,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:59:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2022-04-15 17:59:08,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 228 transitions. [2022-04-15 17:59:08,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:59:09,866 INFO L225 Difference]: With dead ends: 8397 [2022-04-15 17:59:09,866 INFO L226 Difference]: Without dead ends: 4875 [2022-04-15 17:59:09,871 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 17:59:09,872 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:59:09,872 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 131 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:59:09,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2022-04-15 17:59:10,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 4873. [2022-04-15 17:59:10,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:59:10,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4875 states. Second operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:59:10,253 INFO L74 IsIncluded]: Start isIncluded. First operand 4875 states. Second operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:59:10,257 INFO L87 Difference]: Start difference. First operand 4875 states. Second operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:59:10,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:10,883 INFO L93 Difference]: Finished difference Result 4875 states and 7496 transitions. [2022-04-15 17:59:10,883 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 7496 transitions. [2022-04-15 17:59:10,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:10,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:10,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4875 states. [2022-04-15 17:59:10,898 INFO L87 Difference]: Start difference. First operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4875 states. [2022-04-15 17:59:11,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:11,570 INFO L93 Difference]: Finished difference Result 4875 states and 7496 transitions. [2022-04-15 17:59:11,570 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 7496 transitions. [2022-04-15 17:59:11,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:11,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:11,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:59:11,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:59:11,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:59:12,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4873 states to 4873 states and 7495 transitions. [2022-04-15 17:59:12,622 INFO L78 Accepts]: Start accepts. Automaton has 4873 states and 7495 transitions. Word has length 30 [2022-04-15 17:59:12,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:59:12,622 INFO L478 AbstractCegarLoop]: Abstraction has 4873 states and 7495 transitions. [2022-04-15 17:59:12,622 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:59:12,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4873 states and 7495 transitions. [2022-04-15 17:59:20,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7495 edges. 7495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:59:20,563 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 7495 transitions. [2022-04-15 17:59:20,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 17:59:20,566 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:59:20,566 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 17:59:20,566 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 17:59:20,566 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:59:20,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:59:20,566 INFO L85 PathProgramCache]: Analyzing trace with hash -227191537, now seen corresponding path program 1 times [2022-04-15 17:59:20,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:20,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1967694002] [2022-04-15 17:59:20,567 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:59:20,567 INFO L85 PathProgramCache]: Analyzing trace with hash -227191537, now seen corresponding path program 2 times [2022-04-15 17:59:20,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:59:20,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726817669] [2022-04-15 17:59:20,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:59:20,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:59:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:20,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:59:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:20,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {158577#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {158571#true} is VALID [2022-04-15 17:59:20,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {158571#true} assume true; {158571#true} is VALID [2022-04-15 17:59:20,599 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {158571#true} {158571#true} #251#return; {158571#true} is VALID [2022-04-15 17:59:20,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {158571#true} call ULTIMATE.init(); {158577#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:59:20,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {158577#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {158571#true} is VALID [2022-04-15 17:59:20,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {158571#true} assume true; {158571#true} is VALID [2022-04-15 17:59:20,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158571#true} {158571#true} #251#return; {158571#true} is VALID [2022-04-15 17:59:20,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {158571#true} call #t~ret18 := main(); {158571#true} is VALID [2022-04-15 17:59:20,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {158571#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;havoc ~cond~0; {158571#true} is VALID [2022-04-15 17:59:20,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {158571#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {158571#true} is VALID [2022-04-15 17:59:20,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {158571#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; {158571#true} is VALID [2022-04-15 17:59:20,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {158571#true} assume !(0 != ~p1~0); {158571#true} is VALID [2022-04-15 17:59:20,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {158571#true} assume !(0 != ~p2~0); {158571#true} is VALID [2022-04-15 17:59:20,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {158571#true} assume !(0 != ~p3~0); {158571#true} is VALID [2022-04-15 17:59:20,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {158571#true} assume !(0 != ~p4~0); {158571#true} is VALID [2022-04-15 17:59:20,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {158571#true} assume !(0 != ~p5~0); {158571#true} is VALID [2022-04-15 17:59:20,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {158571#true} assume !(0 != ~p6~0); {158571#true} is VALID [2022-04-15 17:59:20,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {158571#true} assume 0 != ~p7~0;~lk7~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:59:20,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {158576#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:59:20,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {158576#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:59:20,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {158576#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:59:20,603 INFO L290 TraceCheckUtils]: 18: Hoare triple {158576#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:59:20,603 INFO L290 TraceCheckUtils]: 19: Hoare triple {158576#(not (= main_~p7~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:59:20,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {158576#(not (= main_~p7~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:59:20,604 INFO L290 TraceCheckUtils]: 21: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {158576#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:59:20,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {158576#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:59:20,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {158576#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:59:20,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {158576#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:59:20,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {158576#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:59:20,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {158576#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:59:20,606 INFO L290 TraceCheckUtils]: 27: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {158572#false} is VALID [2022-04-15 17:59:20,606 INFO L290 TraceCheckUtils]: 28: Hoare triple {158572#false} assume 0 != ~p8~0; {158572#false} is VALID [2022-04-15 17:59:20,606 INFO L290 TraceCheckUtils]: 29: Hoare triple {158572#false} assume 1 != ~lk8~0; {158572#false} is VALID [2022-04-15 17:59:20,606 INFO L290 TraceCheckUtils]: 30: Hoare triple {158572#false} assume !false; {158572#false} is VALID [2022-04-15 17:59:20,606 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:20,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:59:20,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726817669] [2022-04-15 17:59:20,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726817669] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:20,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:20,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:20,607 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:59:20,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1967694002] [2022-04-15 17:59:20,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1967694002] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:20,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:20,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:20,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434146250] [2022-04-15 17:59:20,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:59:20,608 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 17:59:20,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:59:20,608 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 17:59:20,627 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 17:59:20,627 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:59:20,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:20,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:59:20,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:59:20,627 INFO L87 Difference]: Start difference. First operand 4873 states and 7495 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 17:59:23,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:23,563 INFO L93 Difference]: Finished difference Result 7309 states and 11209 transitions. [2022-04-15 17:59:23,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:59:23,563 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 17:59:23,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:59:23,563 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 17:59:23,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2022-04-15 17:59:23,565 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 17:59:23,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2022-04-15 17:59:23,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 223 transitions. [2022-04-15 17:59:23,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:59:24,824 INFO L225 Difference]: With dead ends: 7309 [2022-04-15 17:59:24,824 INFO L226 Difference]: Without dead ends: 4939 [2022-04-15 17:59:24,827 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:24,828 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 164 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:59:24,828 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 125 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:59:24,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2022-04-15 17:59:25,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4937. [2022-04-15 17:59:25,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:59:25,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4939 states. Second operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:59:25,209 INFO L74 IsIncluded]: Start isIncluded. First operand 4939 states. Second operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:59:25,212 INFO L87 Difference]: Start difference. First operand 4939 states. Second operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:59:25,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:25,848 INFO L93 Difference]: Finished difference Result 4939 states and 7496 transitions. [2022-04-15 17:59:25,848 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 7496 transitions. [2022-04-15 17:59:25,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:25,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:25,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4939 states. [2022-04-15 17:59:25,862 INFO L87 Difference]: Start difference. First operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4939 states. [2022-04-15 17:59:26,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:26,554 INFO L93 Difference]: Finished difference Result 4939 states and 7496 transitions. [2022-04-15 17:59:26,555 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 7496 transitions. [2022-04-15 17:59:26,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:26,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:26,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:59:26,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:59:26,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:59:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4937 states to 4937 states and 7495 transitions. [2022-04-15 17:59:27,685 INFO L78 Accepts]: Start accepts. Automaton has 4937 states and 7495 transitions. Word has length 31 [2022-04-15 17:59:27,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:59:27,685 INFO L478 AbstractCegarLoop]: Abstraction has 4937 states and 7495 transitions. [2022-04-15 17:59:27,685 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 17:59:27,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4937 states and 7495 transitions. [2022-04-15 17:59:35,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7495 edges. 7495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:59:35,673 INFO L276 IsEmpty]: Start isEmpty. Operand 4937 states and 7495 transitions. [2022-04-15 17:59:35,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 17:59:35,676 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:59:35,676 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 17:59:35,676 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 17:59:35,676 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:59:35,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:59:35,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1815539439, now seen corresponding path program 1 times [2022-04-15 17:59:35,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:35,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [363991020] [2022-04-15 17:59:35,677 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:59:35,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1815539439, now seen corresponding path program 2 times [2022-04-15 17:59:35,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:59:35,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929776053] [2022-04-15 17:59:35,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:59:35,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:59:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:35,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:59:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:59:35,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {192959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {192953#true} is VALID [2022-04-15 17:59:35,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {192953#true} assume true; {192953#true} is VALID [2022-04-15 17:59:35,720 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {192953#true} {192953#true} #251#return; {192953#true} is VALID [2022-04-15 17:59:35,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {192953#true} call ULTIMATE.init(); {192959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:59:35,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {192959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {192953#true} is VALID [2022-04-15 17:59:35,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {192953#true} assume true; {192953#true} is VALID [2022-04-15 17:59:35,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {192953#true} {192953#true} #251#return; {192953#true} is VALID [2022-04-15 17:59:35,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {192953#true} call #t~ret18 := main(); {192953#true} is VALID [2022-04-15 17:59:35,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {192953#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;havoc ~cond~0; {192953#true} is VALID [2022-04-15 17:59:35,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {192953#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {192953#true} is VALID [2022-04-15 17:59:35,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {192953#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; {192953#true} is VALID [2022-04-15 17:59:35,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {192953#true} assume !(0 != ~p1~0); {192953#true} is VALID [2022-04-15 17:59:35,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {192953#true} assume !(0 != ~p2~0); {192953#true} is VALID [2022-04-15 17:59:35,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {192953#true} assume !(0 != ~p3~0); {192953#true} is VALID [2022-04-15 17:59:35,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {192953#true} assume !(0 != ~p4~0); {192953#true} is VALID [2022-04-15 17:59:35,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {192953#true} assume !(0 != ~p5~0); {192953#true} is VALID [2022-04-15 17:59:35,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {192953#true} assume !(0 != ~p6~0); {192953#true} is VALID [2022-04-15 17:59:35,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {192953#true} assume !(0 != ~p7~0); {192953#true} is VALID [2022-04-15 17:59:35,723 INFO L290 TraceCheckUtils]: 15: Hoare triple {192953#true} assume 0 != ~p8~0;~lk8~0 := 1; {192958#(= main_~lk8~0 1)} is VALID [2022-04-15 17:59:35,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {192958#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {192958#(= main_~lk8~0 1)} is VALID [2022-04-15 17:59:35,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-15 17:59:35,723 INFO L290 TraceCheckUtils]: 18: Hoare triple {192958#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {192958#(= main_~lk8~0 1)} is VALID [2022-04-15 17:59:35,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {192958#(= main_~lk8~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {192958#(= main_~lk8~0 1)} is VALID [2022-04-15 17:59:35,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {192958#(= main_~lk8~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {192958#(= main_~lk8~0 1)} is VALID [2022-04-15 17:59:35,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-15 17:59:35,725 INFO L290 TraceCheckUtils]: 22: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-15 17:59:35,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-15 17:59:35,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-15 17:59:35,726 INFO L290 TraceCheckUtils]: 25: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-15 17:59:35,726 INFO L290 TraceCheckUtils]: 26: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-15 17:59:35,726 INFO L290 TraceCheckUtils]: 27: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-15 17:59:35,727 INFO L290 TraceCheckUtils]: 28: Hoare triple {192958#(= main_~lk8~0 1)} assume 0 != ~p8~0; {192958#(= main_~lk8~0 1)} is VALID [2022-04-15 17:59:35,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {192958#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {192954#false} is VALID [2022-04-15 17:59:35,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {192954#false} assume !false; {192954#false} is VALID [2022-04-15 17:59:35,727 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:35,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:59:35,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929776053] [2022-04-15 17:59:35,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929776053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:35,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:35,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:35,728 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:59:35,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [363991020] [2022-04-15 17:59:35,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [363991020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:59:35,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:59:35,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:59:35,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798320774] [2022-04-15 17:59:35,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:59:35,729 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 17:59:35,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:59:35,729 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 17:59:35,747 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 17:59:35,747 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:59:35,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:59:35,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:59:35,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:59:35,748 INFO L87 Difference]: Start difference. First operand 4937 states and 7495 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 17:59:39,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:39,955 INFO L93 Difference]: Finished difference Result 8717 states and 13513 transitions. [2022-04-15 17:59:39,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:59:39,955 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 17:59:39,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:59:39,955 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 17:59:39,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-15 17:59:39,956 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 17:59:39,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-15 17:59:39,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-15 17:59:40,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:59:43,809 INFO L225 Difference]: With dead ends: 8717 [2022-04-15 17:59:43,809 INFO L226 Difference]: Without dead ends: 8715 [2022-04-15 17:59:43,811 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:43,811 INFO L913 BasicCegarLoop]: 82 mSDtfsCounter, 170 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:59:43,812 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 89 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:59:43,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8715 states. [2022-04-15 17:59:44,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8715 to 7177. [2022-04-15 17:59:44,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:59:44,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8715 states. Second operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states have call 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:44,429 INFO L74 IsIncluded]: Start isIncluded. First operand 8715 states. Second operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states have call 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:44,435 INFO L87 Difference]: Start difference. First operand 8715 states. Second operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states have call 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,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:46,631 INFO L93 Difference]: Finished difference Result 8715 states and 13384 transitions. [2022-04-15 17:59:46,631 INFO L276 IsEmpty]: Start isEmpty. Operand 8715 states and 13384 transitions. [2022-04-15 17:59:46,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:46,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:46,647 INFO L74 IsIncluded]: Start isIncluded. First operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 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 8715 states. [2022-04-15 17:59:46,656 INFO L87 Difference]: Start difference. First operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 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 8715 states. [2022-04-15 17:59:48,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:48,739 INFO L93 Difference]: Finished difference Result 8715 states and 13384 transitions. [2022-04-15 17:59:48,739 INFO L276 IsEmpty]: Start isEmpty. Operand 8715 states and 13384 transitions. [2022-04-15 17:59:48,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:59:48,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:59:48,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:59:48,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:59:48,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states have call 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,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7177 states to 7177 states and 10567 transitions. [2022-04-15 17:59:51,137 INFO L78 Accepts]: Start accepts. Automaton has 7177 states and 10567 transitions. Word has length 31 [2022-04-15 17:59:51,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:59:51,137 INFO L478 AbstractCegarLoop]: Abstraction has 7177 states and 10567 transitions. [2022-04-15 17:59:51,137 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 17:59:51,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7177 states and 10567 transitions. [2022-04-15 18:00:02,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10567 edges. 10567 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:00:02,541 INFO L276 IsEmpty]: Start isEmpty. Operand 7177 states and 10567 transitions. [2022-04-15 18:00:02,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 18:00:02,545 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:00:02,545 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:02,545 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 18:00:02,546 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:00:02,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:00:02,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1458359503, now seen corresponding path program 1 times [2022-04-15 18:00:02,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:00:02,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [119939882] [2022-04-15 18:00:02,546 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:00:02,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1458359503, now seen corresponding path program 2 times [2022-04-15 18:00:02,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:00:02,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436269253] [2022-04-15 18:00:02,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:00:02,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:00:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:00:02,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:00:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:00:02,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {242189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {242183#true} is VALID [2022-04-15 18:00:02,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {242183#true} assume true; {242183#true} is VALID [2022-04-15 18:00:02,582 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {242183#true} {242183#true} #251#return; {242183#true} is VALID [2022-04-15 18:00:02,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {242183#true} call ULTIMATE.init(); {242189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:00:02,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {242189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {242183#true} is VALID [2022-04-15 18:00:02,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {242183#true} assume true; {242183#true} is VALID [2022-04-15 18:00:02,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {242183#true} {242183#true} #251#return; {242183#true} is VALID [2022-04-15 18:00:02,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {242183#true} call #t~ret18 := main(); {242183#true} is VALID [2022-04-15 18:00:02,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {242183#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;havoc ~cond~0; {242183#true} is VALID [2022-04-15 18:00:02,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {242183#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {242183#true} is VALID [2022-04-15 18:00:02,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {242183#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; {242183#true} is VALID [2022-04-15 18:00:02,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {242183#true} assume !(0 != ~p1~0); {242183#true} is VALID [2022-04-15 18:00:02,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {242183#true} assume !(0 != ~p2~0); {242183#true} is VALID [2022-04-15 18:00:02,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {242183#true} assume !(0 != ~p3~0); {242183#true} is VALID [2022-04-15 18:00:02,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {242183#true} assume !(0 != ~p4~0); {242183#true} is VALID [2022-04-15 18:00:02,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {242183#true} assume !(0 != ~p5~0); {242183#true} is VALID [2022-04-15 18:00:02,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {242183#true} assume !(0 != ~p6~0); {242183#true} is VALID [2022-04-15 18:00:02,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {242183#true} assume !(0 != ~p7~0); {242183#true} is VALID [2022-04-15 18:00:02,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {242183#true} assume !(0 != ~p8~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-15 18:00:02,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {242188#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {242188#(= main_~p8~0 0)} is VALID [2022-04-15 18:00:02,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p10~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-15 18:00:02,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {242188#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {242188#(= main_~p8~0 0)} is VALID [2022-04-15 18:00:02,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {242188#(= main_~p8~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {242188#(= main_~p8~0 0)} is VALID [2022-04-15 18:00:02,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {242188#(= main_~p8~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {242188#(= main_~p8~0 0)} is VALID [2022-04-15 18:00:02,586 INFO L290 TraceCheckUtils]: 21: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p1~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-15 18:00:02,586 INFO L290 TraceCheckUtils]: 22: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p2~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-15 18:00:02,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p3~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-15 18:00:02,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p4~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-15 18:00:02,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p5~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-15 18:00:02,587 INFO L290 TraceCheckUtils]: 26: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p6~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-15 18:00:02,588 INFO L290 TraceCheckUtils]: 27: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p7~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-15 18:00:02,588 INFO L290 TraceCheckUtils]: 28: Hoare triple {242188#(= main_~p8~0 0)} assume 0 != ~p8~0; {242184#false} is VALID [2022-04-15 18:00:02,588 INFO L290 TraceCheckUtils]: 29: Hoare triple {242184#false} assume 1 != ~lk8~0; {242184#false} is VALID [2022-04-15 18:00:02,588 INFO L290 TraceCheckUtils]: 30: Hoare triple {242184#false} assume !false; {242184#false} is VALID [2022-04-15 18:00:02,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:00:02,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:00:02,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436269253] [2022-04-15 18:00:02,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436269253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:00:02,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:00:02,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:00:02,589 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:00:02,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [119939882] [2022-04-15 18:00:02,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [119939882] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:00:02,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:00:02,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:00:02,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444350348] [2022-04-15 18:00:02,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:00:02,590 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:02,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:00:02,590 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:02,609 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:02,609 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:00:02,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:00:02,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:00:02,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:00:02,609 INFO L87 Difference]: Start difference. First operand 7177 states and 10567 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:19,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:00:19,212 INFO L93 Difference]: Finished difference Result 16653 states and 24649 transitions. [2022-04-15 18:00:19,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:00:19,212 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:19,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:00:19,213 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:19,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 225 transitions. [2022-04-15 18:00:19,214 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:19,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 225 transitions. [2022-04-15 18:00:19,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 225 transitions. [2022-04-15 18:00:19,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:00:25,306 INFO L225 Difference]: With dead ends: 16653 [2022-04-15 18:00:25,306 INFO L226 Difference]: Without dead ends: 9611 [2022-04-15 18:00:25,317 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:25,328 INFO L913 BasicCegarLoop]: 126 mSDtfsCounter, 151 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:00:25,328 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 133 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:00:25,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9611 states. [2022-04-15 18:00:26,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9611 to 9609. [2022-04-15 18:00:26,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:00:26,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9611 states. Second operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call 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:26,367 INFO L74 IsIncluded]: Start isIncluded. First operand 9611 states. Second operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call 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:26,380 INFO L87 Difference]: Start difference. First operand 9611 states. Second operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call 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:29,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:00:29,143 INFO L93 Difference]: Finished difference Result 9611 states and 14088 transitions. [2022-04-15 18:00:29,143 INFO L276 IsEmpty]: Start isEmpty. Operand 9611 states and 14088 transitions. [2022-04-15 18:00:29,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:00:29,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:00:29,166 INFO L74 IsIncluded]: Start isIncluded. First operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 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 9611 states. [2022-04-15 18:00:29,179 INFO L87 Difference]: Start difference. First operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 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 9611 states. [2022-04-15 18:00:31,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:00:31,749 INFO L93 Difference]: Finished difference Result 9611 states and 14088 transitions. [2022-04-15 18:00:31,750 INFO L276 IsEmpty]: Start isEmpty. Operand 9611 states and 14088 transitions. [2022-04-15 18:00:31,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:00:31,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:00:31,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:00:31,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:00:31,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call 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:36,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9609 states to 9609 states and 14087 transitions. [2022-04-15 18:00:36,317 INFO L78 Accepts]: Start accepts. Automaton has 9609 states and 14087 transitions. Word has length 31 [2022-04-15 18:00:36,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:00:36,317 INFO L478 AbstractCegarLoop]: Abstraction has 9609 states and 14087 transitions. [2022-04-15 18:00:36,317 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:36,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9609 states and 14087 transitions. [2022-04-15 18:00:54,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14087 edges. 14087 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:00:54,324 INFO L276 IsEmpty]: Start isEmpty. Operand 9609 states and 14087 transitions. [2022-04-15 18:00:54,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 18:00:54,332 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:00:54,332 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:54,332 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 18:00:54,332 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:00:54,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:00:54,333 INFO L85 PathProgramCache]: Analyzing trace with hash -446932963, now seen corresponding path program 1 times [2022-04-15 18:00:54,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:00:54,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [192350033] [2022-04-15 18:00:54,333 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:00:54,333 INFO L85 PathProgramCache]: Analyzing trace with hash -446932963, now seen corresponding path program 2 times [2022-04-15 18:00:54,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:00:54,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58067768] [2022-04-15 18:00:54,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:00:54,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:00:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:00:54,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:00:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:00:54,366 INFO L290 TraceCheckUtils]: 0: Hoare triple {313947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {313941#true} is VALID [2022-04-15 18:00:54,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {313941#true} assume true; {313941#true} is VALID [2022-04-15 18:00:54,366 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {313941#true} {313941#true} #251#return; {313941#true} is VALID [2022-04-15 18:00:54,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {313941#true} call ULTIMATE.init(); {313947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:00:54,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {313947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {313941#true} is VALID [2022-04-15 18:00:54,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {313941#true} assume true; {313941#true} is VALID [2022-04-15 18:00:54,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {313941#true} {313941#true} #251#return; {313941#true} is VALID [2022-04-15 18:00:54,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {313941#true} call #t~ret18 := main(); {313941#true} is VALID [2022-04-15 18:00:54,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {313941#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;havoc ~cond~0; {313941#true} is VALID [2022-04-15 18:00:54,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {313941#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {313941#true} is VALID [2022-04-15 18:00:54,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {313941#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; {313941#true} is VALID [2022-04-15 18:00:54,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {313941#true} assume !(0 != ~p1~0); {313941#true} is VALID [2022-04-15 18:00:54,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {313941#true} assume !(0 != ~p2~0); {313941#true} is VALID [2022-04-15 18:00:54,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {313941#true} assume !(0 != ~p3~0); {313941#true} is VALID [2022-04-15 18:00:54,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {313941#true} assume !(0 != ~p4~0); {313941#true} is VALID [2022-04-15 18:00:54,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {313941#true} assume !(0 != ~p5~0); {313941#true} is VALID [2022-04-15 18:00:54,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {313941#true} assume !(0 != ~p6~0); {313941#true} is VALID [2022-04-15 18:00:54,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {313941#true} assume !(0 != ~p7~0); {313941#true} is VALID [2022-04-15 18:00:54,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {313941#true} assume 0 != ~p8~0;~lk8~0 := 1; {313946#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:00:54,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {313946#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {313946#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:00:54,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:00:54,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {313946#(not (= main_~p8~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {313946#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:00:54,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {313946#(not (= main_~p8~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {313946#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:00:54,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {313946#(not (= main_~p8~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {313946#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:00:54,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:00:54,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:00:54,454 INFO L290 TraceCheckUtils]: 23: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:00:54,454 INFO L290 TraceCheckUtils]: 24: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:00:54,455 INFO L290 TraceCheckUtils]: 25: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:00:54,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:00:54,455 INFO L290 TraceCheckUtils]: 27: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-15 18:00:54,456 INFO L290 TraceCheckUtils]: 28: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {313942#false} is VALID [2022-04-15 18:00:54,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {313942#false} assume 0 != ~p9~0; {313942#false} is VALID [2022-04-15 18:00:54,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {313942#false} assume 1 != ~lk9~0; {313942#false} is VALID [2022-04-15 18:00:54,456 INFO L290 TraceCheckUtils]: 31: Hoare triple {313942#false} assume !false; {313942#false} is VALID [2022-04-15 18:00:54,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:00:54,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:00:54,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58067768] [2022-04-15 18:00:54,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58067768] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:00:54,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:00:54,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:00:54,457 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:00:54,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [192350033] [2022-04-15 18:00:54,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [192350033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:00:54,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:00:54,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:00:54,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931926636] [2022-04-15 18:00:54,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:00:54,458 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:54,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:00:54,458 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:54,491 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:54,491 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:00:54,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:00:54,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:00:54,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:00:54,492 INFO L87 Difference]: Start difference. First operand 9609 states and 14087 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:06,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:01:06,546 INFO L93 Difference]: Finished difference Result 14413 states and 21065 transitions. [2022-04-15 18:01:06,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:01:06,546 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:06,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:01:06,546 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:06,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 220 transitions. [2022-04-15 18:01:06,547 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:06,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 220 transitions. [2022-04-15 18:01:06,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 220 transitions. [2022-04-15 18:01:06,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:01:11,483 INFO L225 Difference]: With dead ends: 14413 [2022-04-15 18:01:11,483 INFO L226 Difference]: Without dead ends: 9739 [2022-04-15 18:01:11,489 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:11,493 INFO L913 BasicCegarLoop]: 115 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:01:11,493 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 122 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:01:11,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9739 states. [2022-04-15 18:01:12,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9739 to 9737. [2022-04-15 18:01:12,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:01:12,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9739 states. Second operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call 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:12,367 INFO L74 IsIncluded]: Start isIncluded. First operand 9739 states. Second operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call 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:12,380 INFO L87 Difference]: Start difference. First operand 9739 states. Second operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call 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:15,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:01:15,137 INFO L93 Difference]: Finished difference Result 9739 states and 14088 transitions. [2022-04-15 18:01:15,138 INFO L276 IsEmpty]: Start isEmpty. Operand 9739 states and 14088 transitions. [2022-04-15 18:01:15,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:01:15,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:01:15,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 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 9739 states. [2022-04-15 18:01:15,171 INFO L87 Difference]: Start difference. First operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 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 9739 states. [2022-04-15 18:01:18,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:01:18,465 INFO L93 Difference]: Finished difference Result 9739 states and 14088 transitions. [2022-04-15 18:01:18,465 INFO L276 IsEmpty]: Start isEmpty. Operand 9739 states and 14088 transitions. [2022-04-15 18:01:18,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:01:18,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:01:18,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:01:18,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:01:18,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call 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:24,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9737 states to 9737 states and 14087 transitions. [2022-04-15 18:01:24,821 INFO L78 Accepts]: Start accepts. Automaton has 9737 states and 14087 transitions. Word has length 32 [2022-04-15 18:01:24,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:01:24,821 INFO L478 AbstractCegarLoop]: Abstraction has 9737 states and 14087 transitions. [2022-04-15 18:01:24,822 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:24,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9737 states and 14087 transitions. [2022-04-15 18:01:43,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14087 edges. 14087 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:01:43,258 INFO L276 IsEmpty]: Start isEmpty. Operand 9737 states and 14087 transitions. [2022-04-15 18:01:43,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 18:01:43,265 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:01:43,265 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,265 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 18:01:43,265 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:01:43,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:01:43,265 INFO L85 PathProgramCache]: Analyzing trace with hash -2035280865, now seen corresponding path program 1 times [2022-04-15 18:01:43,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:01:43,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [604978876] [2022-04-15 18:01:43,266 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:01:43,266 INFO L85 PathProgramCache]: Analyzing trace with hash -2035280865, now seen corresponding path program 2 times [2022-04-15 18:01:43,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:01:43,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593479608] [2022-04-15 18:01:43,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:01:43,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:01:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:01:43,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:01:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:01:43,322 INFO L290 TraceCheckUtils]: 0: Hoare triple {381737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {381731#true} is VALID [2022-04-15 18:01:43,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {381731#true} assume true; {381731#true} is VALID [2022-04-15 18:01:43,323 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {381731#true} {381731#true} #251#return; {381731#true} is VALID [2022-04-15 18:01:43,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {381731#true} call ULTIMATE.init(); {381737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:01:43,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {381737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {381731#true} is VALID [2022-04-15 18:01:43,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {381731#true} assume true; {381731#true} is VALID [2022-04-15 18:01:43,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {381731#true} {381731#true} #251#return; {381731#true} is VALID [2022-04-15 18:01:43,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {381731#true} call #t~ret18 := main(); {381731#true} is VALID [2022-04-15 18:01:43,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {381731#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;havoc ~cond~0; {381731#true} is VALID [2022-04-15 18:01:43,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {381731#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {381731#true} is VALID [2022-04-15 18:01:43,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {381731#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; {381731#true} is VALID [2022-04-15 18:01:43,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {381731#true} assume !(0 != ~p1~0); {381731#true} is VALID [2022-04-15 18:01:43,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {381731#true} assume !(0 != ~p2~0); {381731#true} is VALID [2022-04-15 18:01:43,324 INFO L290 TraceCheckUtils]: 10: Hoare triple {381731#true} assume !(0 != ~p3~0); {381731#true} is VALID [2022-04-15 18:01:43,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {381731#true} assume !(0 != ~p4~0); {381731#true} is VALID [2022-04-15 18:01:43,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {381731#true} assume !(0 != ~p5~0); {381731#true} is VALID [2022-04-15 18:01:43,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {381731#true} assume !(0 != ~p6~0); {381731#true} is VALID [2022-04-15 18:01:43,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {381731#true} assume !(0 != ~p7~0); {381731#true} is VALID [2022-04-15 18:01:43,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {381731#true} assume !(0 != ~p8~0); {381731#true} is VALID [2022-04-15 18:01:43,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {381731#true} assume 0 != ~p9~0;~lk9~0 := 1; {381736#(= main_~lk9~0 1)} is VALID [2022-04-15 18:01:43,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-15 18:01:43,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {381736#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {381736#(= main_~lk9~0 1)} is VALID [2022-04-15 18:01:43,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {381736#(= main_~lk9~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {381736#(= main_~lk9~0 1)} is VALID [2022-04-15 18:01:43,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {381736#(= main_~lk9~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {381736#(= main_~lk9~0 1)} is VALID [2022-04-15 18:01:43,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-15 18:01:43,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-15 18:01:43,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-15 18:01:43,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-15 18:01:43,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-15 18:01:43,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-15 18:01:43,328 INFO L290 TraceCheckUtils]: 27: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-15 18:01:43,329 INFO L290 TraceCheckUtils]: 28: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-15 18:01:43,329 INFO L290 TraceCheckUtils]: 29: Hoare triple {381736#(= main_~lk9~0 1)} assume 0 != ~p9~0; {381736#(= main_~lk9~0 1)} is VALID [2022-04-15 18:01:43,329 INFO L290 TraceCheckUtils]: 30: Hoare triple {381736#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {381732#false} is VALID [2022-04-15 18:01:43,330 INFO L290 TraceCheckUtils]: 31: Hoare triple {381732#false} assume !false; {381732#false} is VALID [2022-04-15 18:01:43,330 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,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:01:43,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593479608] [2022-04-15 18:01:43,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593479608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:01:43,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:01:43,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:01:43,331 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:01:43,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [604978876] [2022-04-15 18:01:43,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [604978876] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:01:43,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:01:43,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:01:43,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561433786] [2022-04-15 18:01:43,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:01:43,332 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,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:01:43,333 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,353 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,354 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:01:43,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:01:43,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:01:43,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:01:43,354 INFO L87 Difference]: Start difference. First operand 9737 states and 14087 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:06,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:06,875 INFO L93 Difference]: Finished difference Result 16909 states and 24969 transitions. [2022-04-15 18:02:06,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:02:06,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 18:02:06,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:02:06,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:06,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-15 18:02:06,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:06,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-15 18:02:06,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 135 transitions. [2022-04-15 18:02:06,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:02:25,780 INFO L225 Difference]: With dead ends: 16909 [2022-04-15 18:02:25,780 INFO L226 Difference]: Without dead ends: 16907 [2022-04-15 18:02:25,785 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:02:25,787 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:02:25,787 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 88 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:02:25,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16907 states. [2022-04-15 18:02:27,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16907 to 14345. [2022-04-15 18:02:27,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:02:27,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16907 states. Second operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states have call 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:27,506 INFO L74 IsIncluded]: Start isIncluded. First operand 16907 states. Second operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states have call 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:27,530 INFO L87 Difference]: Start difference. First operand 16907 states. Second operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:02:38,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:38,510 INFO L93 Difference]: Finished difference Result 16907 states and 24712 transitions. [2022-04-15 18:02:38,510 INFO L276 IsEmpty]: Start isEmpty. Operand 16907 states and 24712 transitions. [2022-04-15 18:02:38,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:38,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:38,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 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 16907 states. [2022-04-15 18:02:38,562 INFO L87 Difference]: Start difference. First operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 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 16907 states. [2022-04-15 18:02:47,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:47,531 INFO L93 Difference]: Finished difference Result 16907 states and 24712 transitions. [2022-04-15 18:02:47,531 INFO L276 IsEmpty]: Start isEmpty. Operand 16907 states and 24712 transitions. [2022-04-15 18:02:47,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:02:47,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:02:47,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:02:47,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:02:47,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:02,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14345 states to 14345 states and 20103 transitions. [2022-04-15 18:03:02,169 INFO L78 Accepts]: Start accepts. Automaton has 14345 states and 20103 transitions. Word has length 32 [2022-04-15 18:03:02,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:03:02,169 INFO L478 AbstractCegarLoop]: Abstraction has 14345 states and 20103 transitions. [2022-04-15 18:03:02,169 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:02,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14345 states and 20103 transitions. [2022-04-15 18:03:28,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20103 edges. 20103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:28,449 INFO L276 IsEmpty]: Start isEmpty. Operand 14345 states and 20103 transitions. [2022-04-15 18:03:28,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 18:03:28,459 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:03:28,459 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:03:28,459 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 18:03:28,459 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:03:28,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:03:28,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1238618077, now seen corresponding path program 1 times [2022-04-15 18:03:28,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:28,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1694660851] [2022-04-15 18:03:28,460 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:03:28,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1238618077, now seen corresponding path program 2 times [2022-04-15 18:03:28,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:03:28,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986206279] [2022-04-15 18:03:28,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:03:28,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:03:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:28,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:03:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:28,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {478071#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {478065#true} is VALID [2022-04-15 18:03:28,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {478065#true} assume true; {478065#true} is VALID [2022-04-15 18:03:28,495 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {478065#true} {478065#true} #251#return; {478065#true} is VALID [2022-04-15 18:03:28,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {478065#true} call ULTIMATE.init(); {478071#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:03:28,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {478071#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {478065#true} is VALID [2022-04-15 18:03:28,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {478065#true} assume true; {478065#true} is VALID [2022-04-15 18:03:28,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {478065#true} {478065#true} #251#return; {478065#true} is VALID [2022-04-15 18:03:28,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {478065#true} call #t~ret18 := main(); {478065#true} is VALID [2022-04-15 18:03:28,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {478065#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;havoc ~cond~0; {478065#true} is VALID [2022-04-15 18:03:28,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {478065#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {478065#true} is VALID [2022-04-15 18:03:28,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {478065#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; {478065#true} is VALID [2022-04-15 18:03:28,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {478065#true} assume !(0 != ~p1~0); {478065#true} is VALID [2022-04-15 18:03:28,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {478065#true} assume !(0 != ~p2~0); {478065#true} is VALID [2022-04-15 18:03:28,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {478065#true} assume !(0 != ~p3~0); {478065#true} is VALID [2022-04-15 18:03:28,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {478065#true} assume !(0 != ~p4~0); {478065#true} is VALID [2022-04-15 18:03:28,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {478065#true} assume !(0 != ~p5~0); {478065#true} is VALID [2022-04-15 18:03:28,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {478065#true} assume !(0 != ~p6~0); {478065#true} is VALID [2022-04-15 18:03:28,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {478065#true} assume !(0 != ~p7~0); {478065#true} is VALID [2022-04-15 18:03:28,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {478065#true} assume !(0 != ~p8~0); {478065#true} is VALID [2022-04-15 18:03:28,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {478065#true} assume !(0 != ~p9~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-15 18:03:28,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p10~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-15 18:03:28,499 INFO L290 TraceCheckUtils]: 18: Hoare triple {478070#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {478070#(= main_~p9~0 0)} is VALID [2022-04-15 18:03:28,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {478070#(= main_~p9~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {478070#(= main_~p9~0 0)} is VALID [2022-04-15 18:03:28,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {478070#(= main_~p9~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {478070#(= main_~p9~0 0)} is VALID [2022-04-15 18:03:28,500 INFO L290 TraceCheckUtils]: 21: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p1~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-15 18:03:28,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p2~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-15 18:03:28,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p3~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-15 18:03:28,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p4~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-15 18:03:28,501 INFO L290 TraceCheckUtils]: 25: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p5~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-15 18:03:28,501 INFO L290 TraceCheckUtils]: 26: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p6~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-15 18:03:28,501 INFO L290 TraceCheckUtils]: 27: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p7~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-15 18:03:28,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p8~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-15 18:03:28,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {478070#(= main_~p9~0 0)} assume 0 != ~p9~0; {478066#false} is VALID [2022-04-15 18:03:28,502 INFO L290 TraceCheckUtils]: 30: Hoare triple {478066#false} assume 1 != ~lk9~0; {478066#false} is VALID [2022-04-15 18:03:28,502 INFO L290 TraceCheckUtils]: 31: Hoare triple {478066#false} assume !false; {478066#false} is VALID [2022-04-15 18:03:28,502 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:28,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:03:28,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986206279] [2022-04-15 18:03:28,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986206279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:28,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:28,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:28,503 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:03:28,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1694660851] [2022-04-15 18:03:28,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1694660851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:28,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:28,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:28,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200089503] [2022-04-15 18:03:28,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:03:28,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 18:03:28,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:03:28,504 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:03:28,523 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:03:28,523 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:03:28,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:28,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:03:28,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:03:28,524 INFO L87 Difference]: Start difference. First operand 14345 states and 20103 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:05:47,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:05:47,274 INFO L93 Difference]: Finished difference Result 33037 states and 46473 transitions. [2022-04-15 18:05:47,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:05:47,274 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:05:47,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:05:47,274 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:05:47,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2022-04-15 18:05:47,275 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:05:47,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2022-04-15 18:05:47,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 222 transitions. [2022-04-15 18:05:47,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:06:04,666 INFO L225 Difference]: With dead ends: 33037 [2022-04-15 18:06:04,667 INFO L226 Difference]: Without dead ends: 18955 [2022-04-15 18:06:04,683 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:04,684 INFO L913 BasicCegarLoop]: 128 mSDtfsCounter, 145 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:06:04,684 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 135 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:06:04,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18955 states. [2022-04-15 18:06:06,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18955 to 18953. [2022-04-15 18:06:06,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:06:06,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18955 states. Second operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call 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:06,343 INFO L74 IsIncluded]: Start isIncluded. First operand 18955 states. Second operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call 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:06,367 INFO L87 Difference]: Start difference. First operand 18955 states. Second operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call 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:15,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:06:15,990 INFO L93 Difference]: Finished difference Result 18955 states and 26376 transitions. [2022-04-15 18:06:15,990 INFO L276 IsEmpty]: Start isEmpty. Operand 18955 states and 26376 transitions. [2022-04-15 18:06:16,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:06:16,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:06:16,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 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 18955 states. [2022-04-15 18:06:16,048 INFO L87 Difference]: Start difference. First operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 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 18955 states. [2022-04-15 18:06:26,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:06:26,565 INFO L93 Difference]: Finished difference Result 18955 states and 26376 transitions. [2022-04-15 18:06:26,565 INFO L276 IsEmpty]: Start isEmpty. Operand 18955 states and 26376 transitions. [2022-04-15 18:06:26,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:06:26,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:06:26,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:06:26,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:06:26,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call 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:46,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18953 states to 18953 states and 26375 transitions. [2022-04-15 18:06:46,095 INFO L78 Accepts]: Start accepts. Automaton has 18953 states and 26375 transitions. Word has length 32 [2022-04-15 18:06:46,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:06:46,095 INFO L478 AbstractCegarLoop]: Abstraction has 18953 states and 26375 transitions. [2022-04-15 18:06:46,095 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:06:46,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18953 states and 26375 transitions. [2022-04-15 18:07:17,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26375 edges. 26375 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:07:17,390 INFO L276 IsEmpty]: Start isEmpty. Operand 18953 states and 26375 transitions. [2022-04-15 18:07:17,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 18:07:17,400 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:07:17,400 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:07:17,401 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 18:07:17,401 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:07:17,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:07:17,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1331017764, now seen corresponding path program 1 times [2022-04-15 18:07:17,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:07:17,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1517281684] [2022-04-15 18:07:17,401 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:07:17,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1331017764, now seen corresponding path program 2 times [2022-04-15 18:07:17,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:07:17,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781563093] [2022-04-15 18:07:17,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:07:17,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:07:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:07:17,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:07:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:07:17,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {619973#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {619967#true} is VALID [2022-04-15 18:07:17,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {619967#true} assume true; {619967#true} is VALID [2022-04-15 18:07:17,441 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {619967#true} {619967#true} #251#return; {619967#true} is VALID [2022-04-15 18:07:17,442 INFO L272 TraceCheckUtils]: 0: Hoare triple {619967#true} call ULTIMATE.init(); {619973#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:07:17,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {619973#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {619967#true} is VALID [2022-04-15 18:07:17,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {619967#true} assume true; {619967#true} is VALID [2022-04-15 18:07:17,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {619967#true} {619967#true} #251#return; {619967#true} is VALID [2022-04-15 18:07:17,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {619967#true} call #t~ret18 := main(); {619967#true} is VALID [2022-04-15 18:07:17,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {619967#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;havoc ~cond~0; {619967#true} is VALID [2022-04-15 18:07:17,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {619967#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {619967#true} is VALID [2022-04-15 18:07:17,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {619967#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; {619967#true} is VALID [2022-04-15 18:07:17,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {619967#true} assume !(0 != ~p1~0); {619967#true} is VALID [2022-04-15 18:07:17,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {619967#true} assume !(0 != ~p2~0); {619967#true} is VALID [2022-04-15 18:07:17,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {619967#true} assume !(0 != ~p3~0); {619967#true} is VALID [2022-04-15 18:07:17,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {619967#true} assume !(0 != ~p4~0); {619967#true} is VALID [2022-04-15 18:07:17,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {619967#true} assume !(0 != ~p5~0); {619967#true} is VALID [2022-04-15 18:07:17,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {619967#true} assume !(0 != ~p6~0); {619967#true} is VALID [2022-04-15 18:07:17,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {619967#true} assume !(0 != ~p7~0); {619967#true} is VALID [2022-04-15 18:07:17,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {619967#true} assume !(0 != ~p8~0); {619967#true} is VALID [2022-04-15 18:07:17,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {619967#true} assume 0 != ~p9~0;~lk9~0 := 1; {619972#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:07:17,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:07:17,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {619972#(not (= main_~p9~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {619972#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:07:17,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {619972#(not (= main_~p9~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {619972#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:07:17,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {619972#(not (= main_~p9~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {619972#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:07:17,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:07:17,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:07:17,446 INFO L290 TraceCheckUtils]: 23: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:07:17,450 INFO L290 TraceCheckUtils]: 24: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:07:17,450 INFO L290 TraceCheckUtils]: 25: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:07:17,450 INFO L290 TraceCheckUtils]: 26: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:07:17,451 INFO L290 TraceCheckUtils]: 27: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:07:17,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:07:17,451 INFO L290 TraceCheckUtils]: 29: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {619968#false} is VALID [2022-04-15 18:07:17,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {619968#false} assume 0 != ~p10~0; {619968#false} is VALID [2022-04-15 18:07:17,452 INFO L290 TraceCheckUtils]: 31: Hoare triple {619968#false} assume 1 != ~lk10~0; {619968#false} is VALID [2022-04-15 18:07:17,452 INFO L290 TraceCheckUtils]: 32: Hoare triple {619968#false} assume !false; {619968#false} is VALID [2022-04-15 18:07:17,452 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:17,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:07:17,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781563093] [2022-04-15 18:07:17,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781563093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:07:17,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:07:17,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:07:17,453 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:07:17,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1517281684] [2022-04-15 18:07:17,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1517281684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:07:17,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:07:17,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:07:17,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075732792] [2022-04-15 18:07:17,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:07:17,453 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:07:17,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:07:17,454 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:07:17,477 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:07:17,477 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:07:17,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:07:17,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:07:17,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:07:17,478 INFO L87 Difference]: Start difference. First operand 18953 states and 26375 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:09:41,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:09:41,009 INFO L93 Difference]: Finished difference Result 28429 states and 39433 transitions. [2022-04-15 18:09:41,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:09:41,010 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:09:41,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:09:41,010 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:09:41,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2022-04-15 18:09:41,011 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:09:41,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2022-04-15 18:09:41,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 217 transitions. [2022-04-15 18:09:41,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:10:00,732 INFO L225 Difference]: With dead ends: 28429 [2022-04-15 18:10:00,732 INFO L226 Difference]: Without dead ends: 19211 [2022-04-15 18:10:00,746 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:00,746 INFO L913 BasicCegarLoop]: 112 mSDtfsCounter, 162 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:10:00,746 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 119 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:10:00,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19211 states. [2022-04-15 18:10:02,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19211 to 19209. [2022-04-15 18:10:02,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:10:02,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19211 states. Second operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call 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:02,566 INFO L74 IsIncluded]: Start isIncluded. First operand 19211 states. Second operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call 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:02,594 INFO L87 Difference]: Start difference. First operand 19211 states. Second operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call 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:13,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:10:13,392 INFO L93 Difference]: Finished difference Result 19211 states and 26376 transitions. [2022-04-15 18:10:13,392 INFO L276 IsEmpty]: Start isEmpty. Operand 19211 states and 26376 transitions. [2022-04-15 18:10:13,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:10:13,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:10:13,435 INFO L74 IsIncluded]: Start isIncluded. First operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 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 19211 states. [2022-04-15 18:10:13,463 INFO L87 Difference]: Start difference. First operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 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 19211 states. [2022-04-15 18:10:23,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:10:23,737 INFO L93 Difference]: Finished difference Result 19211 states and 26376 transitions. [2022-04-15 18:10:23,737 INFO L276 IsEmpty]: Start isEmpty. Operand 19211 states and 26376 transitions. [2022-04-15 18:10:23,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:10:23,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:10:23,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:10:23,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:10:23,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call 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:50,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19209 states to 19209 states and 26375 transitions. [2022-04-15 18:10:50,562 INFO L78 Accepts]: Start accepts. Automaton has 19209 states and 26375 transitions. Word has length 33 [2022-04-15 18:10:50,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:10:50,562 INFO L478 AbstractCegarLoop]: Abstraction has 19209 states and 26375 transitions. [2022-04-15 18:10:50,563 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:10:50,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19209 states and 26375 transitions. [2022-04-15 18:11:25,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26375 edges. 26375 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:11:25,791 INFO L276 IsEmpty]: Start isEmpty. Operand 19209 states and 26375 transitions. [2022-04-15 18:11:25,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 18:11:25,804 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:11:25,804 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:11:25,804 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 18:11:25,804 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:11:25,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:11:25,805 INFO L85 PathProgramCache]: Analyzing trace with hash -257330138, now seen corresponding path program 1 times [2022-04-15 18:11:25,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:11:25,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1083103855] [2022-04-15 18:11:25,805 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:11:25,805 INFO L85 PathProgramCache]: Analyzing trace with hash -257330138, now seen corresponding path program 2 times [2022-04-15 18:11:25,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:11:25,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402613181] [2022-04-15 18:11:25,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:11:25,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:11:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:11:25,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:11:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:11:25,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {753683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {753677#true} is VALID [2022-04-15 18:11:25,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {753677#true} assume true; {753677#true} is VALID [2022-04-15 18:11:25,838 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {753677#true} {753677#true} #251#return; {753677#true} is VALID [2022-04-15 18:11:25,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {753677#true} call ULTIMATE.init(); {753683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:11:25,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {753683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {753677#true} is VALID [2022-04-15 18:11:25,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {753677#true} assume true; {753677#true} is VALID [2022-04-15 18:11:25,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {753677#true} {753677#true} #251#return; {753677#true} is VALID [2022-04-15 18:11:25,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {753677#true} call #t~ret18 := main(); {753677#true} is VALID [2022-04-15 18:11:25,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {753677#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;havoc ~cond~0; {753677#true} is VALID [2022-04-15 18:11:25,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {753677#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {753677#true} is VALID [2022-04-15 18:11:25,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {753677#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; {753677#true} is VALID [2022-04-15 18:11:25,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {753677#true} assume !(0 != ~p1~0); {753677#true} is VALID [2022-04-15 18:11:25,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {753677#true} assume !(0 != ~p2~0); {753677#true} is VALID [2022-04-15 18:11:25,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {753677#true} assume !(0 != ~p3~0); {753677#true} is VALID [2022-04-15 18:11:25,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {753677#true} assume !(0 != ~p4~0); {753677#true} is VALID [2022-04-15 18:11:25,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {753677#true} assume !(0 != ~p5~0); {753677#true} is VALID [2022-04-15 18:11:25,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {753677#true} assume !(0 != ~p6~0); {753677#true} is VALID [2022-04-15 18:11:25,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {753677#true} assume !(0 != ~p7~0); {753677#true} is VALID [2022-04-15 18:11:25,840 INFO L290 TraceCheckUtils]: 15: Hoare triple {753677#true} assume !(0 != ~p8~0); {753677#true} is VALID [2022-04-15 18:11:25,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {753677#true} assume !(0 != ~p9~0); {753677#true} is VALID [2022-04-15 18:11:25,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {753677#true} assume !(0 != ~p10~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-15 18:11:25,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {753682#(= main_~p10~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {753682#(= main_~p10~0 0)} is VALID [2022-04-15 18:11:25,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {753682#(= main_~p10~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {753682#(= main_~p10~0 0)} is VALID [2022-04-15 18:11:25,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {753682#(= main_~p10~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {753682#(= main_~p10~0 0)} is VALID [2022-04-15 18:11:25,842 INFO L290 TraceCheckUtils]: 21: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p1~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-15 18:11:25,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p2~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-15 18:11:25,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p3~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-15 18:11:25,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p4~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-15 18:11:25,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p5~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-15 18:11:25,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p6~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-15 18:11:25,844 INFO L290 TraceCheckUtils]: 27: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p7~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-15 18:11:25,844 INFO L290 TraceCheckUtils]: 28: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p8~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-15 18:11:25,845 INFO L290 TraceCheckUtils]: 29: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p9~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-15 18:11:25,845 INFO L290 TraceCheckUtils]: 30: Hoare triple {753682#(= main_~p10~0 0)} assume 0 != ~p10~0; {753678#false} is VALID [2022-04-15 18:11:25,845 INFO L290 TraceCheckUtils]: 31: Hoare triple {753678#false} assume 1 != ~lk10~0; {753678#false} is VALID [2022-04-15 18:11:25,845 INFO L290 TraceCheckUtils]: 32: Hoare triple {753678#false} assume !false; {753678#false} is VALID [2022-04-15 18:11:25,846 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:25,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:11:25,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402613181] [2022-04-15 18:11:25,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402613181] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:11:25,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:11:25,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:11:25,846 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:11:25,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1083103855] [2022-04-15 18:11:25,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1083103855] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:11:25,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:11:25,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:11:25,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852272111] [2022-04-15 18:11:25,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:11:25,847 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:11:25,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:11:25,847 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:11:25,868 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:11:25,868 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:11:25,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:11:25,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:11:25,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:11:25,869 INFO L87 Difference]: Start difference. First operand 19209 states and 26375 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)