/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-new/count_by_1_variant.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:32:22,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:32:22,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:32:22,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:32:22,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:32:22,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:32:22,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:32:22,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:32:22,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:32:22,701 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:32:22,702 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:32:22,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:32:22,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:32:22,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:32:22,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:32:22,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:32:22,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:32:22,708 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:32:22,709 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:32:22,710 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:32:22,712 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:32:22,712 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:32:22,713 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:32:22,714 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:32:22,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:32:22,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:32:22,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:32:22,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:32:22,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:32:22,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:32:22,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:32:22,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:32:22,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:32:22,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:32:22,721 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:32:22,722 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:32:22,722 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:32:22,723 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:32:22,723 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:32:22,723 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:32:22,724 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:32:22,725 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:32:22,725 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 12:32:22,733 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:32:22,733 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:32:22,734 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:32:22,734 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:32:22,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:32:22,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:32:22,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:32:22,735 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:32:22,735 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:32:22,735 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:32:22,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:32:22,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:32:22,736 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:32:22,736 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:32:22,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:32:22,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:32:22,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:32:22,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:32:22,737 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:32:22,737 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:32:22,737 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:32:22,737 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:32:22,737 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 12:32:22,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:32:22,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:32:22,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:32:22,972 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:32:22,973 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:32:22,974 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/count_by_1_variant.i [2022-04-15 12:32:23,039 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/939bed014/5c0d70a7a94f42bf9a85b0c3fab18608/FLAG9452acf41 [2022-04-15 12:32:23,427 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:32:23,428 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_1_variant.i [2022-04-15 12:32:23,432 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/939bed014/5c0d70a7a94f42bf9a85b0c3fab18608/FLAG9452acf41 [2022-04-15 12:32:23,450 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/939bed014/5c0d70a7a94f42bf9a85b0c3fab18608 [2022-04-15 12:32:23,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:32:23,453 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:32:23,456 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:32:23,456 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:32:23,459 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:32:23,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:32:23" (1/1) ... [2022-04-15 12:32:23,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a8e6a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:23, skipping insertion in model container [2022-04-15 12:32:23,465 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:32:23" (1/1) ... [2022-04-15 12:32:23,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:32:23,482 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:32:23,612 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-new/count_by_1_variant.i[891,904] [2022-04-15 12:32:23,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:32:23,627 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:32:23,643 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-new/count_by_1_variant.i[891,904] [2022-04-15 12:32:23,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:32:23,656 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:32:23,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:23 WrapperNode [2022-04-15 12:32:23,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:32:23,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:32:23,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:32:23,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:32:23,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:23" (1/1) ... [2022-04-15 12:32:23,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:23" (1/1) ... [2022-04-15 12:32:23,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:23" (1/1) ... [2022-04-15 12:32:23,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:23" (1/1) ... [2022-04-15 12:32:23,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:23" (1/1) ... [2022-04-15 12:32:23,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:23" (1/1) ... [2022-04-15 12:32:23,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:23" (1/1) ... [2022-04-15 12:32:23,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:32:23,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:32:23,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:32:23,700 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:32:23,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:23" (1/1) ... [2022-04-15 12:32:23,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:32:23,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:23,731 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 12:32:23,732 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 12:32:23,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:32:23,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:32:23,762 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:32:23,763 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 12:32:23,763 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:32:23,763 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:32:23,763 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:32:23,763 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:32:23,763 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 12:32:23,764 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 12:32:23,764 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:32:23,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:32:23,764 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 12:32:23,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:32:23,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 12:32:23,767 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:32:23,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:32:23,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:32:23,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:32:23,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:32:23,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:32:23,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:32:23,830 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:32:23,832 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:32:23,917 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:32:23,923 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:32:23,923 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 12:32:23,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:32:23 BoogieIcfgContainer [2022-04-15 12:32:23,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:32:23,926 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:32:23,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:32:23,929 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:32:23,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:32:23" (1/3) ... [2022-04-15 12:32:23,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae6b783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:32:23, skipping insertion in model container [2022-04-15 12:32:23,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:23" (2/3) ... [2022-04-15 12:32:23,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae6b783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:32:23, skipping insertion in model container [2022-04-15 12:32:23,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:32:23" (3/3) ... [2022-04-15 12:32:23,932 INFO L111 eAbstractionObserver]: Analyzing ICFG count_by_1_variant.i [2022-04-15 12:32:23,936 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:32:23,936 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:32:23,973 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:32:23,979 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 12:32:23,979 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:32:23,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 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 12:32:24,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:32:24,000 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:24,001 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:24,001 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:24,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:24,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1307585362, now seen corresponding path program 1 times [2022-04-15 12:32:24,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:24,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1419081933] [2022-04-15 12:32:24,021 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:32:24,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1307585362, now seen corresponding path program 2 times [2022-04-15 12:32:24,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:24,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058516302] [2022-04-15 12:32:24,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:24,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:24,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:24,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(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(9, 2); {23#true} is VALID [2022-04-15 12:32:24,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 12:32:24,278 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #51#return; {23#true} is VALID [2022-04-15 12:32:24,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:24,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(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(9, 2); {23#true} is VALID [2022-04-15 12:32:24,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 12:32:24,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #51#return; {23#true} is VALID [2022-04-15 12:32:24,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2022-04-15 12:32:24,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} havoc ~i~0;~i~0 := 0; {28#(<= main_~i~0 1000000)} is VALID [2022-04-15 12:32:24,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#(<= main_~i~0 1000000)} assume !!(1000000 != ~i~0); {28#(<= main_~i~0 1000000)} is VALID [2022-04-15 12:32:24,286 INFO L272 TraceCheckUtils]: 7: Hoare triple {28#(<= main_~i~0 1000000)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {29#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:32:24,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {30#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:32:24,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24#false} is VALID [2022-04-15 12:32:24,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-15 12:32:24,289 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 12:32:24,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:24,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058516302] [2022-04-15 12:32:24,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058516302] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:24,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:24,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:32:24,294 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:24,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1419081933] [2022-04-15 12:32:24,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1419081933] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:24,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:24,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:32:24,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293223766] [2022-04-15 12:32:24,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:24,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 11 [2022-04-15 12:32:24,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:24,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 12:32:24,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:24,320 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:32:24,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:24,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:32:24,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:32:24,345 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 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 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 12:32:24,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:24,621 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-15 12:32:24,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:32:24,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 11 [2022-04-15 12:32:24,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:24,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 12:32:24,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-15 12:32:24,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 12:32:24,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-15 12:32:24,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-04-15 12:32:24,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:24,702 INFO L225 Difference]: With dead ends: 41 [2022-04-15 12:32:24,702 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 12:32:24,704 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:32:24,707 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:24,708 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 35 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:32:24,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 12:32:24,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-15 12:32:24,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:24,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:32:24,744 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:32:24,744 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:32:24,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:24,746 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 12:32:24,747 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 12:32:24,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:24,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:24,747 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-15 12:32:24,748 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-15 12:32:24,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:24,750 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 12:32:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 12:32:24,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:24,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:24,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:24,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:24,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:32:24,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-15 12:32:24,754 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 11 [2022-04-15 12:32:24,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:24,754 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-15 12:32:24,754 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 12:32:24,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-15 12:32:24,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:24,775 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 12:32:24,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:32:24,776 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:24,776 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:24,777 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:32:24,777 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:24,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:24,778 INFO L85 PathProgramCache]: Analyzing trace with hash 2000663987, now seen corresponding path program 1 times [2022-04-15 12:32:24,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:24,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2007875090] [2022-04-15 12:32:24,979 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:32:24,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1492527982, now seen corresponding path program 1 times [2022-04-15 12:32:24,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:24,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127453010] [2022-04-15 12:32:24,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:24,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:25,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:25,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#(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(9, 2); {210#true} is VALID [2022-04-15 12:32:25,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {210#true} assume true; {210#true} is VALID [2022-04-15 12:32:25,081 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {210#true} {210#true} #51#return; {210#true} is VALID [2022-04-15 12:32:25,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {210#true} call ULTIMATE.init(); {218#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:25,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#(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(9, 2); {210#true} is VALID [2022-04-15 12:32:25,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {210#true} assume true; {210#true} is VALID [2022-04-15 12:32:25,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {210#true} {210#true} #51#return; {210#true} is VALID [2022-04-15 12:32:25,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {210#true} call #t~ret2 := main(); {210#true} is VALID [2022-04-15 12:32:25,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {210#true} havoc ~i~0;~i~0 := 0; {215#(= main_~i~0 0)} is VALID [2022-04-15 12:32:25,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {215#(= main_~i~0 0)} [55] L26-2-->L27_primed: Formula: (let ((.cse0 (= v_main_~i~0_In_1 v_main_~i~0_Out_2))) (or (and (= v_main_~i~0_Out_2 0) .cse0) .cse0)) InVars {main_~i~0=v_main_~i~0_In_1} OutVars{main_~i~0=v_main_~i~0_Out_2, main_#t~post1=|v_main_#t~post1_Out_2|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {215#(= main_~i~0 0)} is VALID [2022-04-15 12:32:25,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {215#(= main_~i~0 0)} [54] L27_primed-->L27: Formula: (not (= v_main_~i~0_2 1000000)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {215#(= main_~i~0 0)} is VALID [2022-04-15 12:32:25,089 INFO L272 TraceCheckUtils]: 8: Hoare triple {215#(= main_~i~0 0)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {216#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:32:25,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {216#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {217#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:32:25,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {217#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {211#false} is VALID [2022-04-15 12:32:25,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {211#false} assume !false; {211#false} is VALID [2022-04-15 12:32:25,091 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 12:32:25,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:25,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127453010] [2022-04-15 12:32:25,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127453010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:25,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:25,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:32:25,164 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:25,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2007875090] [2022-04-15 12:32:25,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2007875090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:25,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:25,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:32:25,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806227973] [2022-04-15 12:32:25,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:25,168 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-15 12:32:25,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:25,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.2) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:32:25,197 WARN L143 InductivityCheck]: Transition 222#(<= main_~i~0 1000001) ( _ , assume !!(1000000 != ~i~0); , 215#(= main_~i~0 0) ) not inductive [2022-04-15 12:32:25,197 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:32:25,198 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 12:32:25,202 INFO L158 Benchmark]: Toolchain (without parser) took 1748.34ms. Allocated memory was 178.3MB in the beginning and 219.2MB in the end (delta: 40.9MB). Free memory was 127.7MB in the beginning and 197.2MB in the end (delta: -69.5MB). Peak memory consumption was 55.7MB. Max. memory is 8.0GB. [2022-04-15 12:32:25,203 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 178.3MB. Free memory was 144.5MB in the beginning and 144.4MB in the end (delta: 74.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:32:25,204 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.88ms. Allocated memory was 178.3MB in the beginning and 219.2MB in the end (delta: 40.9MB). Free memory was 127.5MB in the beginning and 196.8MB in the end (delta: -69.3MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. [2022-04-15 12:32:25,208 INFO L158 Benchmark]: Boogie Preprocessor took 40.31ms. Allocated memory is still 219.2MB. Free memory was 196.8MB in the beginning and 195.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 12:32:25,208 INFO L158 Benchmark]: RCFGBuilder took 225.78ms. Allocated memory is still 219.2MB. Free memory was 195.5MB in the beginning and 184.6MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 12:32:25,209 INFO L158 Benchmark]: TraceAbstraction took 1273.71ms. Allocated memory is still 219.2MB. Free memory was 184.2MB in the beginning and 197.2MB in the end (delta: -13.0MB). Peak memory consumption was 71.2MB. Max. memory is 8.0GB. [2022-04-15 12:32:25,226 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.14ms. Allocated memory is still 178.3MB. Free memory was 144.5MB in the beginning and 144.4MB in the end (delta: 74.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 201.88ms. Allocated memory was 178.3MB in the beginning and 219.2MB in the end (delta: 40.9MB). Free memory was 127.5MB in the beginning and 196.8MB in the end (delta: -69.3MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.31ms. Allocated memory is still 219.2MB. Free memory was 196.8MB in the beginning and 195.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 225.78ms. Allocated memory is still 219.2MB. Free memory was 195.5MB in the beginning and 184.6MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1273.71ms. Allocated memory is still 219.2MB. Free memory was 184.2MB in the beginning and 197.2MB in the end (delta: -13.0MB). Peak memory consumption was 71.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 12:32:25,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...