/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-lit/jm2006.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:13:58,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:13:58,328 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:13:58,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:13:58,376 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:13:58,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:13:58,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:13:58,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:13:58,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:13:58,387 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:13:58,388 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:13:58,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:13:58,390 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:13:58,391 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:13:58,392 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:13:58,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:13:58,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:13:58,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:13:58,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:13:58,401 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:13:58,402 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:13:58,403 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:13:58,404 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:13:58,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:13:58,405 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:13:58,410 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:13:58,410 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:13:58,411 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:13:58,411 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:13:58,412 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:13:58,412 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:13:58,412 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:13:58,414 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:13:58,414 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:13:58,414 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:13:58,415 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:13:58,415 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:13:58,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:13:58,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:13:58,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:13:58,416 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:13:58,417 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:13:58,418 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 03:13:58,428 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:13:58,428 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:13:58,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:13:58,429 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:13:58,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:13:58,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:13:58,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:13:58,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:13:58,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:13:58,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:13:58,430 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:13:58,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:13:58,430 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:13:58,430 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:13:58,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:13:58,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:13:58,431 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:13:58,431 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:13:58,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:13:58,431 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:13:58,431 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:13:58,431 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:13:58,431 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:13:58,431 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:13:58,432 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:13:58,432 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 03:13:58,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:13:58,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:13:58,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:13:58,642 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:13:58,642 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:13:58,643 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/jm2006.i [2022-04-28 03:13:58,688 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39df2147d/8646ba29e9aa4e4591078a69b5c6905d/FLAG40804676d [2022-04-28 03:13:59,025 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:13:59,026 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006.i [2022-04-28 03:13:59,032 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39df2147d/8646ba29e9aa4e4591078a69b5c6905d/FLAG40804676d [2022-04-28 03:13:59,441 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39df2147d/8646ba29e9aa4e4591078a69b5c6905d [2022-04-28 03:13:59,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:13:59,444 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:13:59,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:13:59,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:13:59,450 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:13:59,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:13:59" (1/1) ... [2022-04-28 03:13:59,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b64489d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:59, skipping insertion in model container [2022-04-28 03:13:59,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:13:59" (1/1) ... [2022-04-28 03:13:59,457 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:13:59,468 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:13:59,612 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006.i[895,908] [2022-04-28 03:13:59,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:13:59,654 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:13:59,663 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-lit/jm2006.i[895,908] [2022-04-28 03:13:59,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:13:59,677 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:13:59,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:59 WrapperNode [2022-04-28 03:13:59,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:13:59,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:13:59,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:13:59,679 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:13:59,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:59" (1/1) ... [2022-04-28 03:13:59,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:59" (1/1) ... [2022-04-28 03:13:59,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:59" (1/1) ... [2022-04-28 03:13:59,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:59" (1/1) ... [2022-04-28 03:13:59,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:59" (1/1) ... [2022-04-28 03:13:59,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:59" (1/1) ... [2022-04-28 03:13:59,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:59" (1/1) ... [2022-04-28 03:13:59,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:13:59,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:13:59,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:13:59,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:13:59,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:59" (1/1) ... [2022-04-28 03:13:59,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:13:59,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:59,734 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 03:13:59,736 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 03:13:59,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:13:59,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:13:59,761 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:13:59,761 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 03:13:59,761 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:13:59,761 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:13:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:13:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:13:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 03:13:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 03:13:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:13:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:13:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 03:13:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:13:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 03:13:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:13:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:13:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:13:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:13:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:13:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:13:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:13:59,805 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:13:59,807 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:13:59,921 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:13:59,925 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:13:59,925 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 03:13:59,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:13:59 BoogieIcfgContainer [2022-04-28 03:13:59,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:13:59,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:13:59,941 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:13:59,944 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:13:59,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:13:59" (1/3) ... [2022-04-28 03:13:59,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd011e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:13:59, skipping insertion in model container [2022-04-28 03:13:59,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:59" (2/3) ... [2022-04-28 03:13:59,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd011e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:13:59, skipping insertion in model container [2022-04-28 03:13:59,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:13:59" (3/3) ... [2022-04-28 03:13:59,946 INFO L111 eAbstractionObserver]: Analyzing ICFG jm2006.i [2022-04-28 03:13:59,956 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:13:59,956 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:14:00,019 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:14:00,023 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@6869b7c0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@54cbb6ce [2022-04-28 03:14:00,023 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:14:00,040 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 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 03:14:00,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 03:14:00,045 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:00,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:14:00,047 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:00,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:00,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1244516831, now seen corresponding path program 1 times [2022-04-28 03:14:00,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:00,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [27528367] [2022-04-28 03:14:00,072 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:14:00,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1244516831, now seen corresponding path program 2 times [2022-04-28 03:14:00,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:00,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726897949] [2022-04-28 03:14:00,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:00,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:00,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:00,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(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); {24#true} is VALID [2022-04-28 03:14:00,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 03:14:00,511 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #60#return; {24#true} is VALID [2022-04-28 03:14:00,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {34#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:14:00,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(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); {24#true} is VALID [2022-04-28 03:14:00,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 03:14:00,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #60#return; {24#true} is VALID [2022-04-28 03:14:00,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret5 := main(); {24#true} is VALID [2022-04-28 03:14:00,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {24#true} is VALID [2022-04-28 03:14:00,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {29#(and (or (and (or (= main_~i~0 0) (= main_~i~0 main_~x~0)) (or (<= main_~y~0 main_~j~0) (not (= main_~i~0 0)))) (<= main_~y~0 0)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:14:00,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#(and (or (and (or (= main_~i~0 0) (= main_~i~0 main_~x~0)) (or (<= main_~y~0 main_~j~0) (not (= main_~i~0 0)))) (<= main_~y~0 0)) (< 0 (+ main_~y~0 1)))} assume !(0 != ~x~0); {30#(and (or (and (<= main_~y~0 main_~j~0) (= main_~i~0 0)) (<= main_~y~0 0)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:14:00,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#(and (or (and (<= main_~y~0 main_~j~0) (= main_~i~0 0)) (<= main_~y~0 0)) (< 0 (+ main_~y~0 1)))} assume ~i~0 == ~j~0; {31#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:14:00,518 INFO L272 TraceCheckUtils]: 9: Hoare triple {31#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {32#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:14:00,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {33#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:14:00,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25#false} is VALID [2022-04-28 03:14:00,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-28 03:14:00,520 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 03:14:00,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:00,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726897949] [2022-04-28 03:14:00,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726897949] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:00,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:00,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:14:00,525 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:00,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [27528367] [2022-04-28 03:14:00,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [27528367] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:00,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:00,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:14:00,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057271011] [2022-04-28 03:14:00,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:00,531 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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 03:14:00,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:00,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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 03:14:00,551 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 03:14:00,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:14:00,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:00,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:14:00,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:14:00,572 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 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 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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 03:14:01,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:01,002 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-28 03:14:01,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:14:01,003 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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 03:14:01,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:01,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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 03:14:01,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-28 03:14:01,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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 03:14:01,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-28 03:14:01,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 58 transitions. [2022-04-28 03:14:01,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:14:01,092 INFO L225 Difference]: With dead ends: 47 [2022-04-28 03:14:01,093 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 03:14:01,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:14:01,099 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 34 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:14:01,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 48 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:14:01,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 03:14:01,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 03:14:01,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:01,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 03:14:01,126 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 03:14:01,126 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 03:14:01,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:01,129 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 03:14:01,129 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 03:14:01,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:01,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:01,131 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-28 03:14:01,131 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-28 03:14:01,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:01,133 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 03:14:01,133 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 03:14:01,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:01,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:01,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:01,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:01,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 03:14:01,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-28 03:14:01,138 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-28 03:14:01,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:01,140 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-28 03:14:01,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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 03:14:01,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-28 03:14:01,158 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-28 03:14:01,158 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 03:14:01,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 03:14:01,158 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:01,159 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:14:01,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:14:01,159 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:01,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:01,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1450374075, now seen corresponding path program 1 times [2022-04-28 03:14:01,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:01,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [566354583] [2022-04-28 03:14:01,326 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 03:14:01,327 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:14:01,330 INFO L85 PathProgramCache]: Analyzing trace with hash 100046810, now seen corresponding path program 1 times [2022-04-28 03:14:01,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:01,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766246459] [2022-04-28 03:14:01,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:01,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:01,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:01,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {214#(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); {203#true} is VALID [2022-04-28 03:14:01,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#true} assume true; {203#true} is VALID [2022-04-28 03:14:01,502 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {203#true} {203#true} #60#return; {203#true} is VALID [2022-04-28 03:14:01,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {203#true} call ULTIMATE.init(); {214#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:14:01,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {214#(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); {203#true} is VALID [2022-04-28 03:14:01,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {203#true} assume true; {203#true} is VALID [2022-04-28 03:14:01,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {203#true} {203#true} #60#return; {203#true} is VALID [2022-04-28 03:14:01,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {203#true} call #t~ret5 := main(); {203#true} is VALID [2022-04-28 03:14:01,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {203#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {203#true} is VALID [2022-04-28 03:14:01,504 INFO L290 TraceCheckUtils]: 6: Hoare triple {203#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {208#(and (<= 0 main_~y~0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= (+ main_~i~0 (* (- 1) main_~x~0)) 0))} is VALID [2022-04-28 03:14:01,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {208#(and (<= 0 main_~y~0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= (+ main_~i~0 (* (- 1) main_~x~0)) 0))} [64] L31-2-->L31-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_6 0)) (.cse1 (= |v_main_#t~post3_4| |v_main_#t~post3_3|)) (.cse2 (= v_main_~y~0_7 v_main_~y~0_6)) (.cse3 (= |v_main_#t~post4_4| |v_main_#t~post4_3|))) (or (and (< v_main_~y~0_6 v_main_~y~0_7) (= v_main_~x~0_5 (+ v_main_~x~0_6 v_main_~y~0_6 (* (- 1) v_main_~y~0_7))) (not .cse0) (or (not (<= 1 v_main_~x~0_6)) (not (<= (+ v_main_~x~0_6 v_main_~y~0_6 1) v_main_~y~0_7)))) (and .cse1 .cse2 .cse0 (= v_main_~x~0_5 v_main_~x~0_6) .cse3) (and .cse1 .cse2 (= v_main_~x~0_6 v_main_~x~0_5) .cse3))) InVars {main_#t~post4=|v_main_#t~post4_4|, main_~y~0=v_main_~y~0_7, main_#t~post3=|v_main_#t~post3_4|, main_~x~0=v_main_~x~0_6} OutVars{main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_6, main_#t~post3=|v_main_#t~post3_3|, main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] {209#(and (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~y~0)) (< 0 (+ main_~y~0 1))) (or (<= (+ main_~i~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= main_~y~0 0)))} is VALID [2022-04-28 03:14:01,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {209#(and (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~y~0)) (< 0 (+ main_~y~0 1))) (or (<= (+ main_~i~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= main_~y~0 0)))} [63] L31-3_primed-->L31-3: Formula: (= v_main_~x~0_2 0) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {210#(and (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (< 0 (+ main_~y~0 1))) (or (<= main_~y~0 0) (<= (+ main_~i~0 main_~y~0) main_~j~0)))} is VALID [2022-04-28 03:14:01,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {210#(and (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (< 0 (+ main_~y~0 1))) (or (<= main_~y~0 0) (<= (+ main_~i~0 main_~y~0) main_~j~0)))} assume ~i~0 == ~j~0; {211#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:14:01,507 INFO L272 TraceCheckUtils]: 10: Hoare triple {211#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {212#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:14:01,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {212#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {213#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:14:01,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {213#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {204#false} is VALID [2022-04-28 03:14:01,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {204#false} assume !false; {204#false} is VALID [2022-04-28 03:14:01,508 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 03:14:01,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:01,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766246459] [2022-04-28 03:14:01,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766246459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:01,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:01,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:14:01,668 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:01,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [566354583] [2022-04-28 03:14:01,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [566354583] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:01,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:01,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:14:01,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736360803] [2022-04-28 03:14:01,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:01,669 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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 14 [2022-04-28 03:14:01,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:01,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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 03:14:01,682 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 03:14:01,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:14:01,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:01,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:14:01,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:14:01,683 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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 03:14:01,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:01,791 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 03:14:01,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:14:01,791 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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 14 [2022-04-28 03:14:01,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:01,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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 03:14:01,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2022-04-28 03:14:01,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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 03:14:01,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2022-04-28 03:14:01,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 15 transitions. [2022-04-28 03:14:01,815 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-28 03:14:01,816 INFO L225 Difference]: With dead ends: 15 [2022-04-28 03:14:01,816 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 03:14:01,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-04-28 03:14:01,817 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 5 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:14:01,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 35 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2022-04-28 03:14:01,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 03:14:01,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 03:14:01,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:01,818 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 03:14:01,818 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 03:14:01,818 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 03:14:01,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:01,819 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:14:01,819 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:14:01,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:01,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:01,819 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 03:14:01,819 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 03:14:01,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:01,819 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:14:01,819 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:14:01,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:01,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:01,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:01,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:01,819 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 03:14:01,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 03:14:01,820 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-28 03:14:01,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:01,820 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 03:14:01,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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 03:14:01,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 03:14:01,820 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 03:14:01,820 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:14:01,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:01,822 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 03:14:01,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:14:01,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 03:14:01,924 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-28 03:14:01,924 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-28 03:14:01,924 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-28 03:14:01,924 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-28 03:14:01,925 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-28 03:14:01,925 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-28 03:14:01,925 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-28 03:14:01,925 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 39) the Hoare annotation is: true [2022-04-28 03:14:01,926 INFO L895 garLoopResultBuilder]: At program point L31-2(lines 31 34) the Hoare annotation is: (exists ((v_main_~y~0_11 Int)) (and (<= main_~j~0 v_main_~y~0_11) (<= v_main_~y~0_11 main_~j~0) (<= 0 v_main_~y~0_11) (let ((.cse0 (= main_~i~0 0)) (.cse1 (= main_~i~0 main_~x~0)) (.cse2 (= v_main_~y~0_11 main_~y~0))) (or (and .cse0 .cse1 .cse2) (and (< main_~y~0 v_main_~y~0_11) (= (+ v_main_~y~0_11 main_~x~0) (+ main_~i~0 main_~y~0)) (not .cse0) (or (not (<= 1 main_~i~0)) (not (<= (+ main_~i~0 main_~y~0 1) v_main_~y~0_11)))) (and .cse1 .cse2))))) [2022-04-28 03:14:01,926 INFO L902 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true [2022-04-28 03:14:01,926 INFO L895 garLoopResultBuilder]: At program point L31-3(lines 24 39) the Hoare annotation is: (let ((.cse0 (+ main_~i~0 main_~y~0))) (and (or (<= main_~j~0 .cse0) (< 0 (+ main_~y~0 1))) (or (<= main_~y~0 0) (<= .cse0 main_~j~0)))) [2022-04-28 03:14:01,926 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 24 39) the Hoare annotation is: true [2022-04-28 03:14:01,926 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 24 39) the Hoare annotation is: true [2022-04-28 03:14:01,927 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) [2022-04-28 03:14:01,930 INFO L902 garLoopResultBuilder]: At program point L35(lines 35 37) the Hoare annotation is: true [2022-04-28 03:14:01,930 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 03:14:01,931 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 03:14:01,931 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 03:14:01,931 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 03:14:01,931 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 03:14:01,931 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 03:14:01,932 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 03:14:01,932 INFO L895 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 03:14:01,932 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-28 03:14:01,932 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 03:14:01,932 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 03:14:01,932 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 03:14:01,932 INFO L895 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-28 03:14:01,935 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-28 03:14:01,937 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 03:14:01,945 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 03:14:01,945 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 03:14:01,945 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 03:14:01,946 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 03:14:01,946 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 03:14:01,946 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 03:14:01,950 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 03:14:01,958 INFO L163 areAnnotationChecker]: CFG has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 03:14:01,963 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,963 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,963 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,963 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,963 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,963 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,964 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,964 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,966 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,967 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,967 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,967 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,967 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,967 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,967 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,967 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 03:14:01 BoogieIcfgContainer [2022-04-28 03:14:01,969 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 03:14:01,972 INFO L158 Benchmark]: Toolchain (without parser) took 2525.58ms. Allocated memory was 176.2MB in the beginning and 289.4MB in the end (delta: 113.2MB). Free memory was 119.7MB in the beginning and 218.1MB in the end (delta: -98.4MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. [2022-04-28 03:14:01,973 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory was 135.8MB in the beginning and 135.7MB in the end (delta: 119.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 03:14:01,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.94ms. Allocated memory was 176.2MB in the beginning and 289.4MB in the end (delta: 113.2MB). Free memory was 119.4MB in the beginning and 262.1MB in the end (delta: -142.7MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. [2022-04-28 03:14:01,973 INFO L158 Benchmark]: Boogie Preprocessor took 28.88ms. Allocated memory is still 289.4MB. Free memory was 262.1MB in the beginning and 260.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 03:14:01,973 INFO L158 Benchmark]: RCFGBuilder took 232.11ms. Allocated memory is still 289.4MB. Free memory was 260.4MB in the beginning and 248.0MB in the end (delta: 12.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 03:14:01,973 INFO L158 Benchmark]: TraceAbstraction took 2028.08ms. Allocated memory is still 289.4MB. Free memory was 247.5MB in the beginning and 218.1MB in the end (delta: 29.4MB). Peak memory consumption was 30.0MB. Max. memory is 8.0GB. [2022-04-28 03:14:01,974 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 176.2MB. Free memory was 135.8MB in the beginning and 135.7MB in the end (delta: 119.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 230.94ms. Allocated memory was 176.2MB in the beginning and 289.4MB in the end (delta: 113.2MB). Free memory was 119.4MB in the beginning and 262.1MB in the end (delta: -142.7MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.88ms. Allocated memory is still 289.4MB. Free memory was 262.1MB in the beginning and 260.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 232.11ms. Allocated memory is still 289.4MB. Free memory was 260.4MB in the beginning and 248.0MB in the end (delta: 12.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2028.08ms. Allocated memory is still 289.4MB. Free memory was 247.5MB in the beginning and 218.1MB in the end (delta: 29.4MB). Peak memory consumption was 30.0MB. 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_~y~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,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: 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, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 83 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 115 IncrementalHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 29 mSDtfsCounter, 115 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 18, 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, 21 LocationsWithAnnotation, 33 PreInvPairs, 52 NumberOfFragments, 135 HoareAnnotationTreeSize, 33 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 156 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: 31]: Loop Invariant [2022-04-28 03:14:01,981 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,981 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,981 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,981 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,982 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,982 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,982 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,982 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,986 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,986 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,986 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,986 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,986 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,986 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,987 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-28 03:14:01,988 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] Derived loop invariant: (\exists v_main_~y~0_11 : int :: ((j <= v_main_~y~0_11 && v_main_~y~0_11 <= j) && 0 <= v_main_~y~0_11) && ((((i == 0 && i == x) && v_main_~y~0_11 == y) || (((y < v_main_~y~0_11 && v_main_~y~0_11 + x == i + y) && !(i == 0)) && (!(1 <= i) || !(i + y + 1 <= v_main_~y~0_11)))) || (i == x && v_main_~y~0_11 == y))) - 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: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-28 03:14:02,010 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...