/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-zilu/benchmark04_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:08:52,776 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:08:52,778 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:08:52,812 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:08:52,826 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:08:52,826 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:08:52,827 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:08:52,828 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:08:52,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:08:52,835 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:08:52,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:08:52,842 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:08:52,842 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:08:52,844 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:08:52,845 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:08:52,846 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:08:52,847 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:08:52,847 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:08:52,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:08:52,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:08:52,857 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:08:52,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:08:52,858 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:08:52,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:08:52,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:08:52,864 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:08:52,864 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:08:52,864 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:08:52,864 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:08:52,865 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:08:52,865 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:08:52,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:08:52,866 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:08:52,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:08:52,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:08:52,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:08:52,867 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:08:52,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:08:52,868 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:08:52,868 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:08:52,871 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:08:52,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:08:52,873 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:08:52,882 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:08:52,882 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:08:52,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:08:52,883 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:08:52,883 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:08:52,883 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:08:52,883 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:08:52,883 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:08:52,883 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:08:52,884 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:08:52,884 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:08:52,884 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:08:52,884 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:08:52,884 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:08:52,884 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:08:52,884 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:08:52,884 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:08:52,884 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:08:52,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:08:52,884 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:08:52,885 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:08:52,885 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:08:52,885 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:08:52,885 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:08:52,885 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:08:52,885 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-28 04:08:53,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:08:53,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:08:53,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:08:53,071 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:08:53,072 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:08:53,072 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark04_conjunctive.i [2022-04-28 04:08:53,144 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47356afbe/357466a911074f4bb5d87793186794aa/FLAG4b78c0831 [2022-04-28 04:08:53,426 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:08:53,426 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark04_conjunctive.i [2022-04-28 04:08:53,430 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47356afbe/357466a911074f4bb5d87793186794aa/FLAG4b78c0831 [2022-04-28 04:08:53,874 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47356afbe/357466a911074f4bb5d87793186794aa [2022-04-28 04:08:53,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:08:53,881 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:08:53,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:08:53,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:08:53,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:08:53,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:08:53" (1/1) ... [2022-04-28 04:08:53,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b0042ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:53, skipping insertion in model container [2022-04-28 04:08:53,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:08:53" (1/1) ... [2022-04-28 04:08:53,895 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:08:53,907 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:08:54,046 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark04_conjunctive.i[873,886] [2022-04-28 04:08:54,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:08:54,070 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:08:54,079 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark04_conjunctive.i[873,886] [2022-04-28 04:08:54,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:08:54,091 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:08:54,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:54 WrapperNode [2022-04-28 04:08:54,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:08:54,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:08:54,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:08:54,093 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:08:54,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:54" (1/1) ... [2022-04-28 04:08:54,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:54" (1/1) ... [2022-04-28 04:08:54,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:54" (1/1) ... [2022-04-28 04:08:54,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:54" (1/1) ... [2022-04-28 04:08:54,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:54" (1/1) ... [2022-04-28 04:08:54,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:54" (1/1) ... [2022-04-28 04:08:54,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:54" (1/1) ... [2022-04-28 04:08:54,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:08:54,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:08:54,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:08:54,125 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:08:54,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:54" (1/1) ... [2022-04-28 04:08:54,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:08:54,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:08:54,164 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-28 04:08:54,181 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-28 04:08:54,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:08:54,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:08:54,198 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:08:54,198 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:08:54,198 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:08:54,199 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:08:54,199 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 04:08:54,199 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 04:08:54,199 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:08:54,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:08:54,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 04:08:54,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-28 04:08:54,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:08:54,200 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:08:54,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:08:54,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:08:54,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:08:54,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:08:54,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:08:54,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:08:54,262 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:08:54,264 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:08:54,402 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:08:54,406 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:08:54,406 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 04:08:54,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:08:54 BoogieIcfgContainer [2022-04-28 04:08:54,407 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:08:54,408 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:08:54,408 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:08:54,416 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:08:54,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:08:53" (1/3) ... [2022-04-28 04:08:54,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585cec26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:08:54, skipping insertion in model container [2022-04-28 04:08:54,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:54" (2/3) ... [2022-04-28 04:08:54,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585cec26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:08:54, skipping insertion in model container [2022-04-28 04:08:54,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:08:54" (3/3) ... [2022-04-28 04:08:54,418 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark04_conjunctive.i [2022-04-28 04:08:54,426 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:08:54,426 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:08:54,452 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:08:54,466 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3fb4ff7e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1afeac03 [2022-04-28 04:08:54,466 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:08:54,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:08:54,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 04:08:54,478 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:54,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:54,478 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:54,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:54,485 INFO L85 PathProgramCache]: Analyzing trace with hash -304977768, now seen corresponding path program 1 times [2022-04-28 04:08:54,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:54,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [234721250] [2022-04-28 04:08:54,501 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:08:54,501 INFO L85 PathProgramCache]: Analyzing trace with hash -304977768, now seen corresponding path program 2 times [2022-04-28 04:08:54,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:54,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873206596] [2022-04-28 04:08:54,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:54,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:54,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:54,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {23#true} is VALID [2022-04-28 04:08:54,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 04:08:54,684 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-28 04:08:54,690 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-28 04:08:54,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {23#true} is VALID [2022-04-28 04:08:54,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 04:08:54,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-28 04:08:54,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret6 := main(); {23#true} is VALID [2022-04-28 04:08:54,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {23#true} is VALID [2022-04-28 04:08:54,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !!((~n~0 >= 1 && ~k~0 >= ~n~0) && 0 == ~j~0); {28#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 04:08:54,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(<= (+ main_~j~0 1) main_~n~0)} assume !(~j~0 <= ~n~0 - 1); {24#false} is VALID [2022-04-28 04:08:54,694 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} call __VERIFIER_assert((if ~k~0 >= 0 then 1 else 0)); {24#false} is VALID [2022-04-28 04:08:54,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-28 04:08:54,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-28 04:08:54,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-28 04:08:54,695 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-28 04:08:54,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:54,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873206596] [2022-04-28 04:08:54,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873206596] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:54,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:54,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:54,698 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:54,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [234721250] [2022-04-28 04:08:54,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [234721250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:54,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:54,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:54,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585447125] [2022-04-28 04:08:54,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:54,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 04:08:54,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:54,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:54,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:54,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 04:08:54,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:54,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 04:08:54,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 04:08:54,751 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:54,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:54,834 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-28 04:08:54,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 04:08:54,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 04:08:54,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:54,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:54,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-04-28 04:08:54,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:54,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-04-28 04:08:54,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 39 transitions. [2022-04-28 04:08:54,886 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-28 04:08:54,892 INFO L225 Difference]: With dead ends: 33 [2022-04-28 04:08:54,892 INFO L226 Difference]: Without dead ends: 14 [2022-04-28 04:08:54,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:08:54,900 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:54,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 28 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:08:54,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-28 04:08:54,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-28 04:08:54,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:54,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:54,926 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:54,927 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:54,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:54,929 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 04:08:54,929 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 04:08:54,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:54,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:54,930 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 04:08:54,930 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 04:08:54,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:54,931 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 04:08:54,931 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 04:08:54,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:54,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:54,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:54,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:54,932 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-28 04:08:54,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-28 04:08:54,934 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-28 04:08:54,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:54,934 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-28 04:08:54,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:54,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-28 04:08:54,953 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-28 04:08:54,953 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 04:08:54,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 04:08:54,953 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:54,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:54,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:08:54,954 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:54,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:54,955 INFO L85 PathProgramCache]: Analyzing trace with hash -828987386, now seen corresponding path program 1 times [2022-04-28 04:08:54,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:54,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2097473986] [2022-04-28 04:08:55,231 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:55,232 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:55,235 INFO L85 PathProgramCache]: Analyzing trace with hash 28963623, now seen corresponding path program 1 times [2022-04-28 04:08:55,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:55,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805449486] [2022-04-28 04:08:55,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:55,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:55,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:55,366 INFO L290 TraceCheckUtils]: 0: Hoare triple {165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {156#true} is VALID [2022-04-28 04:08:55,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-28 04:08:55,367 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {156#true} {156#true} #45#return; {156#true} is VALID [2022-04-28 04:08:55,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {156#true} call ULTIMATE.init(); {165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:55,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {156#true} is VALID [2022-04-28 04:08:55,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-28 04:08:55,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #45#return; {156#true} is VALID [2022-04-28 04:08:55,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret6 := main(); {156#true} is VALID [2022-04-28 04:08:55,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {156#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {156#true} is VALID [2022-04-28 04:08:55,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {156#true} assume !!((~n~0 >= 1 && ~k~0 >= ~n~0) && 0 == ~j~0); {161#(and (<= main_~n~0 (+ main_~k~0 main_~j~0)) (<= (+ main_~j~0 1) main_~n~0))} is VALID [2022-04-28 04:08:55,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {161#(and (<= main_~n~0 (+ main_~k~0 main_~j~0)) (<= (+ main_~j~0 1) main_~n~0))} [49] L24-2-->L24-3_primed: Formula: (let ((.cse0 (= v_main_~j~0_8 v_main_~j~0_7)) (.cse1 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse2 (= v_main_~k~0_9 v_main_~k~0_8)) (.cse3 (= |v_main_#t~post4_4| |v_main_#t~post4_3|))) (or (and (= v_main_~n~0_6 v_main_~n~0_6) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (not (<= (+ v_main_~j~0_8 1) v_main_~n~0_6)) .cse2 .cse3) (let ((.cse4 (+ v_main_~j~0_8 v_main_~k~0_9))) (and (< v_main_~k~0_8 v_main_~k~0_9) (<= .cse4 (+ v_main_~k~0_8 v_main_~n~0_6)) (= .cse4 (+ v_main_~j~0_7 v_main_~k~0_8)))))) InVars {main_#t~post4=|v_main_#t~post4_4|, main_#t~post5=|v_main_#t~post5_4|, main_~n~0=v_main_~n~0_6, main_~k~0=v_main_~k~0_9, main_~j~0=v_main_~j~0_8} OutVars{main_#t~post4=|v_main_#t~post4_3|, main_#t~post5=|v_main_#t~post5_3|, main_~n~0=v_main_~n~0_6, main_~k~0=v_main_~k~0_8, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {162#(<= 0 main_~k~0)} is VALID [2022-04-28 04:08:55,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {162#(<= 0 main_~k~0)} [48] L24-3_primed-->L24-3: Formula: (not (<= (+ v_main_~j~0_1 1) v_main_~n~0_1)) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {162#(<= 0 main_~k~0)} is VALID [2022-04-28 04:08:55,371 INFO L272 TraceCheckUtils]: 9: Hoare triple {162#(<= 0 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 0 then 1 else 0)); {163#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:08:55,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {163#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {164#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:08:55,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {164#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {157#false} is VALID [2022-04-28 04:08:55,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {157#false} assume !false; {157#false} is VALID [2022-04-28 04:08:55,372 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-28 04:08:55,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:55,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805449486] [2022-04-28 04:08:55,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805449486] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:55,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:55,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:08:55,550 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:55,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2097473986] [2022-04-28 04:08:55,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2097473986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:55,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:55,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:08:55,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651898372] [2022-04-28 04:08:55,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:55,552 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 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-28 04:08:55,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:55,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 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-28 04:08:55,565 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-28 04:08:55,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 04:08:55,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:55,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 04:08:55,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 04:08:55,566 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 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-28 04:08:55,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:55,635 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 04:08:55,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 04:08:55,635 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 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-28 04:08:55,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:55,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 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-28 04:08:55,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2022-04-28 04:08:55,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 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-28 04:08:55,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2022-04-28 04:08:55,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 14 transitions. [2022-04-28 04:08:55,662 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-28 04:08:55,662 INFO L225 Difference]: With dead ends: 14 [2022-04-28 04:08:55,662 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 04:08:55,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-28 04:08:55,664 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:55,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 25 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 2 Unchecked, 0.0s Time] [2022-04-28 04:08:55,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 04:08:55,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 04:08:55,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:55,666 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-28 04:08:55,667 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-28 04:08:55,667 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-28 04:08:55,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:55,667 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 04:08:55,667 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:08:55,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:55,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:55,667 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-28 04:08:55,667 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-28 04:08:55,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:55,667 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 04:08:55,668 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:08:55,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:55,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:55,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:55,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:55,669 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-28 04:08:55,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 04:08:55,669 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-28 04:08:55,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:55,669 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 04:08:55,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 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-28 04:08:55,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 04:08:55,670 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-28 04:08:55,670 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:08:55,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:55,673 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 04:08:55,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 04:08:55,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 04:08:55,737 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 11) no Hoare annotation was computed. [2022-04-28 04:08:55,737 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 11) no Hoare annotation was computed. [2022-04-28 04:08:55,737 INFO L899 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2022-04-28 04:08:55,739 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 30) the Hoare annotation is: true [2022-04-28 04:08:55,739 INFO L902 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true [2022-04-28 04:08:55,739 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 19 30) the Hoare annotation is: true [2022-04-28 04:08:55,740 INFO L902 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: true [2022-04-28 04:08:55,740 INFO L895 garLoopResultBuilder]: At program point L24-2(lines 24 27) the Hoare annotation is: (exists ((|v_main_#t~post5_7| Int) (|v_main_#t~post4_7| Int) (v_main_~k~0_13 Int) (v_main_~j~0_12 Int)) (let ((.cse0 (+ v_main_~j~0_12 v_main_~k~0_13))) (and (<= main_~n~0 .cse0) (or (and (= .cse0 (+ main_~k~0 main_~j~0)) (< main_~k~0 v_main_~k~0_13) (<= .cse0 (+ main_~n~0 main_~k~0))) (and (= v_main_~k~0_13 main_~k~0) (= v_main_~j~0_12 main_~j~0) (= |main_#t~post4| |v_main_#t~post4_7|) (= |main_#t~post5| |v_main_#t~post5_7|))) (<= (+ v_main_~j~0_12 1) main_~n~0)))) [2022-04-28 04:08:55,740 INFO L895 garLoopResultBuilder]: At program point L24-3(lines 24 27) the Hoare annotation is: (<= 0 main_~k~0) [2022-04-28 04:08:55,740 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 19 30) the Hoare annotation is: true [2022-04-28 04:08:55,741 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 04:08:55,741 INFO L895 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-28 04:08:55,741 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 04:08:55,741 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 04:08:55,741 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 04:08:55,741 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 04:08:55,741 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 04:08:55,742 INFO L895 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 04:08:55,742 INFO L895 garLoopResultBuilder]: At program point L15(lines 15 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 04:08:55,744 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-28 04:08:55,744 INFO L902 garLoopResultBuilder]: At program point L15-2(lines 14 18) the Hoare annotation is: true [2022-04-28 04:08:55,748 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 18) the Hoare annotation is: true [2022-04-28 04:08:55,748 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 04:08:55,750 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-28 04:08:55,752 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 04:08:55,754 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 04:08:55,754 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 04:08:55,755 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2022-04-28 04:08:55,764 INFO L163 areAnnotationChecker]: CFG has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 04:08:55,768 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] [2022-04-28 04:08:55,768 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-28 04:08:55,769 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] [2022-04-28 04:08:55,769 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-28 04:08:55,769 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-28 04:08:55,769 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] [2022-04-28 04:08:55,769 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-28 04:08:55,769 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-28 04:08:55,769 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] [2022-04-28 04:08:55,769 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post4_7,QUANTIFIED] [2022-04-28 04:08:55,769 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post5_7,QUANTIFIED] [2022-04-28 04:08:55,769 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] [2022-04-28 04:08:55,772 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] [2022-04-28 04:08:55,772 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-28 04:08:55,772 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] [2022-04-28 04:08:55,772 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-28 04:08:55,773 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-28 04:08:55,773 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] [2022-04-28 04:08:55,773 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-28 04:08:55,773 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-28 04:08:55,773 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] [2022-04-28 04:08:55,773 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post4_7,QUANTIFIED] [2022-04-28 04:08:55,773 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post5_7,QUANTIFIED] [2022-04-28 04:08:55,773 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] [2022-04-28 04:08:55,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 04:08:55 BoogieIcfgContainer [2022-04-28 04:08:55,774 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 04:08:55,775 INFO L158 Benchmark]: Toolchain (without parser) took 1893.57ms. Allocated memory is still 218.1MB. Free memory was 170.1MB in the beginning and 79.7MB in the end (delta: 90.3MB). Peak memory consumption was 89.9MB. Max. memory is 8.0GB. [2022-04-28 04:08:55,775 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 218.1MB. Free memory was 186.0MB in the beginning and 185.8MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 04:08:55,775 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.91ms. Allocated memory is still 218.1MB. Free memory was 169.8MB in the beginning and 195.1MB in the end (delta: -25.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 04:08:55,775 INFO L158 Benchmark]: Boogie Preprocessor took 31.48ms. Allocated memory is still 218.1MB. Free memory was 195.1MB in the beginning and 193.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 04:08:55,776 INFO L158 Benchmark]: RCFGBuilder took 282.43ms. Allocated memory is still 218.1MB. Free memory was 193.8MB in the beginning and 181.5MB in the end (delta: 12.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 04:08:55,776 INFO L158 Benchmark]: TraceAbstraction took 1366.16ms. Allocated memory is still 218.1MB. Free memory was 180.9MB in the beginning and 79.7MB in the end (delta: 101.2MB). Peak memory consumption was 100.7MB. Max. memory is 8.0GB. [2022-04-28 04:08:55,777 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.10ms. Allocated memory is still 218.1MB. Free memory was 186.0MB in the beginning and 185.8MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 209.91ms. Allocated memory is still 218.1MB. Free memory was 169.8MB in the beginning and 195.1MB in the end (delta: -25.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.48ms. Allocated memory is still 218.1MB. Free memory was 195.1MB in the beginning and 193.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 282.43ms. Allocated memory is still 218.1MB. Free memory was 193.8MB in the beginning and 181.5MB in the end (delta: 12.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1366.16ms. Allocated memory is still 218.1MB. Free memory was 180.9MB in the beginning and 79.7MB in the end (delta: 101.2MB). Peak memory consumption was 100.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post4_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post5_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post4_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post5_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] * 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: 16]: 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 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28 IncrementalHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 27 mSDtfsCounter, 28 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 12, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 26 PreInvPairs, 35 NumberOfFragments, 82 HoareAnnotationTreeSize, 26 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 56 FormulaSimplificationTreeSizeReductionInter, 0.0s 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: 24]: Loop Invariant [2022-04-28 04:08:55,782 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] [2022-04-28 04:08:55,782 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-28 04:08:55,783 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] [2022-04-28 04:08:55,783 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-28 04:08:55,783 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-28 04:08:55,783 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] [2022-04-28 04:08:55,783 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-28 04:08:55,783 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-28 04:08:55,783 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] [2022-04-28 04:08:55,783 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post4_7,QUANTIFIED] [2022-04-28 04:08:55,783 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post5_7,QUANTIFIED] [2022-04-28 04:08:55,783 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] [2022-04-28 04:08:55,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] [2022-04-28 04:08:55,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-28 04:08:55,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] [2022-04-28 04:08:55,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-28 04:08:55,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-28 04:08:55,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] [2022-04-28 04:08:55,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-28 04:08:55,787 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-28 04:08:55,787 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] [2022-04-28 04:08:55,787 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post4_7,QUANTIFIED] [2022-04-28 04:08:55,787 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post5_7,QUANTIFIED] [2022-04-28 04:08:55,787 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_12,QUANTIFIED] Derived loop invariant: (\exists v_main_#t~post5_7 : int, v_main_#t~post4_7 : int, v_main_~k~0_13 : int, v_main_~j~0_12 : int :: (n <= v_main_~j~0_12 + v_main_~k~0_13 && (((v_main_~j~0_12 + v_main_~k~0_13 == k + j && k < v_main_~k~0_13) && v_main_~j~0_12 + v_main_~k~0_13 <= n + k) || (((v_main_~k~0_13 == k && v_main_~j~0_12 == j) && aux-j++-aux == v_main_#t~post4_7) && aux-k---aux == v_main_#t~post5_7))) && v_main_~j~0_12 + 1 <= n) - ProcedureContractResult [Line: 19]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 04:08:55,812 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...