/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_1b.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:17:04,749 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:17:04,751 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:17:04,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:17:04,794 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:17:04,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:17:04,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:17:04,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:17:04,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:17:04,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:17:04,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:17:04,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:17:04,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:17:04,814 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:17:04,815 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:17:04,817 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:17:04,818 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:17:04,818 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:17:04,824 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:17:04,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:17:04,830 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:17:04,831 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:17:04,832 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:17:04,833 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:17:04,834 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:17:04,839 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:17:04,840 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:17:04,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:17:04,841 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:17:04,841 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:17:04,842 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:17:04,843 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:17:04,844 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:17:04,845 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:17:04,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:17:04,846 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:17:04,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:17:04,847 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:17:04,847 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:17:04,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:17:04,848 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:17:04,849 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:17:04,850 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 08:17:04,859 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:17:04,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:17:04,860 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:17:04,860 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:17:04,860 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:17:04,860 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:17:04,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:17:04,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:17:04,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:17:04,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:17:04,862 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:17:04,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:17:04,862 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:17:04,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:17:04,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:17:04,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:17:04,862 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:17:04,862 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:17:04,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:17:04,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:17:04,863 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:17:04,863 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:17:04,863 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:17:04,863 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:17:04,863 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:17:04,863 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-08 08:17:05,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:17:05,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:17:05,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:17:05,090 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:17:05,091 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:17:05,092 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-08 08:17:05,146 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e31a4c3b1/3a23462eca224b10a4ea33c78d57d222/FLAGb467e5cbd [2022-04-08 08:17:05,484 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:17:05,484 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1b.cil.c [2022-04-08 08:17:05,492 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e31a4c3b1/3a23462eca224b10a4ea33c78d57d222/FLAGb467e5cbd [2022-04-08 08:17:05,918 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e31a4c3b1/3a23462eca224b10a4ea33c78d57d222 [2022-04-08 08:17:05,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:17:05,923 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:17:05,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:17:05,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:17:05,929 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:17:05,930 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:17:05" (1/1) ... [2022-04-08 08:17:05,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a84669c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:05, skipping insertion in model container [2022-04-08 08:17:05,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:17:05" (1/1) ... [2022-04-08 08:17:05,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:17:05,960 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:17:06,103 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-08 08:17:06,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:17:06,113 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:17:06,129 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-08 08:17:06,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:17:06,140 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:17:06,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:06 WrapperNode [2022-04-08 08:17:06,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:17:06,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:17:06,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:17:06,142 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:17:06,149 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:06" (1/1) ... [2022-04-08 08:17:06,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:06" (1/1) ... [2022-04-08 08:17:06,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:06" (1/1) ... [2022-04-08 08:17:06,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:06" (1/1) ... [2022-04-08 08:17:06,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:06" (1/1) ... [2022-04-08 08:17:06,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:06" (1/1) ... [2022-04-08 08:17:06,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:06" (1/1) ... [2022-04-08 08:17:06,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:17:06,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:17:06,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:17:06,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:17:06,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:06" (1/1) ... [2022-04-08 08:17:06,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:17:06,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:17:06,198 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-08 08:17:06,201 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-08 08:17:06,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:17:06,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:17:06,229 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:17:06,229 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:17:06,229 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:17:06,229 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:17:06,229 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:17:06,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:17:06,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 08:17:06,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:17:06,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 08:17:06,230 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:17:06,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:17:06,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:17:06,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:17:06,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:17:06,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:17:06,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:17:06,287 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:17:06,288 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:17:06,429 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:17:06,434 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:17:06,435 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 08:17:06,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:17:06 BoogieIcfgContainer [2022-04-08 08:17:06,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:17:06,438 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:17:06,438 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:17:06,450 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:17:06,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:17:05" (1/3) ... [2022-04-08 08:17:06,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58b69c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:17:06, skipping insertion in model container [2022-04-08 08:17:06,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:06" (2/3) ... [2022-04-08 08:17:06,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58b69c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:17:06, skipping insertion in model container [2022-04-08 08:17:06,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:17:06" (3/3) ... [2022-04-08 08:17:06,454 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1b.cil.c [2022-04-08 08:17:06,467 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:17:06,468 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:17:06,498 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:17:06,503 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-08 08:17:06,504 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:17:06,520 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-08 08:17:06,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-08 08:17:06,525 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:06,526 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:06,526 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:06,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:06,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1468663722, now seen corresponding path program 1 times [2022-04-08 08:17:06,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:06,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2010402332] [2022-04-08 08:17:06,548 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:06,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1468663722, now seen corresponding path program 2 times [2022-04-08 08:17:06,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:06,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407180812] [2022-04-08 08:17:06,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:06,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:06,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:06,798 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-08 08:17:06,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 08:17:06,799 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #108#return; {32#true} is VALID [2022-04-08 08:17:06,804 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-08 08:17:06,804 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-08 08:17:06,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 08:17:06,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #108#return; {32#true} is VALID [2022-04-08 08:17:06,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-08 08:17:06,806 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-08 08:17:06,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {37#(= main_~blastFlag~0 0)} assume !false; {37#(= main_~blastFlag~0 0)} is VALID [2022-04-08 08:17:06,809 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-08 08:17:06,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-08 08:17:06,809 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-08 08:17:06,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:06,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407180812] [2022-04-08 08:17:06,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407180812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:06,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:06,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:06,816 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:06,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2010402332] [2022-04-08 08:17:06,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2010402332] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:06,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:06,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:06,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201370590] [2022-04-08 08:17:06,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:06,823 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-08 08:17:06,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:06,827 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-08 08:17:06,850 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-08 08:17:06,851 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:06,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:06,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:06,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:06,876 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-08 08:17:07,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:07,135 INFO L93 Difference]: Finished difference Result 70 states and 115 transitions. [2022-04-08 08:17:07,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:07,136 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-08 08:17:07,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:07,137 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-08 08:17:07,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-08 08:17:07,155 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-08 08:17:07,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-08 08:17:07,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-08 08:17:07,276 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-08 08:17:07,284 INFO L225 Difference]: With dead ends: 70 [2022-04-08 08:17:07,284 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 08:17:07,286 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-08 08:17:07,289 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 79 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:07,289 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.1s Time] [2022-04-08 08:17:07,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 08:17:07,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-08 08:17:07,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:07,317 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-08 08:17:07,318 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-08 08:17:07,319 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-08 08:17:07,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:07,324 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-04-08 08:17:07,324 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-04-08 08:17:07,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:07,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:07,325 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-08 08:17:07,326 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-08 08:17:07,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:07,329 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-04-08 08:17:07,330 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-04-08 08:17:07,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:07,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:07,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:07,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:07,332 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-08 08:17:07,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-04-08 08:17:07,336 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 9 [2022-04-08 08:17:07,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:07,336 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2022-04-08 08:17:07,337 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-08 08:17:07,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 53 transitions. [2022-04-08 08:17:07,388 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-08 08:17:07,388 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-04-08 08:17:07,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 08:17:07,389 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:07,391 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:07,392 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:17:07,396 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:07,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:07,398 INFO L85 PathProgramCache]: Analyzing trace with hash -968056640, now seen corresponding path program 1 times [2022-04-08 08:17:07,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:07,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [379180782] [2022-04-08 08:17:07,500 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:17:07,659 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:17:07,660 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:17:07,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1182342647, now seen corresponding path program 1 times [2022-04-08 08:17:07,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:07,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457324640] [2022-04-08 08:17:07,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:07,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:07,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:07,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {346#(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-08 08:17:07,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {339#true} assume true; {339#true} is VALID [2022-04-08 08:17:07,733 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {339#true} {339#true} #108#return; {339#true} is VALID [2022-04-08 08:17:07,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {339#true} call ULTIMATE.init(); {346#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:07,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {346#(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-08 08:17:07,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {339#true} assume true; {339#true} is VALID [2022-04-08 08:17:07,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {339#true} {339#true} #108#return; {339#true} is VALID [2022-04-08 08:17:07,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {339#true} call #t~ret6 := main(); {339#true} is VALID [2022-04-08 08:17:07,735 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; {344#(= main_~blastFlag~0 0)} is VALID [2022-04-08 08:17:07,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {344#(= main_~blastFlag~0 0)} [112] L111-->L30_primed: Formula: (let ((.cse0 (= v_main_~blastFlag~0_20 v_main_~blastFlag~0_19)) (.cse1 (= v_main_~s__state~0_21 v_main_~s__state~0_20))) (or (and .cse0 .cse1 (= v_main_~s__hit~0_8 v_main_~s__hit~0_8)) (and .cse0 .cse1))) InVars {main_~s__state~0=v_main_~s__state~0_21, main_~s__hit~0=v_main_~s__hit~0_8, main_~blastFlag~0=v_main_~blastFlag~0_20} OutVars{main_~s__state~0=v_main_~s__state~0_20, main_~s__hit~0=v_main_~s__hit~0_8, main_~blastFlag~0=v_main_~blastFlag~0_19} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {344#(= main_~blastFlag~0 0)} is VALID [2022-04-08 08:17:07,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {344#(= main_~blastFlag~0 0)} [113] L30_primed-->L111: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {344#(= main_~blastFlag~0 0)} is VALID [2022-04-08 08:17:07,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {344#(= main_~blastFlag~0 0)} [114] L111-->L30_primed: Formula: (let ((.cse3 (= v_main_~blastFlag~0_20 v_main_~blastFlag~0_19)) (.cse4 (= v_main_~s__state~0_21 v_main_~s__state~0_20)) (.cse2 (= v_main_~s__state~0_21 8466)) (.cse0 (= v_main_~s__hit~0_8 0)) (.cse1 (= v_main_~blastFlag~0_20 0))) (or (and (or (not .cse0) (not .cse1) (not .cse2)) .cse3 .cse4) (and .cse3 .cse4 (= v_main_~s__hit~0_8 v_main_~s__hit~0_8)) (and (= 2 v_main_~blastFlag~0_19) .cse2 (= v_main_~s__state~0_20 8512) .cse0 .cse1))) InVars {main_~s__state~0=v_main_~s__state~0_21, main_~s__hit~0=v_main_~s__hit~0_8, main_~blastFlag~0=v_main_~blastFlag~0_20} OutVars{main_~s__state~0=v_main_~s__state~0_20, main_~s__hit~0=v_main_~s__hit~0_8, main_~blastFlag~0=v_main_~blastFlag~0_19} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {345#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:07,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {345#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0))} [111] L30_primed-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {345#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:07,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {345#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0))} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {340#false} is VALID [2022-04-08 08:17:07,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {340#false} assume !false; {340#false} is VALID [2022-04-08 08:17:07,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 08:17:07,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:07,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457324640] [2022-04-08 08:17:07,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457324640] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:17:07,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619883575] [2022-04-08 08:17:07,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:07,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:17:07,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:17:07,742 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:17:07,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 08:17:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:07,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 08:17:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:07,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:17:07,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {339#true} call ULTIMATE.init(); {339#true} is VALID [2022-04-08 08:17:08,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {339#true} #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-08 08:17:08,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {339#true} assume true; {339#true} is VALID [2022-04-08 08:17:08,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {339#true} {339#true} #108#return; {339#true} is VALID [2022-04-08 08:17:08,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {339#true} call #t~ret6 := main(); {339#true} is VALID [2022-04-08 08:17:08,001 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; {365#(<= main_~blastFlag~0 0)} is VALID [2022-04-08 08:17:08,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {365#(<= main_~blastFlag~0 0)} [112] L111-->L30_primed: Formula: (let ((.cse0 (= v_main_~blastFlag~0_20 v_main_~blastFlag~0_19)) (.cse1 (= v_main_~s__state~0_21 v_main_~s__state~0_20))) (or (and .cse0 .cse1 (= v_main_~s__hit~0_8 v_main_~s__hit~0_8)) (and .cse0 .cse1))) InVars {main_~s__state~0=v_main_~s__state~0_21, main_~s__hit~0=v_main_~s__hit~0_8, main_~blastFlag~0=v_main_~blastFlag~0_20} OutVars{main_~s__state~0=v_main_~s__state~0_20, main_~s__hit~0=v_main_~s__hit~0_8, main_~blastFlag~0=v_main_~blastFlag~0_19} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {365#(<= main_~blastFlag~0 0)} is VALID [2022-04-08 08:17:08,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {365#(<= main_~blastFlag~0 0)} [113] L30_primed-->L111: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {365#(<= main_~blastFlag~0 0)} is VALID [2022-04-08 08:17:08,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {365#(<= main_~blastFlag~0 0)} [114] L111-->L30_primed: Formula: (let ((.cse3 (= v_main_~blastFlag~0_20 v_main_~blastFlag~0_19)) (.cse4 (= v_main_~s__state~0_21 v_main_~s__state~0_20)) (.cse2 (= v_main_~s__state~0_21 8466)) (.cse0 (= v_main_~s__hit~0_8 0)) (.cse1 (= v_main_~blastFlag~0_20 0))) (or (and (or (not .cse0) (not .cse1) (not .cse2)) .cse3 .cse4) (and .cse3 .cse4 (= v_main_~s__hit~0_8 v_main_~s__hit~0_8)) (and (= 2 v_main_~blastFlag~0_19) .cse2 (= v_main_~s__state~0_20 8512) .cse0 .cse1))) InVars {main_~s__state~0=v_main_~s__state~0_21, main_~s__hit~0=v_main_~s__hit~0_8, main_~blastFlag~0=v_main_~blastFlag~0_20} OutVars{main_~s__state~0=v_main_~s__state~0_20, main_~s__hit~0=v_main_~s__hit~0_8, main_~blastFlag~0=v_main_~blastFlag~0_19} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {375#(or (= 2 main_~blastFlag~0) (<= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:08,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {375#(or (= 2 main_~blastFlag~0) (<= main_~blastFlag~0 0))} [111] L30_primed-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {375#(or (= 2 main_~blastFlag~0) (<= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:08,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {375#(or (= 2 main_~blastFlag~0) (<= main_~blastFlag~0 0))} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {340#false} is VALID [2022-04-08 08:17:08,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {340#false} assume !false; {340#false} is VALID [2022-04-08 08:17:08,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 08:17:08,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:17:08,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {340#false} assume !false; {340#false} is VALID [2022-04-08 08:17:08,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {388#(not (< 2 main_~blastFlag~0))} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {340#false} is VALID [2022-04-08 08:17:08,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {388#(not (< 2 main_~blastFlag~0))} [111] L30_primed-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {388#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:08,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {388#(not (< 2 main_~blastFlag~0))} [114] L111-->L30_primed: Formula: (let ((.cse3 (= v_main_~blastFlag~0_20 v_main_~blastFlag~0_19)) (.cse4 (= v_main_~s__state~0_21 v_main_~s__state~0_20)) (.cse2 (= v_main_~s__state~0_21 8466)) (.cse0 (= v_main_~s__hit~0_8 0)) (.cse1 (= v_main_~blastFlag~0_20 0))) (or (and (or (not .cse0) (not .cse1) (not .cse2)) .cse3 .cse4) (and .cse3 .cse4 (= v_main_~s__hit~0_8 v_main_~s__hit~0_8)) (and (= 2 v_main_~blastFlag~0_19) .cse2 (= v_main_~s__state~0_20 8512) .cse0 .cse1))) InVars {main_~s__state~0=v_main_~s__state~0_21, main_~s__hit~0=v_main_~s__hit~0_8, main_~blastFlag~0=v_main_~blastFlag~0_20} OutVars{main_~s__state~0=v_main_~s__state~0_20, main_~s__hit~0=v_main_~s__hit~0_8, main_~blastFlag~0=v_main_~blastFlag~0_19} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {388#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:08,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {388#(not (< 2 main_~blastFlag~0))} [113] L30_primed-->L111: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {388#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:08,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {388#(not (< 2 main_~blastFlag~0))} [112] L111-->L30_primed: Formula: (let ((.cse0 (= v_main_~blastFlag~0_20 v_main_~blastFlag~0_19)) (.cse1 (= v_main_~s__state~0_21 v_main_~s__state~0_20))) (or (and .cse0 .cse1 (= v_main_~s__hit~0_8 v_main_~s__hit~0_8)) (and .cse0 .cse1))) InVars {main_~s__state~0=v_main_~s__state~0_21, main_~s__hit~0=v_main_~s__hit~0_8, main_~blastFlag~0=v_main_~blastFlag~0_20} OutVars{main_~s__state~0=v_main_~s__state~0_20, main_~s__hit~0=v_main_~s__hit~0_8, main_~blastFlag~0=v_main_~blastFlag~0_19} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {388#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:08,128 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; {388#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:08,129 INFO L272 TraceCheckUtils]: 4: Hoare triple {339#true} call #t~ret6 := main(); {339#true} is VALID [2022-04-08 08:17:08,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {339#true} {339#true} #108#return; {339#true} is VALID [2022-04-08 08:17:08,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {339#true} assume true; {339#true} is VALID [2022-04-08 08:17:08,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {339#true} #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-08 08:17:08,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {339#true} call ULTIMATE.init(); {339#true} is VALID [2022-04-08 08:17:08,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 08:17:08,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619883575] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 08:17:08,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 08:17:08,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4] total 8 [2022-04-08 08:17:08,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:08,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [379180782] [2022-04-08 08:17:08,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [379180782] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:08,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:08,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:17:08,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480019090] [2022-04-08 08:17:08,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:08,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 1 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-08 08:17:08,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:08,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:08,250 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-08 08:17:08,250 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 08:17:08,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:08,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 08:17:08,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-04-08 08:17:08,251 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:08,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:08,551 INFO L93 Difference]: Finished difference Result 92 states and 139 transitions. [2022-04-08 08:17:08,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 08:17:08,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 1 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-08 08:17:08,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:08,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:08,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2022-04-08 08:17:08,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:08,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2022-04-08 08:17:08,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 115 transitions. [2022-04-08 08:17:08,657 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-08 08:17:08,659 INFO L225 Difference]: With dead ends: 92 [2022-04-08 08:17:08,659 INFO L226 Difference]: Without dead ends: 59 [2022-04-08 08:17:08,660 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-04-08 08:17:08,661 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 35 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:08,662 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 75 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:17:08,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-08 08:17:08,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-08 08:17:08,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:08,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 58 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:08,682 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 58 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:08,683 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 58 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:08,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:08,689 INFO L93 Difference]: Finished difference Result 59 states and 79 transitions. [2022-04-08 08:17:08,689 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 79 transitions. [2022-04-08 08:17:08,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:08,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:08,690 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 2 states have call successors, (2), 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 59 states. [2022-04-08 08:17:08,691 INFO L87 Difference]: Start difference. First operand has 58 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 2 states have call successors, (2), 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 59 states. [2022-04-08 08:17:08,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:08,695 INFO L93 Difference]: Finished difference Result 59 states and 79 transitions. [2022-04-08 08:17:08,695 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 79 transitions. [2022-04-08 08:17:08,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:08,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:08,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:08,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:08,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:08,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2022-04-08 08:17:08,706 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 14 [2022-04-08 08:17:08,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:08,706 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2022-04-08 08:17:08,707 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:08,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 77 transitions. [2022-04-08 08:17:08,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:08,774 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2022-04-08 08:17:08,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 08:17:08,779 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:08,779 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-08 08:17:08,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 08:17:09,010 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:17:09,010 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:09,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:09,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1603181698, now seen corresponding path program 1 times [2022-04-08 08:17:09,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:09,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [830896088] [2022-04-08 08:17:09,123 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:17:09,159 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:17:09,159 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:17:09,160 INFO L85 PathProgramCache]: Analyzing trace with hash 704883611, now seen corresponding path program 1 times [2022-04-08 08:17:09,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:09,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850016563] [2022-04-08 08:17:09,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:09,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:09,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:09,210 INFO L290 TraceCheckUtils]: 0: Hoare triple {848#(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); {842#true} is VALID [2022-04-08 08:17:09,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {842#true} assume true; {842#true} is VALID [2022-04-08 08:17:09,210 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {842#true} {842#true} #108#return; {842#true} is VALID [2022-04-08 08:17:09,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {842#true} call ULTIMATE.init(); {848#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:09,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {848#(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); {842#true} is VALID [2022-04-08 08:17:09,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {842#true} assume true; {842#true} is VALID [2022-04-08 08:17:09,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {842#true} {842#true} #108#return; {842#true} is VALID [2022-04-08 08:17:09,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {842#true} call #t~ret6 := main(); {842#true} is VALID [2022-04-08 08:17:09,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {842#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; {842#true} is VALID [2022-04-08 08:17:09,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {842#true} [116] L111-->L30_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_37 v_main_~s__state~0_36)) (.cse1 (= v_main_~blastFlag~0_36 v_main_~blastFlag~0_35)) (.cse4 (= v_main_~s__state~0_37 8466)) (.cse3 (= v_main_~s__hit~0_12 0)) (.cse2 (= v_main_~blastFlag~0_36 0))) (or (and .cse0 (= v_main_~s__hit~0_12 v_main_~s__hit~0_12) .cse1) (and .cse0 .cse1 (or (not .cse2) .cse3 (not .cse4))) (and (= 2 v_main_~blastFlag~0_35) (= v_main_~s__state~0_36 8656) .cse4 (not .cse3) .cse2))) InVars {main_~s__state~0=v_main_~s__state~0_37, main_~s__hit~0=v_main_~s__hit~0_12, main_~blastFlag~0=v_main_~blastFlag~0_36} OutVars{main_~s__state~0=v_main_~s__state~0_36, main_~s__hit~0=v_main_~s__hit~0_12, main_~blastFlag~0=v_main_~blastFlag~0_35} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {842#true} is VALID [2022-04-08 08:17:09,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {842#true} [117] L30_primed-->L111: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {842#true} is VALID [2022-04-08 08:17:09,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {842#true} [118] L111-->L30_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_37 v_main_~s__state~0_36)) (.cse1 (= v_main_~blastFlag~0_36 v_main_~blastFlag~0_35))) (or (and .cse0 (= v_main_~s__hit~0_12 v_main_~s__hit~0_12) .cse1) (and .cse0 .cse1))) InVars {main_~s__state~0=v_main_~s__state~0_37, main_~s__hit~0=v_main_~s__hit~0_12, main_~blastFlag~0=v_main_~blastFlag~0_36} OutVars{main_~s__state~0=v_main_~s__state~0_36, main_~s__hit~0=v_main_~s__hit~0_12, main_~blastFlag~0=v_main_~blastFlag~0_35} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {842#true} is VALID [2022-04-08 08:17:09,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {842#true} [115] L30_primed-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {842#true} is VALID [2022-04-08 08:17:09,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {842#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {842#true} is VALID [2022-04-08 08:17:09,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {842#true} assume !(8466 == ~s__state~0); {842#true} is VALID [2022-04-08 08:17:09,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {842#true} assume !(8512 == ~s__state~0); {842#true} is VALID [2022-04-08 08:17:09,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {842#true} assume !(8640 == ~s__state~0); {842#true} is VALID [2022-04-08 08:17:09,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {842#true} assume 8656 == ~s__state~0; {842#true} is VALID [2022-04-08 08:17:09,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {842#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {847#(= 3 main_~blastFlag~0)} is VALID [2022-04-08 08:17:09,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {847#(= 3 main_~blastFlag~0)} assume !(4 == ~blastFlag~0); {847#(= 3 main_~blastFlag~0)} is VALID [2022-04-08 08:17:09,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {847#(= 3 main_~blastFlag~0)} assume 5 == ~blastFlag~0; {843#false} is VALID [2022-04-08 08:17:09,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {843#false} assume !false; {843#false} is VALID [2022-04-08 08:17:09,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 08:17:09,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:09,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850016563] [2022-04-08 08:17:09,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850016563] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:09,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:09,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:09,271 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:09,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [830896088] [2022-04-08 08:17:09,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [830896088] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:09,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:09,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 08:17:09,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047039820] [2022-04-08 08:17:09,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:09,272 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-08 08:17:09,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:09,272 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-08 08:17:09,287 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-08 08:17:09,288 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 08:17:09,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:09,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 08:17:09,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 08:17:09,289 INFO L87 Difference]: Start difference. First operand 58 states and 77 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-08 08:17:09,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:09,766 INFO L93 Difference]: Finished difference Result 133 states and 187 transitions. [2022-04-08 08:17:09,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 08:17:09,766 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-08 08:17:09,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:09,766 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-08 08:17:09,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2022-04-08 08:17:09,768 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-08 08:17:09,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2022-04-08 08:17:09,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 106 transitions. [2022-04-08 08:17:09,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:09,866 INFO L225 Difference]: With dead ends: 133 [2022-04-08 08:17:09,866 INFO L226 Difference]: Without dead ends: 85 [2022-04-08 08:17:09,866 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 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-08 08:17:09,867 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 80 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:09,868 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 41 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:17:09,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-08 08:17:09,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2022-04-08 08:17:09,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:09,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 80 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:09,946 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 80 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:09,946 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 80 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:09,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:09,949 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2022-04-08 08:17:09,949 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2022-04-08 08:17:09,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:09,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:09,949 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 2 states have call successors, (2), 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 85 states. [2022-04-08 08:17:09,950 INFO L87 Difference]: Start difference. First operand has 80 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 2 states have call successors, (2), 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 85 states. [2022-04-08 08:17:09,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:09,952 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2022-04-08 08:17:09,952 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2022-04-08 08:17:09,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:09,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:09,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:09,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:09,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:09,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 102 transitions. [2022-04-08 08:17:09,955 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 102 transitions. Word has length 21 [2022-04-08 08:17:09,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:09,956 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 102 transitions. [2022-04-08 08:17:09,956 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-08 08:17:09,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 102 transitions. [2022-04-08 08:17:10,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:10,057 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-08 08:17:10,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 08:17:10,058 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:10,058 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-08 08:17:10,058 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:17:10,058 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:10,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:10,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1357620209, now seen corresponding path program 1 times [2022-04-08 08:17:10,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:10,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [461433554] [2022-04-08 08:17:10,100 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:17:10,230 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:17:10,314 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Computed reflexive-transitive closure does not contain relation itself.Something went wrong in computation of loop acceleration formula. at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula(JordanLoopAcceleration.java:1038) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.createLoopAccelerationTermSequential(JordanLoopAcceleration.java:693) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.createLoopAccelerationFormula(JordanLoopAcceleration.java:528) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.accelerateLoop(JordanLoopAcceleration.java:156) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.loopaccelerator.AcceleratorJordan.accelerateLoop(AcceleratorJordan.java:88) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:246) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-08 08:17:10,318 INFO L158 Benchmark]: Toolchain (without parser) took 4394.27ms. Allocated memory was 185.6MB in the beginning and 223.3MB in the end (delta: 37.7MB). Free memory was 134.0MB in the beginning and 117.6MB in the end (delta: 16.3MB). Peak memory consumption was 54.2MB. Max. memory is 8.0GB. [2022-04-08 08:17:10,319 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 185.6MB. Free memory was 151.0MB in the beginning and 150.8MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 08:17:10,320 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.07ms. Allocated memory was 185.6MB in the beginning and 223.3MB in the end (delta: 37.7MB). Free memory was 133.8MB in the beginning and 199.8MB in the end (delta: -65.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 08:17:10,325 INFO L158 Benchmark]: Boogie Preprocessor took 28.31ms. Allocated memory is still 223.3MB. Free memory was 199.8MB in the beginning and 198.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 08:17:10,325 INFO L158 Benchmark]: RCFGBuilder took 265.79ms. Allocated memory is still 223.3MB. Free memory was 198.2MB in the beginning and 186.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 08:17:10,327 INFO L158 Benchmark]: TraceAbstraction took 3878.57ms. Allocated memory is still 223.3MB. Free memory was 186.1MB in the beginning and 117.6MB in the end (delta: 68.5MB). Peak memory consumption was 70.1MB. Max. memory is 8.0GB. [2022-04-08 08:17:10,331 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.13ms. Allocated memory is still 185.6MB. Free memory was 151.0MB in the beginning and 150.8MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 215.07ms. Allocated memory was 185.6MB in the beginning and 223.3MB in the end (delta: 37.7MB). Free memory was 133.8MB in the beginning and 199.8MB in the end (delta: -65.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.31ms. Allocated memory is still 223.3MB. Free memory was 199.8MB in the beginning and 198.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 265.79ms. Allocated memory is still 223.3MB. Free memory was 198.2MB in the beginning and 186.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3878.57ms. Allocated memory is still 223.3MB. Free memory was 186.1MB in the beginning and 117.6MB in the end (delta: 68.5MB). Peak memory consumption was 70.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Computed reflexive-transitive closure does not contain relation itself.Something went wrong in computation of loop acceleration formula. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Computed reflexive-transitive closure does not contain relation itself.Something went wrong in computation of loop acceleration formula.: de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula(JordanLoopAcceleration.java:1038) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 08:17:10,363 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...