/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-zilu/benchmark18_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:16:16,453 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:16:16,454 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:16:16,481 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:16:16,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:16:16,482 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:16:16,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:16:16,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:16:16,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:16:16,495 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:16:16,496 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:16:16,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:16:16,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:16:16,499 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:16:16,499 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:16:16,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:16:16,501 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:16:16,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:16:16,508 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:16:16,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:16:16,515 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:16:16,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:16:16,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:16:16,516 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:16:16,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:16:16,522 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:16:16,522 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:16:16,522 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:16:16,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:16:16,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:16:16,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:16:16,525 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:16:16,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:16:16,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:16:16,526 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:16:16,527 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:16:16,527 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:16:16,528 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:16:16,528 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:16:16,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:16:16,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:16:16,530 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:16:16,530 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:16:16,539 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:16:16,540 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:16:16,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:16:16,541 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:16:16,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:16:16,541 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:16:16,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:16:16,541 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:16:16,541 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:16:16,542 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:16:16,542 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:16:16,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:16:16,542 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:16:16,542 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:16:16,542 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:16:16,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:16:16,542 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:16:16,542 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:16:16,543 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:16:16,543 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:16:16,543 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:16:16,543 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:16:16,543 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 13:16:16,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:16:16,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:16:16,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:16:16,714 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:16:16,715 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:16:16,716 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark18_conjunctive.i [2022-04-15 13:16:16,763 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5d7da85c/9b8bd7ba93a444739d5ad871ae030597/FLAGce2ab7174 [2022-04-15 13:16:17,113 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:16:17,113 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark18_conjunctive.i [2022-04-15 13:16:17,117 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5d7da85c/9b8bd7ba93a444739d5ad871ae030597/FLAGce2ab7174 [2022-04-15 13:16:17,129 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5d7da85c/9b8bd7ba93a444739d5ad871ae030597 [2022-04-15 13:16:17,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:16:17,132 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:16:17,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:16:17,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:16:17,137 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:16:17,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:16:17" (1/1) ... [2022-04-15 13:16:17,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fe37938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:17, skipping insertion in model container [2022-04-15 13:16:17,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:16:17" (1/1) ... [2022-04-15 13:16:17,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:16:17,156 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:16:17,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark18_conjunctive.i[873,886] [2022-04-15 13:16:17,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:16:17,296 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:16:17,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark18_conjunctive.i[873,886] [2022-04-15 13:16:17,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:16:17,314 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:16:17,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:17 WrapperNode [2022-04-15 13:16:17,314 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:16:17,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:16:17,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:16:17,315 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:16:17,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:17" (1/1) ... [2022-04-15 13:16:17,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:17" (1/1) ... [2022-04-15 13:16:17,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:17" (1/1) ... [2022-04-15 13:16:17,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:17" (1/1) ... [2022-04-15 13:16:17,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:17" (1/1) ... [2022-04-15 13:16:17,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:17" (1/1) ... [2022-04-15 13:16:17,332 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:17" (1/1) ... [2022-04-15 13:16:17,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:16:17,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:16:17,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:16:17,333 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:16:17,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:17" (1/1) ... [2022-04-15 13:16:17,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:16:17,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:16:17,353 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 13:16:17,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 13:16:17,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:16:17,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:16:17,381 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:16:17,381 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:16:17,381 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:16:17,382 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:16:17,382 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 13:16:17,382 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 13:16:17,382 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:16:17,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:16:17,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 13:16:17,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-15 13:16:17,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:16:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:16:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:16:17,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:16:17,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:16:17,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:16:17,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:16:17,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:16:17,431 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:16:17,432 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:16:17,512 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:16:17,516 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:16:17,516 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 13:16:17,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:16:17 BoogieIcfgContainer [2022-04-15 13:16:17,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:16:17,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:16:17,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:16:17,520 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:16:17,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:16:17" (1/3) ... [2022-04-15 13:16:17,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cff2a5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:16:17, skipping insertion in model container [2022-04-15 13:16:17,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:17" (2/3) ... [2022-04-15 13:16:17,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cff2a5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:16:17, skipping insertion in model container [2022-04-15 13:16:17,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:16:17" (3/3) ... [2022-04-15 13:16:17,537 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark18_conjunctive.i [2022-04-15 13:16:17,540 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:16:17,541 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:16:17,585 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:16:17,602 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 13:16:17,602 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:16:17,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:16:17,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 13:16:17,636 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:16:17,637 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:16:17,637 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:16:17,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:16:17,640 INFO L85 PathProgramCache]: Analyzing trace with hash -304977768, now seen corresponding path program 1 times [2022-04-15 13:16:17,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:17,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2071806060] [2022-04-15 13:16:17,658 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:16:17,659 INFO L85 PathProgramCache]: Analyzing trace with hash -304977768, now seen corresponding path program 2 times [2022-04-15 13:16:17,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:16:17,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324060504] [2022-04-15 13:16:17,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:16:17,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:16:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:17,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:16:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:17,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(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(26, 2); {23#true} is VALID [2022-04-15 13:16:17,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 13:16:17,859 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-15 13:16:17,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:16:17,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(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(26, 2); {23#true} is VALID [2022-04-15 13:16:17,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 13:16:17,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-15 13:16:17,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret6 := main(); {23#true} is VALID [2022-04-15 13:16:17,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {23#true} is VALID [2022-04-15 13:16:17,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !!((0 == ~i~0 && 0 == ~k~0) && ~n~0 > 0); {28#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-15 13:16:17,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(<= (+ main_~i~0 1) main_~n~0)} assume !(~i~0 < ~n~0); {24#false} is VALID [2022-04-15 13:16:17,866 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} call __VERIFIER_assert((if ~i~0 == ~k~0 && ~k~0 == ~n~0 then 1 else 0)); {24#false} is VALID [2022-04-15 13:16:17,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-15 13:16:17,866 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-15 13:16:17,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-15 13:16:17,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:17,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:16:17,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324060504] [2022-04-15 13:16:17,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324060504] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:16:17,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:16:17,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:16:17,871 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:16:17,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2071806060] [2022-04-15 13:16:17,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2071806060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:16:17,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:16:17,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:16:17,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268546365] [2022-04-15 13:16:17,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:16:17,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:16:17,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:16:17,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:17,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:17,901 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:16:17,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:17,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:16:17,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:16:17,927 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:18,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:18,066 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-15 13:16:18,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:16:18,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:16:18,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:16:18,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:18,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-04-15 13:16:18,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:18,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-04-15 13:16:18,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 39 transitions. [2022-04-15 13:16:18,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:18,128 INFO L225 Difference]: With dead ends: 33 [2022-04-15 13:16:18,129 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 13:16:18,131 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:16:18,135 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:16:18,137 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 28 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:16:18,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 13:16:18,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 13:16:18,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:16:18,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:18,163 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:18,163 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:18,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:18,167 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 13:16:18,167 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 13:16:18,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:16:18,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:16:18,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 13:16:18,168 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 13:16:18,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:18,170 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 13:16:18,170 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 13:16:18,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:16:18,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:16:18,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:16:18,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:16:18,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:18,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-15 13:16:18,173 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-15 13:16:18,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:16:18,173 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-15 13:16:18,174 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:18,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-15 13:16:18,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:18,190 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 13:16:18,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 13:16:18,192 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:16:18,196 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:16:18,197 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:16:18,197 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:16:18,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:16:18,197 INFO L85 PathProgramCache]: Analyzing trace with hash -828987386, now seen corresponding path program 1 times [2022-04-15 13:16:18,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:18,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [404963097] [2022-04-15 13:16:18,499 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:16:18,501 INFO L85 PathProgramCache]: Analyzing trace with hash 28963623, now seen corresponding path program 1 times [2022-04-15 13:16:18,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:16:18,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601943547] [2022-04-15 13:16:18,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:16:18,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:16:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:18,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:16:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:18,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {163#(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(26, 2); {156#true} is VALID [2022-04-15 13:16:18,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-15 13:16:18,584 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {156#true} {156#true} #45#return; {156#true} is VALID [2022-04-15 13:16:18,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {156#true} call ULTIMATE.init(); {163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:16:18,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#(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(26, 2); {156#true} is VALID [2022-04-15 13:16:18,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-15 13:16:18,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #45#return; {156#true} is VALID [2022-04-15 13:16:18,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret6 := main(); {156#true} is VALID [2022-04-15 13:16:18,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {156#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {156#true} is VALID [2022-04-15 13:16:18,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {156#true} assume !!((0 == ~i~0 && 0 == ~k~0) && ~n~0 > 0); {161#(and (<= 1 main_~n~0) (<= (+ main_~i~0 1) main_~n~0))} is VALID [2022-04-15 13:16:18,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {161#(and (<= 1 main_~n~0) (<= (+ main_~i~0 1) main_~n~0))} [49] L24-2-->L24-3_primed: Formula: (let ((.cse0 (= v_main_~i~0_In_1 v_main_~i~0_Out_2))) (or (and (= v_main_~n~0_In_1 v_main_~n~0_In_1) .cse0 (= v_main_~k~0_In_1 v_main_~k~0_Out_2)) (and (= v_main_~k~0_Out_2 v_main_~k~0_In_1) (= v_main_~i~0_Out_2 0) (< v_main_~i~0_Out_2 (+ v_main_~n~0_In_1 1)) (= |v_main_#t~post5_Out_2| 0) .cse0 (= v_main_~n~0_In_1 0)))) InVars {main_~i~0=v_main_~i~0_In_1, main_~n~0=v_main_~n~0_In_1, main_~k~0=v_main_~k~0_In_1} OutVars{main_#t~post4=|v_main_#t~post4_Out_2|, main_~i~0=v_main_~i~0_Out_2, main_#t~post5=|v_main_#t~post5_Out_2|, main_~n~0=v_main_~n~0_In_1, main_~k~0=v_main_~k~0_Out_2} AuxVars[] AssignedVars[main_~k~0, main_#t~post4, main_~i~0, main_#t~post5] {162#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-15 13:16:18,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {162#(<= (+ main_~i~0 1) main_~n~0)} [48] L24-3_primed-->L24-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {157#false} is VALID [2022-04-15 13:16:18,587 INFO L272 TraceCheckUtils]: 9: Hoare triple {157#false} call __VERIFIER_assert((if ~i~0 == ~k~0 && ~k~0 == ~n~0 then 1 else 0)); {157#false} is VALID [2022-04-15 13:16:18,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {157#false} ~cond := #in~cond; {157#false} is VALID [2022-04-15 13:16:18,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {157#false} assume 0 == ~cond; {157#false} is VALID [2022-04-15 13:16:18,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {157#false} assume !false; {157#false} is VALID [2022-04-15 13:16:18,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:18,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:16:18,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601943547] [2022-04-15 13:16:18,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601943547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:16:18,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:16:18,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:16:18,857 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:16:18,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [404963097] [2022-04-15 13:16:18,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [404963097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:16:18,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:16:18,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:16:18,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597534089] [2022-04-15 13:16:18,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:16:18,859 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 13:16:18,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:16:18,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:18,868 WARN L143 InductivityCheck]: Transition 168#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= __VERIFIER_assert_~cond 0)) ( _ , assume !false; , 157#false ) not inductive [2022-04-15 13:16:18,868 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:16:18,869 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) 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:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) 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-15 13:16:18,871 INFO L158 Benchmark]: Toolchain (without parser) took 1738.75ms. Allocated memory is still 170.9MB. Free memory was 123.4MB in the beginning and 116.1MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-04-15 13:16:18,871 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 170.9MB. Free memory is still 139.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 13:16:18,872 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.67ms. Allocated memory is still 170.9MB. Free memory was 123.2MB in the beginning and 150.1MB in the end (delta: -26.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 13:16:18,872 INFO L158 Benchmark]: Boogie Preprocessor took 18.08ms. Allocated memory is still 170.9MB. Free memory was 150.1MB in the beginning and 148.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 13:16:18,872 INFO L158 Benchmark]: RCFGBuilder took 184.10ms. Allocated memory is still 170.9MB. Free memory was 148.5MB in the beginning and 137.5MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 13:16:18,873 INFO L158 Benchmark]: TraceAbstraction took 1352.10ms. Allocated memory is still 170.9MB. Free memory was 137.1MB in the beginning and 116.1MB in the end (delta: 20.9MB). Peak memory consumption was 21.2MB. Max. memory is 8.0GB. [2022-04-15 13:16:18,874 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 170.9MB. Free memory is still 139.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 179.67ms. Allocated memory is still 170.9MB. Free memory was 123.2MB in the beginning and 150.1MB in the end (delta: -26.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.08ms. Allocated memory is still 170.9MB. Free memory was 150.1MB in the beginning and 148.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 184.10ms. Allocated memory is still 170.9MB. Free memory was 148.5MB in the beginning and 137.5MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1352.10ms. Allocated memory is still 170.9MB. Free memory was 137.1MB in the beginning and 116.1MB in the end (delta: 20.9MB). Peak memory consumption was 21.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 13:16:18,896 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...