/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-new/count_by_2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 03:59:45,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 03:59:45,771 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 03:59:45,815 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 03:59:45,815 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 03:59:45,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 03:59:45,819 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 03:59:45,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 03:59:45,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 03:59:45,828 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 03:59:45,828 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 03:59:45,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 03:59:45,830 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 03:59:45,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 03:59:45,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 03:59:45,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 03:59:45,836 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 03:59:45,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 03:59:45,839 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 03:59:45,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 03:59:45,846 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 03:59:45,847 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 03:59:45,848 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 03:59:45,848 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 03:59:45,850 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 03:59:45,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 03:59:45,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 03:59:45,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 03:59:45,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 03:59:45,857 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 03:59:45,859 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 03:59:45,859 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 03:59:45,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 03:59:45,861 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 03:59:45,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 03:59:45,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 03:59:45,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 03:59:45,863 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 03:59:45,863 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 03:59:45,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 03:59:45,865 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 03:59:45,866 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 03:59:45,866 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 03:59:45,877 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 03:59:45,877 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 03:59:45,878 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 03:59:45,879 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 03:59:45,879 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 03:59:45,879 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 03:59:45,879 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 03:59:45,879 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 03:59:45,880 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 03:59:45,880 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 03:59:45,881 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 03:59:45,881 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 03:59:45,881 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 03:59:45,881 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 03:59:45,881 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 03:59:45,881 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 03:59:45,882 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 03:59:45,882 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 03:59:45,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:59:45,882 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 03:59:45,882 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 03:59:45,882 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 03:59:45,883 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 03:59:45,883 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 03:59:45,883 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 03:59:45,883 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 03:59:46,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 03:59:46,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 03:59:46,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 03:59:46,125 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 03:59:46,128 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 03:59:46,130 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/count_by_2.i [2022-04-08 03:59:46,208 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f278c1bad/7edf568f80374cf08f088b821dda5195/FLAG14d2a5af9 [2022-04-08 03:59:46,578 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 03:59:46,579 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_2.i [2022-04-08 03:59:46,583 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f278c1bad/7edf568f80374cf08f088b821dda5195/FLAG14d2a5af9 [2022-04-08 03:59:46,593 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f278c1bad/7edf568f80374cf08f088b821dda5195 [2022-04-08 03:59:46,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 03:59:46,597 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 03:59:46,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 03:59:46,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 03:59:46,607 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 03:59:46,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:59:46" (1/1) ... [2022-04-08 03:59:46,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@697c1957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:46, skipping insertion in model container [2022-04-08 03:59:46,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:59:46" (1/1) ... [2022-04-08 03:59:46,616 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 03:59:46,628 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 03:59:46,760 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_2.i[891,904] [2022-04-08 03:59:46,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:59:46,776 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 03:59:46,787 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_2.i[891,904] [2022-04-08 03:59:46,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:59:46,800 INFO L208 MainTranslator]: Completed translation [2022-04-08 03:59:46,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:46 WrapperNode [2022-04-08 03:59:46,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 03:59:46,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 03:59:46,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 03:59:46,802 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 03:59:46,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:46" (1/1) ... [2022-04-08 03:59:46,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:46" (1/1) ... [2022-04-08 03:59:46,817 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:46" (1/1) ... [2022-04-08 03:59:46,818 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:46" (1/1) ... [2022-04-08 03:59:46,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:46" (1/1) ... [2022-04-08 03:59:46,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:46" (1/1) ... [2022-04-08 03:59:46,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:46" (1/1) ... [2022-04-08 03:59:46,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 03:59:46,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 03:59:46,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 03:59:46,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 03:59:46,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:46" (1/1) ... [2022-04-08 03:59:46,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:59:46,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:59:46,865 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 03:59:46,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 03:59:46,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 03:59:46,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 03:59:46,896 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 03:59:46,897 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 03:59:46,897 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 03:59:46,897 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 03:59:46,897 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 03:59:46,897 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 03:59:46,897 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 03:59:46,897 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 03:59:46,897 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 03:59:46,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 03:59:46,897 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 03:59:46,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 03:59:46,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 03:59:46,898 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 03:59:46,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 03:59:46,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 03:59:46,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 03:59:46,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 03:59:46,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 03:59:46,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 03:59:46,948 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 03:59:46,949 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 03:59:47,053 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 03:59:47,058 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 03:59:47,059 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 03:59:47,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:59:47 BoogieIcfgContainer [2022-04-08 03:59:47,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 03:59:47,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 03:59:47,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 03:59:47,064 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 03:59:47,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:59:46" (1/3) ... [2022-04-08 03:59:47,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b12d44a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:59:47, skipping insertion in model container [2022-04-08 03:59:47,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:46" (2/3) ... [2022-04-08 03:59:47,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b12d44a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:59:47, skipping insertion in model container [2022-04-08 03:59:47,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:59:47" (3/3) ... [2022-04-08 03:59:47,081 INFO L111 eAbstractionObserver]: Analyzing ICFG count_by_2.i [2022-04-08 03:59:47,090 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 03:59:47,090 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 03:59:47,132 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 03:59:47,138 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 03:59:47,138 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 03:59:47,153 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-08 03:59:47,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 03:59:47,169 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:59:47,169 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:59:47,173 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:59:47,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:59:47,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1305738320, now seen corresponding path program 1 times [2022-04-08 03:59:47,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:47,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1500071124] [2022-04-08 03:59:47,204 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:59:47,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1305738320, now seen corresponding path program 2 times [2022-04-08 03:59:47,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:59:47,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919299686] [2022-04-08 03:59:47,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:59:47,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:59:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:47,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:59:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:47,408 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(9, 2); {23#true} is VALID [2022-04-08 03:59:47,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-08 03:59:47,409 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #51#return; {23#true} is VALID [2022-04-08 03:59:47,414 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-08 03:59:47,415 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(9, 2); {23#true} is VALID [2022-04-08 03:59:47,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-08 03:59:47,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #51#return; {23#true} is VALID [2022-04-08 03:59:47,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret1 := main(); {23#true} is VALID [2022-04-08 03:59:47,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} havoc ~i~0;~i~0 := 0; {28#(= main_~i~0 0)} is VALID [2022-04-08 03:59:47,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#(= main_~i~0 0)} assume !(~i~0 < 1000000); {24#false} is VALID [2022-04-08 03:59:47,420 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {24#false} is VALID [2022-04-08 03:59:47,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-08 03:59:47,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-08 03:59:47,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-08 03:59:47,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:59:47,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:59:47,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919299686] [2022-04-08 03:59:47,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919299686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:59:47,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:59:47,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:59:47,427 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:59:47,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1500071124] [2022-04-08 03:59:47,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1500071124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:59:47,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:59:47,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:59:47,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772290606] [2022-04-08 03:59:47,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:59:47,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-08 03:59:47,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:59:47,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-08 03:59:47,466 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-08 03:59:47,466 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 03:59:47,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:47,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 03:59:47,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 03:59:47,493 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 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-08 03:59:47,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:47,654 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-08 03:59:47,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 03:59:47,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-08 03:59:47,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:59:47,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-08 03:59:47,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-04-08 03:59:47,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-08 03:59:47,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-04-08 03:59:47,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 39 transitions. [2022-04-08 03:59:47,735 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-08 03:59:47,742 INFO L225 Difference]: With dead ends: 34 [2022-04-08 03:59:47,743 INFO L226 Difference]: Without dead ends: 15 [2022-04-08 03:59:47,746 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:59:47,750 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 13 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 26 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-08 03:59:47,751 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 26 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:59:47,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-08 03:59:47,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-04-08 03:59:47,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:59:47,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 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-08 03:59:47,783 INFO L74 IsIncluded]: Start isIncluded. First operand 15 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-08 03:59:47,783 INFO L87 Difference]: Start difference. First operand 15 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-08 03:59:47,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:47,787 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 03:59:47,788 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 03:59:47,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:59:47,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:59:47,789 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 15 states. [2022-04-08 03:59:47,789 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 15 states. [2022-04-08 03:59:47,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:47,792 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 03:59:47,792 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 03:59:47,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:59:47,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:59:47,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:59:47,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:59:47,793 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-08 03:59:47,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-08 03:59:47,796 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2022-04-08 03:59:47,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:59:47,797 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-08 03:59:47,799 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-08 03:59:47,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-08 03:59:47,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:59:47,819 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-08 03:59:47,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 03:59:47,820 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:59:47,820 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:59:47,821 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 03:59:47,821 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:59:47,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:59:47,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1786070446, now seen corresponding path program 1 times [2022-04-08 03:59:47,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:47,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [695477553] [2022-04-08 03:59:48,216 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 03:59:48,218 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 03:59:48,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1492527982, now seen corresponding path program 1 times [2022-04-08 03:59:48,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:59:48,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549423081] [2022-04-08 03:59:48,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:59:48,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:59:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:48,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:59:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:48,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {170#(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); {160#true} is VALID [2022-04-08 03:59:48,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {160#true} assume true; {160#true} is VALID [2022-04-08 03:59:48,369 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {160#true} {160#true} #51#return; {160#true} is VALID [2022-04-08 03:59:48,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {160#true} call ULTIMATE.init(); {170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:59:48,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {170#(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); {160#true} is VALID [2022-04-08 03:59:48,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {160#true} assume true; {160#true} is VALID [2022-04-08 03:59:48,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160#true} {160#true} #51#return; {160#true} is VALID [2022-04-08 03:59:48,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {160#true} call #t~ret1 := main(); {160#true} is VALID [2022-04-08 03:59:48,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {160#true} havoc ~i~0;~i~0 := 0; {165#(= main_~i~0 0)} is VALID [2022-04-08 03:59:48,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {165#(= main_~i~0 0)} [55] L26-3-->L26-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_11 v_main_~i~0_10))) (or .cse0 (let ((.cse1 (div (+ v_main_~i~0_11 (* v_main_~i~0_10 (- 1))) (- 2)))) (and (< 0 .cse1) (< .cse1 (+ 2 (div (+ 999999 (* v_main_~i~0_11 (- 1))) 2))) (= (mod (+ v_main_~i~0_11 v_main_~i~0_10) 2) 0))) (and (<= 1000000 v_main_~i~0_11) .cse0))) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10} AuxVars[] AssignedVars[main_~i~0] {166#(<= main_~i~0 1000000)} is VALID [2022-04-08 03:59:48,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {166#(<= main_~i~0 1000000)} [54] L26-4_primed-->L26-4: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {167#(and (<= main_~i~0 1000000) (< 999999 main_~i~0))} is VALID [2022-04-08 03:59:48,374 INFO L272 TraceCheckUtils]: 8: Hoare triple {167#(and (<= main_~i~0 1000000) (< 999999 main_~i~0))} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {168#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:59:48,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {168#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {169#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:59:48,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {169#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {161#false} is VALID [2022-04-08 03:59:48,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {161#false} assume !false; {161#false} is VALID [2022-04-08 03:59:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:59:48,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:59:48,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549423081] [2022-04-08 03:59:48,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549423081] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:59:48,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:59:48,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:59:48,492 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:59:48,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [695477553] [2022-04-08 03:59:48,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [695477553] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:59:48,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:59:48,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 03:59:48,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893644523] [2022-04-08 03:59:48,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:59:48,494 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.125) 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-08 03:59:48,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:59:48,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.125) 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-08 03:59:48,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:59:48,509 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 03:59:48,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:48,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 03:59:48,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-04-08 03:59:48,511 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 9 states, 8 states have (on average 1.125) 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-08 03:59:48,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:48,738 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 03:59:48,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 03:59:48,738 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.125) 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-08 03:59:48,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:59:48,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) 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-08 03:59:48,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2022-04-08 03:59:48,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) 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-08 03:59:48,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2022-04-08 03:59:48,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 15 transitions. [2022-04-08 03:59:48,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:59:48,760 INFO L225 Difference]: With dead ends: 15 [2022-04-08 03:59:48,760 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 03:59:48,760 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2022-04-08 03:59:48,761 INFO L913 BasicCegarLoop]: 7 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:59:48,762 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 24 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:59:48,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 03:59:48,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 03:59:48,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:59:48,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 03:59:48,764 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 03:59:48,764 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 03:59:48,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:48,764 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 03:59:48,764 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:59:48,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:59:48,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:59:48,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 03:59:48,765 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 03:59:48,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:48,765 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 03:59:48,765 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:59:48,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:59:48,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:59:48,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:59:48,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:59:48,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 03:59:48,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 03:59:48,766 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-08 03:59:48,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:59:48,766 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 03:59:48,766 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.125) 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-08 03:59:48,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 03:59:48,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:59:48,767 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:59:48,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:59:48,769 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 03:59:48,770 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 03:59:48,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 03:59:48,885 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-08 03:59:48,886 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-08 03:59:48,887 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-08 03:59:48,888 INFO L882 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-08 03:59:48,888 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-08 03:59:48,888 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-08 03:59:48,888 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-08 03:59:48,888 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 29) the Hoare annotation is: true [2022-04-08 03:59:48,889 INFO L885 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-08 03:59:48,890 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 24 29) the Hoare annotation is: true [2022-04-08 03:59:48,890 INFO L878 garLoopResultBuilder]: At program point L26-2(line 26) the Hoare annotation is: (or (and (or (= main_~i~0 2) (and (= 0 (mod main_~i~0 2)) (< 0 (div (+ (* (- 1) main_~i~0) 2) (- 2))))) (< main_~i~0 1000000)) (= main_~i~0 0)) [2022-04-08 03:59:48,890 INFO L878 garLoopResultBuilder]: At program point L26-3(line 26) the Hoare annotation is: (or (= main_~i~0 0) (and (< main_~i~0 1000002) (or (= main_~i~0 2) (and (= 0 (mod main_~i~0 2)) (< 0 (div (+ (* (- 1) main_~i~0) 2) (- 2))))))) [2022-04-08 03:59:48,890 INFO L878 garLoopResultBuilder]: At program point L26-4(line 26) the Hoare annotation is: (and (<= main_~i~0 1000000) (< 999999 main_~i~0)) [2022-04-08 03:59:48,891 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 24 29) the Hoare annotation is: true [2022-04-08 03:59:48,891 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 03:59:48,891 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 03:59:48,891 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 03:59:48,891 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 03:59:48,891 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 03:59:48,891 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 03:59:48,891 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 03:59:48,892 INFO L885 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: true [2022-04-08 03:59:48,892 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-08 03:59:48,892 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: true [2022-04-08 03:59:48,892 INFO L878 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 03:59:48,892 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 03:59:48,892 INFO L878 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 03:59:48,895 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-08 03:59:48,896 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 03:59:48,900 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 03:59:48,900 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 03:59:48,901 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 03:59:48,902 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-08 03:59:48,902 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 03:59:48,902 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 03:59:48,906 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-08 03:59:48,908 INFO L163 areAnnotationChecker]: CFG has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 03:59:48,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 03:59:48 BoogieIcfgContainer [2022-04-08 03:59:48,916 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 03:59:48,917 INFO L158 Benchmark]: Toolchain (without parser) took 2320.02ms. Allocated memory is still 200.3MB. Free memory was 151.7MB in the beginning and 122.2MB in the end (delta: 29.5MB). Peak memory consumption was 30.0MB. Max. memory is 8.0GB. [2022-04-08 03:59:48,917 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 200.3MB. Free memory is still 167.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 03:59:48,917 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.60ms. Allocated memory is still 200.3MB. Free memory was 151.3MB in the beginning and 179.3MB in the end (delta: -28.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 03:59:48,918 INFO L158 Benchmark]: Boogie Preprocessor took 31.88ms. Allocated memory is still 200.3MB. Free memory was 179.3MB in the beginning and 177.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 03:59:48,918 INFO L158 Benchmark]: RCFGBuilder took 225.99ms. Allocated memory is still 200.3MB. Free memory was 177.8MB in the beginning and 168.0MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-08 03:59:48,918 INFO L158 Benchmark]: TraceAbstraction took 1854.25ms. Allocated memory is still 200.3MB. Free memory was 167.7MB in the beginning and 122.2MB in the end (delta: 45.6MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2022-04-08 03:59:48,920 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 200.3MB. Free memory is still 167.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.60ms. Allocated memory is still 200.3MB. Free memory was 151.3MB in the beginning and 179.3MB in the end (delta: -28.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.88ms. Allocated memory is still 200.3MB. Free memory was 179.3MB in the beginning and 177.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 225.99ms. Allocated memory is still 200.3MB. Free memory was 177.8MB in the beginning and 168.0MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 1854.25ms. Allocated memory is still 200.3MB. Free memory was 167.7MB in the beginning and 122.2MB in the end (delta: 45.6MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48 IncrementalHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 24 mSDtfsCounter, 48 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 26 PreInvPairs, 36 NumberOfFragments, 95 HoareAnnotationTreeSize, 26 FomulaSimplifications, 22 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 23 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: i == 0 || (i < 1000002 && (i == 2 || (0 == i % 2 && 0 < (-1 * i + 2) / -2))) - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 03:59:48,955 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...