/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/openssl-simplified/s3_srvr_1b.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 17:50:14,407 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 17:50:14,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 17:50:14,453 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 17:50:14,454 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 17:50:14,454 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 17:50:14,456 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 17:50:14,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 17:50:14,461 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 17:50:14,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 17:50:14,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 17:50:14,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 17:50:14,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 17:50:14,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 17:50:14,469 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 17:50:14,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 17:50:14,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 17:50:14,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 17:50:14,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 17:50:14,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 17:50:14,478 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 17:50:14,479 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 17:50:14,479 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 17:50:14,480 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 17:50:14,480 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 17:50:14,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 17:50:14,485 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 17:50:14,485 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 17:50:14,486 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 17:50:14,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 17:50:14,487 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 17:50:14,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 17:50:14,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 17:50:14,488 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 17:50:14,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 17:50:14,489 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 17:50:14,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 17:50:14,490 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 17:50:14,490 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 17:50:14,490 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 17:50:14,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 17:50:14,491 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 17:50:14,492 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:50:14,498 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 17:50:14,498 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 17:50:14,499 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 17:50:14,499 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 17:50:14,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 17:50:14,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 17:50:14,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 17:50:14,499 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 17:50:14,500 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 17:50:14,500 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 17:50:14,500 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 17:50:14,500 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 17:50:14,500 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 17:50:14,500 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 17:50:14,501 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 17:50:14,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 17:50:14,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 17:50:14,501 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 17:50:14,501 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 17:50:14,501 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 17:50:14,501 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 17:50:14,501 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 17:50:14,501 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:50:14,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 17:50:14,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 17:50:14,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 17:50:14,692 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 17:50:14,696 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 17:50:14,697 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_1b.cil.c [2022-04-15 17:50:14,754 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/237e7e68c/94f4dd6cfc4e4578920f1a67ee4a54d3/FLAGefa30b5ba [2022-04-15 17:50:15,107 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 17:50:15,107 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1b.cil.c [2022-04-15 17:50:15,112 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/237e7e68c/94f4dd6cfc4e4578920f1a67ee4a54d3/FLAGefa30b5ba [2022-04-15 17:50:15,534 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/237e7e68c/94f4dd6cfc4e4578920f1a67ee4a54d3 [2022-04-15 17:50:15,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 17:50:15,536 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 17:50:15,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 17:50:15,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 17:50:15,541 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 17:50:15,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:50:15" (1/1) ... [2022-04-15 17:50:15,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36df085e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:50:15, skipping insertion in model container [2022-04-15 17:50:15,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:50:15" (1/1) ... [2022-04-15 17:50:15,547 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 17:50:15,557 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 17:50:15,687 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1b.cil.c[8244,8257] [2022-04-15 17:50:15,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 17:50:15,694 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 17:50:15,707 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1b.cil.c[8244,8257] [2022-04-15 17:50:15,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 17:50:15,717 INFO L208 MainTranslator]: Completed translation [2022-04-15 17:50:15,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:50:15 WrapperNode [2022-04-15 17:50:15,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 17:50:15,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 17:50:15,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 17:50:15,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 17:50:15,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:50:15" (1/1) ... [2022-04-15 17:50:15,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:50:15" (1/1) ... [2022-04-15 17:50:15,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:50:15" (1/1) ... [2022-04-15 17:50:15,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:50:15" (1/1) ... [2022-04-15 17:50:15,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:50:15" (1/1) ... [2022-04-15 17:50:15,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:50:15" (1/1) ... [2022-04-15 17:50:15,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:50:15" (1/1) ... [2022-04-15 17:50:15,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 17:50:15,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 17:50:15,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 17:50:15,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 17:50:15,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:50:15" (1/1) ... [2022-04-15 17:50:15,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 17:50:15,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:50:15,793 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:50:15,794 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:50:15,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 17:50:15,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 17:50:15,821 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 17:50:15,821 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 17:50:15,821 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 17:50:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 17:50:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 17:50:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 17:50:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 17:50:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 17:50:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 17:50:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 17:50:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 17:50:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 17:50:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 17:50:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 17:50:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 17:50:15,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 17:50:15,869 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 17:50:15,870 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 17:50:16,010 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 17:50:16,014 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 17:50:16,014 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 17:50:16,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:50:16 BoogieIcfgContainer [2022-04-15 17:50:16,015 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 17:50:16,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 17:50:16,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 17:50:16,030 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 17:50:16,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:50:15" (1/3) ... [2022-04-15 17:50:16,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123c314a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:50:16, skipping insertion in model container [2022-04-15 17:50:16,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:50:15" (2/3) ... [2022-04-15 17:50:16,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123c314a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:50:16, skipping insertion in model container [2022-04-15 17:50:16,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:50:16" (3/3) ... [2022-04-15 17:50:16,031 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1b.cil.c [2022-04-15 17:50:16,034 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 17:50:16,035 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 17:50:16,065 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 17:50:16,069 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:50:16,069 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 17:50:16,081 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 24 states have internal predecessors, (40), 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:50:16,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-15 17:50:16,085 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:50:16,085 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:50:16,086 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:50:16,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:50:16,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1468663722, now seen corresponding path program 1 times [2022-04-15 17:50:16,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:50:16,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1998774133] [2022-04-15 17:50:16,100 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:50:16,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1468663722, now seen corresponding path program 2 times [2022-04-15 17:50:16,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:50:16,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505941008] [2022-04-15 17:50:16,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:50:16,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:50:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:50:16,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:50:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:50:16,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#(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(17, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-15 17:50:16,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-15 17:50:16,280 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #108#return; {32#true} is VALID [2022-04-15 17:50:16,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {38#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:50:16,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#(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(17, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-15 17:50:16,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-15 17:50:16,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #108#return; {32#true} is VALID [2022-04-15 17:50:16,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-15 17:50:16,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {37#(= main_~blastFlag~0 0)} is VALID [2022-04-15 17:50:16,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {37#(= main_~blastFlag~0 0)} assume !false; {37#(= main_~blastFlag~0 0)} is VALID [2022-04-15 17:50:16,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#(= main_~blastFlag~0 0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {33#false} is VALID [2022-04-15 17:50:16,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-15 17:50:16,286 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:50:16,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:50:16,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505941008] [2022-04-15 17:50:16,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505941008] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:50:16,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:50:16,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:50:16,291 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:50:16,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1998774133] [2022-04-15 17:50:16,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1998774133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:50:16,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:50:16,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:50:16,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079744061] [2022-04-15 17:50:16,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:50:16,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 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 9 [2022-04-15 17:50:16,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:50:16,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:16,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:50:16,313 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:50:16,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:50:16,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:50:16,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:50:16,334 INFO L87 Difference]: Start difference. First operand has 29 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 24 states have internal predecessors, (40), 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 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:16,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:16,540 INFO L93 Difference]: Finished difference Result 70 states and 115 transitions. [2022-04-15 17:50:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:50:16,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 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 9 [2022-04-15 17:50:16,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:50:16,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:16,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-15 17:50:16,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:16,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-15 17:50:16,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-15 17:50:16,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:50:16,672 INFO L225 Difference]: With dead ends: 70 [2022-04-15 17:50:16,672 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 17:50:16,674 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 17:50:16,676 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 79 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:50:16,677 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 44 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:50:16,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 17:50:16,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-15 17:50:16,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:50:16,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:16,699 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:16,699 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:16,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:16,702 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-04-15 17:50:16,702 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-04-15 17:50:16,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:50:16,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:50:16,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 2 states have call successors, (2), 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 39 states. [2022-04-15 17:50:16,703 INFO L87 Difference]: Start difference. First operand has 39 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 2 states have call successors, (2), 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 39 states. [2022-04-15 17:50:16,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:16,705 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-04-15 17:50:16,705 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-04-15 17:50:16,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:50:16,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:50:16,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:50:16,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:50:16,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:16,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-04-15 17:50:16,708 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 9 [2022-04-15 17:50:16,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:50:16,708 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2022-04-15 17:50:16,708 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:16,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 53 transitions. [2022-04-15 17:50:16,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:50:16,752 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-04-15 17:50:16,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 17:50:16,752 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:50:16,752 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:50:16,753 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 17:50:16,753 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:50:16,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:50:16,755 INFO L85 PathProgramCache]: Analyzing trace with hash -968056640, now seen corresponding path program 1 times [2022-04-15 17:50:16,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:50:16,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [127226952] [2022-04-15 17:50:19,590 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 17:50:19,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1712965302, now seen corresponding path program 1 times [2022-04-15 17:50:19,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:50:19,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601835548] [2022-04-15 17:50:19,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:50:19,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:50:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 17:50:19,608 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 17:50:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 17:50:19,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 17:50:19,625 INFO L85 PathProgramCache]: Analyzing trace with hash -968056640, now seen corresponding path program 2 times [2022-04-15 17:50:19,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:50:19,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567448617] [2022-04-15 17:50:19,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:50:19,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:50:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:50:19,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:50:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:50:19,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {345#(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(17, 2);call #Ultimate.allocInit(12, 3); {339#true} is VALID [2022-04-15 17:50:19,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {339#true} assume true; {339#true} is VALID [2022-04-15 17:50:19,658 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {339#true} {339#true} #108#return; {339#true} is VALID [2022-04-15 17:50:19,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {339#true} call ULTIMATE.init(); {345#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:50:19,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {345#(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(17, 2);call #Ultimate.allocInit(12, 3); {339#true} is VALID [2022-04-15 17:50:19,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {339#true} assume true; {339#true} is VALID [2022-04-15 17:50:19,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {339#true} {339#true} #108#return; {339#true} is VALID [2022-04-15 17:50:19,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {339#true} call #t~ret6 := main(); {339#true} is VALID [2022-04-15 17:50:19,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {339#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {339#true} is VALID [2022-04-15 17:50:19,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {339#true} assume !false; {339#true} is VALID [2022-04-15 17:50:19,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {339#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {339#true} is VALID [2022-04-15 17:50:19,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {339#true} assume 8466 == ~s__state~0; {339#true} is VALID [2022-04-15 17:50:19,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {339#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 2; {344#(= (+ (- 2) main_~blastFlag~0) 0)} is VALID [2022-04-15 17:50:19,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {344#(= (+ (- 2) main_~blastFlag~0) 0)} assume !(0 != ~s__hit~0);~s__state~0 := 8512; {344#(= (+ (- 2) main_~blastFlag~0) 0)} is VALID [2022-04-15 17:50:19,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {344#(= (+ (- 2) main_~blastFlag~0) 0)} assume !false; {344#(= (+ (- 2) main_~blastFlag~0) 0)} is VALID [2022-04-15 17:50:19,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {344#(= (+ (- 2) main_~blastFlag~0) 0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {340#false} is VALID [2022-04-15 17:50:19,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {340#false} assume !false; {340#false} is VALID [2022-04-15 17:50:19,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:50:19,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:50:19,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567448617] [2022-04-15 17:50:19,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567448617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:50:19,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:50:19,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:50:19,663 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:50:19,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [127226952] [2022-04-15 17:50:19,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [127226952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:50:19,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:50:19,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:50:19,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901421709] [2022-04-15 17:50:19,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:50:19,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 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 14 [2022-04-15 17:50:19,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:50:19,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:19,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:50:19,673 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:50:19,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:50:19,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:50:19,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:50:19,674 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:19,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:19,770 INFO L93 Difference]: Finished difference Result 70 states and 103 transitions. [2022-04-15 17:50:19,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:50:19,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 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 14 [2022-04-15 17:50:19,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:50:19,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:19,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-04-15 17:50:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:19,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-04-15 17:50:19,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 84 transitions. [2022-04-15 17:50:19,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:50:19,835 INFO L225 Difference]: With dead ends: 70 [2022-04-15 17:50:19,836 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 17:50:19,836 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:50:19,837 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 47 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:50:19,837 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 51 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:50:19,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 17:50:19,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-15 17:50:19,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:50:19,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:19,843 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:19,843 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:19,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:19,845 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-15 17:50:19,845 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-15 17:50:19,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:50:19,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:50:19,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 2 states have call successors, (2), 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 52 states. [2022-04-15 17:50:19,847 INFO L87 Difference]: Start difference. First operand has 52 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 2 states have call successors, (2), 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 52 states. [2022-04-15 17:50:19,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:19,848 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-15 17:50:19,849 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-15 17:50:19,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:50:19,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:50:19,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:50:19,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:50:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2022-04-15 17:50:19,851 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 14 [2022-04-15 17:50:19,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:50:19,851 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2022-04-15 17:50:19,851 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:19,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 71 transitions. [2022-04-15 17:50:19,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:50:19,902 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-15 17:50:19,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 17:50:19,902 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:50:19,902 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:50:19,902 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2022-04-15 17:50:19,903 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:50:19,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:50:19,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1990721020, now seen corresponding path program 1 times [2022-04-15 17:50:19,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:50:19,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [573989943] [2022-04-15 17:50:20,262 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 17:50:20,263 INFO L85 PathProgramCache]: Analyzing trace with hash -335420934, now seen corresponding path program 1 times [2022-04-15 17:50:20,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:50:20,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648418799] [2022-04-15 17:50:20,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:50:20,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:50:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:50:20,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:50:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:50:20,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {705#(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(17, 2);call #Ultimate.allocInit(12, 3); {699#true} is VALID [2022-04-15 17:50:20,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {699#true} assume true; {699#true} is VALID [2022-04-15 17:50:20,300 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {699#true} {699#true} #108#return; {699#true} is VALID [2022-04-15 17:50:20,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {699#true} call ULTIMATE.init(); {705#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:50:20,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {705#(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(17, 2);call #Ultimate.allocInit(12, 3); {699#true} is VALID [2022-04-15 17:50:20,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {699#true} assume true; {699#true} is VALID [2022-04-15 17:50:20,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {699#true} {699#true} #108#return; {699#true} is VALID [2022-04-15 17:50:20,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {699#true} call #t~ret6 := main(); {699#true} is VALID [2022-04-15 17:50:20,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {699#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {699#true} is VALID [2022-04-15 17:50:20,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {699#true} [114] L111-->L30_primed: Formula: (or (= v_main_~s__hit~0_In_2 v_main_~s__hit~0_In_2) (and (= v_main_~s__state~0_Out_4 8512) (= (* v_main_~blastFlag~0_Out_4 8512) (* 2 v_main_~s__state~0_Out_4)) (= 2 v_main_~blastFlag~0_Out_4) (= (* 2 v_main_~s__hit~0_In_2) 0) (= v_main_~s__hit~0_In_2 0))) InVars {main_~s__hit~0=v_main_~s__hit~0_In_2} OutVars{main_~s__state~0=v_main_~s__state~0_Out_4, main_~s__hit~0=v_main_~s__hit~0_In_2, main_~blastFlag~0=v_main_~blastFlag~0_Out_4} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {699#true} is VALID [2022-04-15 17:50:20,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {699#true} [113] L30_primed-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {699#true} is VALID [2022-04-15 17:50:20,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {699#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {699#true} is VALID [2022-04-15 17:50:20,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {699#true} assume !(8466 == ~s__state~0); {699#true} is VALID [2022-04-15 17:50:20,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {699#true} assume !(8512 == ~s__state~0); {699#true} is VALID [2022-04-15 17:50:20,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {699#true} assume !(8640 == ~s__state~0); {699#true} is VALID [2022-04-15 17:50:20,302 INFO L290 TraceCheckUtils]: 12: Hoare triple {699#true} assume 8656 == ~s__state~0; {699#true} is VALID [2022-04-15 17:50:20,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {699#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {704#(= 3 main_~blastFlag~0)} is VALID [2022-04-15 17:50:20,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {704#(= 3 main_~blastFlag~0)} assume !(4 == ~blastFlag~0); {704#(= 3 main_~blastFlag~0)} is VALID [2022-04-15 17:50:20,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {704#(= 3 main_~blastFlag~0)} assume 5 == ~blastFlag~0; {700#false} is VALID [2022-04-15 17:50:20,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {700#false} assume !false; {700#false} is VALID [2022-04-15 17:50:20,306 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:50:20,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:50:20,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648418799] [2022-04-15 17:50:20,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648418799] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:50:20,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:50:20,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:50:20,347 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:50:20,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [573989943] [2022-04-15 17:50:20,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [573989943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:50:20,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:50:20,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 17:50:20,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992965401] [2022-04-15 17:50:20,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:50:20,348 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 17:50:20,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:50:20,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:20,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:50:20,359 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 17:50:20,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:50:20,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 17:50:20,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 17:50:20,360 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:20,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:20,811 INFO L93 Difference]: Finished difference Result 118 states and 168 transitions. [2022-04-15 17:50:20,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 17:50:20,812 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 17:50:20,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:50:20,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:20,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2022-04-15 17:50:20,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:20,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2022-04-15 17:50:20,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 110 transitions. [2022-04-15 17:50:20,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:50:20,883 INFO L225 Difference]: With dead ends: 118 [2022-04-15 17:50:20,883 INFO L226 Difference]: Without dead ends: 72 [2022-04-15 17:50:20,883 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-04-15 17:50:20,884 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 84 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 17:50:20,884 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 48 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 17:50:20,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-15 17:50:20,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2022-04-15 17:50:20,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:50:20,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 65 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 61 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:20,927 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 65 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 61 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:20,927 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 65 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 61 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:20,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:20,929 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2022-04-15 17:50:20,929 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2022-04-15 17:50:20,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:50:20,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:50:20,930 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 61 states have internal predecessors, (80), 2 states have call successors, (2), 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 72 states. [2022-04-15 17:50:20,930 INFO L87 Difference]: Start difference. First operand has 65 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 61 states have internal predecessors, (80), 2 states have call successors, (2), 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 72 states. [2022-04-15 17:50:20,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:20,932 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2022-04-15 17:50:20,932 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2022-04-15 17:50:20,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:50:20,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:50:20,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:50:20,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:50:20,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 61 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:20,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2022-04-15 17:50:20,934 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 21 [2022-04-15 17:50:20,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:50:20,935 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2022-04-15 17:50:20,935 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:20,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 83 transitions. [2022-04-15 17:50:21,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:50:21,016 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2022-04-15 17:50:21,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 17:50:21,016 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:50:21,017 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 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:50:21,017 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 17:50:21,017 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:50:21,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:50:21,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1357620209, now seen corresponding path program 1 times [2022-04-15 17:50:21,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:50:21,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [669561531] [2022-04-15 17:50:21,299 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 17:50:21,299 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 17:50:21,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1357620209, now seen corresponding path program 2 times [2022-04-15 17:50:21,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:50:21,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112164514] [2022-04-15 17:50:21,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:50:21,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:50:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:50:21,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:50:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:50:21,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {1245#(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(17, 2);call #Ultimate.allocInit(12, 3); {1239#true} is VALID [2022-04-15 17:50:21,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {1239#true} assume true; {1239#true} is VALID [2022-04-15 17:50:21,344 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1239#true} {1239#true} #108#return; {1239#true} is VALID [2022-04-15 17:50:21,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {1239#true} call ULTIMATE.init(); {1245#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:50:21,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {1245#(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(17, 2);call #Ultimate.allocInit(12, 3); {1239#true} is VALID [2022-04-15 17:50:21,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {1239#true} assume true; {1239#true} is VALID [2022-04-15 17:50:21,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1239#true} {1239#true} #108#return; {1239#true} is VALID [2022-04-15 17:50:21,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {1239#true} call #t~ret6 := main(); {1239#true} is VALID [2022-04-15 17:50:21,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {1239#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {1239#true} is VALID [2022-04-15 17:50:21,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {1239#true} assume !false; {1239#true} is VALID [2022-04-15 17:50:21,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {1239#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1239#true} is VALID [2022-04-15 17:50:21,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {1239#true} assume 8466 == ~s__state~0; {1239#true} is VALID [2022-04-15 17:50:21,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {1239#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 2; {1239#true} is VALID [2022-04-15 17:50:21,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {1239#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {1244#(not (= main_~s__hit~0 0))} is VALID [2022-04-15 17:50:21,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {1244#(not (= main_~s__hit~0 0))} assume !false; {1244#(not (= main_~s__hit~0 0))} is VALID [2022-04-15 17:50:21,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {1244#(not (= main_~s__hit~0 0))} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1244#(not (= main_~s__hit~0 0))} is VALID [2022-04-15 17:50:21,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {1244#(not (= main_~s__hit~0 0))} assume !(8466 == ~s__state~0); {1244#(not (= main_~s__hit~0 0))} is VALID [2022-04-15 17:50:21,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {1244#(not (= main_~s__hit~0 0))} assume !(8512 == ~s__state~0); {1244#(not (= main_~s__hit~0 0))} is VALID [2022-04-15 17:50:21,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {1244#(not (= main_~s__hit~0 0))} assume !(8640 == ~s__state~0); {1244#(not (= main_~s__hit~0 0))} is VALID [2022-04-15 17:50:21,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {1244#(not (= main_~s__hit~0 0))} assume 8656 == ~s__state~0; {1244#(not (= main_~s__hit~0 0))} is VALID [2022-04-15 17:50:21,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {1244#(not (= main_~s__hit~0 0))} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {1244#(not (= main_~s__hit~0 0))} is VALID [2022-04-15 17:50:21,348 INFO L290 TraceCheckUtils]: 18: Hoare triple {1244#(not (= main_~s__hit~0 0))} assume !(4 == ~blastFlag~0); {1244#(not (= main_~s__hit~0 0))} is VALID [2022-04-15 17:50:21,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {1244#(not (= main_~s__hit~0 0))} assume !(5 == ~blastFlag~0); {1244#(not (= main_~s__hit~0 0))} is VALID [2022-04-15 17:50:21,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {1244#(not (= main_~s__hit~0 0))} assume 0 != ~s__hit~0;~s__state~0 := 8640; {1244#(not (= main_~s__hit~0 0))} is VALID [2022-04-15 17:50:21,349 INFO L290 TraceCheckUtils]: 21: Hoare triple {1244#(not (= main_~s__hit~0 0))} assume !false; {1244#(not (= main_~s__hit~0 0))} is VALID [2022-04-15 17:50:21,349 INFO L290 TraceCheckUtils]: 22: Hoare triple {1244#(not (= main_~s__hit~0 0))} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1244#(not (= main_~s__hit~0 0))} is VALID [2022-04-15 17:50:21,350 INFO L290 TraceCheckUtils]: 23: Hoare triple {1244#(not (= main_~s__hit~0 0))} assume !(8466 == ~s__state~0); {1244#(not (= main_~s__hit~0 0))} is VALID [2022-04-15 17:50:21,350 INFO L290 TraceCheckUtils]: 24: Hoare triple {1244#(not (= main_~s__hit~0 0))} assume !(8512 == ~s__state~0); {1244#(not (= main_~s__hit~0 0))} is VALID [2022-04-15 17:50:21,350 INFO L290 TraceCheckUtils]: 25: Hoare triple {1244#(not (= main_~s__hit~0 0))} assume 8640 == ~s__state~0; {1244#(not (= main_~s__hit~0 0))} is VALID [2022-04-15 17:50:21,351 INFO L290 TraceCheckUtils]: 26: Hoare triple {1244#(not (= main_~s__hit~0 0))} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {1244#(not (= main_~s__hit~0 0))} is VALID [2022-04-15 17:50:21,351 INFO L290 TraceCheckUtils]: 27: Hoare triple {1244#(not (= main_~s__hit~0 0))} assume !(0 != ~s__hit~0);~s__state~0 := 8656; {1240#false} is VALID [2022-04-15 17:50:21,351 INFO L290 TraceCheckUtils]: 28: Hoare triple {1240#false} assume !false; {1240#false} is VALID [2022-04-15 17:50:21,351 INFO L290 TraceCheckUtils]: 29: Hoare triple {1240#false} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1240#false} is VALID [2022-04-15 17:50:21,351 INFO L290 TraceCheckUtils]: 30: Hoare triple {1240#false} assume !(8466 == ~s__state~0); {1240#false} is VALID [2022-04-15 17:50:21,351 INFO L290 TraceCheckUtils]: 31: Hoare triple {1240#false} assume 8512 == ~s__state~0; {1240#false} is VALID [2022-04-15 17:50:21,352 INFO L290 TraceCheckUtils]: 32: Hoare triple {1240#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~tmp___1~0 := #t~nondet5;havoc #t~nondet5; {1240#false} is VALID [2022-04-15 17:50:21,352 INFO L290 TraceCheckUtils]: 33: Hoare triple {1240#false} assume 0 != ~tmp___1~0;~s__state~0 := 8466; {1240#false} is VALID [2022-04-15 17:50:21,352 INFO L290 TraceCheckUtils]: 34: Hoare triple {1240#false} assume !false; {1240#false} is VALID [2022-04-15 17:50:21,352 INFO L290 TraceCheckUtils]: 35: Hoare triple {1240#false} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {1240#false} is VALID [2022-04-15 17:50:21,352 INFO L290 TraceCheckUtils]: 36: Hoare triple {1240#false} assume !false; {1240#false} is VALID [2022-04-15 17:50:21,352 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 17:50:21,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:50:21,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112164514] [2022-04-15 17:50:21,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112164514] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:50:21,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:50:21,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:50:21,353 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:50:21,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [669561531] [2022-04-15 17:50:21,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [669561531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:50:21,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:50:21,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:50:21,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264123060] [2022-04-15 17:50:21,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:50:21,354 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 37 [2022-04-15 17:50:21,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:50:21,354 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 17:50:21,369 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 17:50:21,370 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:50:21,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:50:21,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:50:21,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:50:21,370 INFO L87 Difference]: Start difference. First operand 65 states and 83 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 17:50:21,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:21,474 INFO L93 Difference]: Finished difference Result 117 states and 148 transitions. [2022-04-15 17:50:21,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:50:21,475 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 37 [2022-04-15 17:50:21,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:50:21,475 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 17:50:21,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-04-15 17:50:21,476 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 17:50:21,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-04-15 17:50:21,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 79 transitions. [2022-04-15 17:50:21,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:50:21,524 INFO L225 Difference]: With dead ends: 117 [2022-04-15 17:50:21,524 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 17:50:21,525 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:50:21,525 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 43 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:50:21,526 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 44 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:50:21,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 17:50:21,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 17:50:21,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:50:21,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 17:50:21,526 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 17:50:21,527 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 17:50:21,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:21,527 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 17:50:21,527 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 17:50:21,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:50:21,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:50:21,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 17:50:21,527 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 17:50:21,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:21,527 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 17:50:21,527 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 17:50:21,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:50:21,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:50:21,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:50:21,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:50:21,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 17:50:21,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 17:50:21,528 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2022-04-15 17:50:21,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:50:21,528 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 17:50:21,528 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 17:50:21,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 17:50:21,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:50:21,528 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 17:50:21,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:50:21,530 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 17:50:21,531 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 17:50:21,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 17:50:21,825 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 13) no Hoare annotation was computed. [2022-04-15 17:50:21,825 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 13) no Hoare annotation was computed. [2022-04-15 17:50:21,825 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 13) no Hoare annotation was computed. [2022-04-15 17:50:21,825 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 20 152) the Hoare annotation is: true [2022-04-15 17:50:21,825 INFO L878 garLoopResultBuilder]: At program point L89-1(lines 65 118) the Hoare annotation is: (or (= 2 main_~blastFlag~0) (and (not (= main_~s__hit~0 0)) (or (not (< 2 main_~blastFlag~0)) (not (<= main_~s__state~0 8512))))) [2022-04-15 17:50:21,825 INFO L878 garLoopResultBuilder]: At program point L81(lines 81 85) the Hoare annotation is: (= 2 main_~blastFlag~0) [2022-04-15 17:50:21,826 INFO L878 garLoopResultBuilder]: At program point L36(lines 36 139) the Hoare annotation is: (or (and (= main_~blastFlag~0 0) (= 8466 main_~s__state~0)) (= 2 main_~blastFlag~0) (and (= 3 main_~blastFlag~0) (not (= main_~s__hit~0 0)) (not (<= main_~s__state~0 8512)))) [2022-04-15 17:50:21,826 INFO L878 garLoopResultBuilder]: At program point L69-1(lines 65 118) the Hoare annotation is: (and (= 8466 main_~s__state~0) (= 2 main_~blastFlag~0)) [2022-04-15 17:50:21,826 INFO L878 garLoopResultBuilder]: At program point L61(lines 61 120) the Hoare annotation is: (or (= 2 main_~blastFlag~0) (and (= 3 main_~blastFlag~0) (not (= main_~s__hit~0 0)) (not (<= main_~s__state~0 8512)))) [2022-04-15 17:50:21,826 INFO L878 garLoopResultBuilder]: At program point L57(lines 57 122) the Hoare annotation is: (or (= 2 main_~blastFlag~0) (and (= 3 main_~blastFlag~0) (not (= main_~s__hit~0 0)) (not (<= main_~s__state~0 8512)))) [2022-04-15 17:50:21,826 INFO L885 garLoopResultBuilder]: At program point L148(lines 20 152) the Hoare annotation is: true [2022-04-15 17:50:21,826 INFO L878 garLoopResultBuilder]: At program point L111(lines 29 146) the Hoare annotation is: (or (and (= main_~blastFlag~0 0) (= 8466 main_~s__state~0)) (= 2 main_~blastFlag~0) (and (= 3 main_~blastFlag~0) (not (= main_~s__hit~0 0)) (not (<= main_~s__state~0 8512)))) [2022-04-15 17:50:21,826 INFO L878 garLoopResultBuilder]: At program point L107(lines 107 109) the Hoare annotation is: (= 3 main_~blastFlag~0) [2022-04-15 17:50:21,826 INFO L878 garLoopResultBuilder]: At program point L41(lines 41 136) the Hoare annotation is: (or (= 2 main_~blastFlag~0) (and (= 3 main_~blastFlag~0) (not (= main_~s__hit~0 0)) (not (<= main_~s__state~0 8512)))) [2022-04-15 17:50:21,826 INFO L878 garLoopResultBuilder]: At program point L37(lines 36 139) the Hoare annotation is: (let ((.cse0 (= 8466 main_~s__state~0))) (or (and .cse0 (= 2 main_~blastFlag~0)) (and (= main_~blastFlag~0 0) .cse0))) [2022-04-15 17:50:21,826 INFO L878 garLoopResultBuilder]: At program point L62(lines 61 120) the Hoare annotation is: (or (= 2 main_~blastFlag~0) (and (= 3 main_~blastFlag~0) (not (= main_~s__hit~0 0)) (not (<= main_~s__state~0 8512)))) [2022-04-15 17:50:21,826 INFO L878 garLoopResultBuilder]: At program point L58(lines 57 122) the Hoare annotation is: (or (= 2 main_~blastFlag~0) (and (= 3 main_~blastFlag~0) (not (= main_~s__hit~0 0)) (not (<= main_~s__state~0 8512)))) [2022-04-15 17:50:21,826 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 20 152) the Hoare annotation is: true [2022-04-15 17:50:21,827 INFO L878 garLoopResultBuilder]: At program point L108(lines 20 152) the Hoare annotation is: false [2022-04-15 17:50:21,827 INFO L878 garLoopResultBuilder]: At program point L42(lines 41 136) the Hoare annotation is: (= 2 main_~blastFlag~0) [2022-04-15 17:50:21,827 INFO L878 garLoopResultBuilder]: At program point L104-1(lines 65 118) the Hoare annotation is: (= 3 main_~blastFlag~0) [2022-04-15 17:50:21,827 INFO L878 garLoopResultBuilder]: At program point L100-1(lines 65 118) the Hoare annotation is: (= 3 main_~blastFlag~0) [2022-04-15 17:50:21,827 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 150) the Hoare annotation is: false [2022-04-15 17:50:21,827 INFO L878 garLoopResultBuilder]: At program point L30(line 30) the Hoare annotation is: (or (and (= main_~blastFlag~0 0) (= 8466 main_~s__state~0)) (= 2 main_~blastFlag~0) (and (= 3 main_~blastFlag~0) (not (= main_~s__hit~0 0)) (not (<= main_~s__state~0 8512)))) [2022-04-15 17:50:21,827 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 20 152) the Hoare annotation is: true [2022-04-15 17:50:21,827 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 17:50:21,827 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 17:50:21,827 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 17:50:21,827 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 17:50:21,828 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 17:50:21,828 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 17:50:21,828 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 17:50:21,830 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1] [2022-04-15 17:50:21,830 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 17:50:21,832 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 17:50:21,835 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 17:50:21,846 INFO L163 areAnnotationChecker]: CFG has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 17:50:21,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 05:50:21 BoogieIcfgContainer [2022-04-15 17:50:21,853 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 17:50:21,854 INFO L158 Benchmark]: Toolchain (without parser) took 6317.36ms. Allocated memory was 183.5MB in the beginning and 220.2MB in the end (delta: 36.7MB). Free memory was 135.4MB in the beginning and 75.1MB in the end (delta: 60.3MB). Peak memory consumption was 98.0MB. Max. memory is 8.0GB. [2022-04-15 17:50:21,854 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory is still 151.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 17:50:21,854 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.45ms. Allocated memory is still 183.5MB. Free memory was 135.2MB in the beginning and 160.1MB in the end (delta: -24.9MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2022-04-15 17:50:21,854 INFO L158 Benchmark]: Boogie Preprocessor took 50.17ms. Allocated memory is still 183.5MB. Free memory was 160.1MB in the beginning and 158.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 17:50:21,854 INFO L158 Benchmark]: RCFGBuilder took 247.13ms. Allocated memory is still 183.5MB. Free memory was 158.4MB in the beginning and 147.0MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 17:50:21,855 INFO L158 Benchmark]: TraceAbstraction took 5825.72ms. Allocated memory was 183.5MB in the beginning and 220.2MB in the end (delta: 36.7MB). Free memory was 146.4MB in the beginning and 75.1MB in the end (delta: 71.4MB). Peak memory consumption was 109.1MB. Max. memory is 8.0GB. [2022-04-15 17:50:21,855 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory is still 151.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 178.45ms. Allocated memory is still 183.5MB. Free memory was 135.2MB in the beginning and 160.1MB in the end (delta: -24.9MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.17ms. Allocated memory is still 183.5MB. Free memory was 160.1MB in the beginning and 158.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 247.13ms. Allocated memory is still 183.5MB. Free memory was 158.4MB in the beginning and 147.0MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5825.72ms. Allocated memory was 183.5MB in the beginning and 220.2MB in the end (delta: 36.7MB). Free memory was 146.4MB in the beginning and 75.1MB in the end (delta: 71.4MB). Peak memory consumption was 109.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 150]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 4, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 253 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 253 mSDsluCounter, 187 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 293 IncrementalHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 137 mSDtfsCounter, 293 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 93 NumberOfFragments, 223 HoareAnnotationTreeSize, 29 FomulaSimplifications, 435 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 29 FomulaSimplificationsInter, 272 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: 2 == blastFlag - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((blastFlag == 0 && 8466 == s__state) || 2 == blastFlag) || ((3 == blastFlag && !(s__hit == 0)) && !(s__state <= 8512)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: 2 == blastFlag || ((3 == blastFlag && !(s__hit == 0)) && !(s__state <= 8512)) - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: 2 == blastFlag || ((3 == blastFlag && !(s__hit == 0)) && !(s__state <= 8512)) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (8466 == s__state && 2 == blastFlag) || (blastFlag == 0 && 8466 == s__state) - ProcedureContractResult [Line: 20]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 17:50:21,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...