/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-zilu/benchmark05_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 12:27:47,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 12:27:47,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 12:27:47,493 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 12:27:47,493 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 12:27:47,494 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 12:27:47,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 12:27:47,496 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 12:27:47,497 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 12:27:47,498 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 12:27:47,498 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 12:27:47,499 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 12:27:47,499 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 12:27:47,500 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 12:27:47,500 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 12:27:47,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 12:27:47,501 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 12:27:47,502 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 12:27:47,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 12:27:47,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 12:27:47,505 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 12:27:47,506 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 12:27:47,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 12:27:47,507 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 12:27:47,508 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 12:27:47,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 12:27:47,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 12:27:47,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 12:27:47,510 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 12:27:47,510 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 12:27:47,511 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 12:27:47,511 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 12:27:47,512 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 12:27:47,512 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 12:27:47,513 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 12:27:47,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 12:27:47,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 12:27:47,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 12:27:47,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 12:27:47,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 12:27:47,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 12:27:47,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 12:27:47,516 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-07 12:27:47,531 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 12:27:47,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 12:27:47,532 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 12:27:47,532 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 12:27:47,532 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 12:27:47,532 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 12:27:47,533 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 12:27:47,533 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 12:27:47,533 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 12:27:47,534 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 12:27:47,534 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 12:27:47,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 12:27:47,534 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 12:27:47,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 12:27:47,534 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 12:27:47,534 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 12:27:47,534 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 12:27:47,535 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 12:27:47,535 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 12:27:47,535 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 12:27:47,535 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 12:27:47,535 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 12:27:47,536 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 12:27:47,536 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 12:27:47,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:27:47,536 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 12:27:47,536 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 12:27:47,536 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 12:27:47,536 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 12:27:47,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 12:27:47,536 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 12:27:47,536 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 12:27:47,536 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 12:27:47,537 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-07 12:27:47,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 12:27:47,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 12:27:47,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 12:27:47,750 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 12:27:47,750 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 12:27:47,751 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark05_conjunctive.i [2022-04-07 12:27:47,804 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a123bfde0/442f20ff1d5546ed8766440db0cd0368/FLAG228978a48 [2022-04-07 12:27:48,103 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 12:27:48,103 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark05_conjunctive.i [2022-04-07 12:27:48,107 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a123bfde0/442f20ff1d5546ed8766440db0cd0368/FLAG228978a48 [2022-04-07 12:27:48,539 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a123bfde0/442f20ff1d5546ed8766440db0cd0368 [2022-04-07 12:27:48,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 12:27:48,543 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 12:27:48,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 12:27:48,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 12:27:48,551 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 12:27:48,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:27:48" (1/1) ... [2022-04-07 12:27:48,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d8c9075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:27:48, skipping insertion in model container [2022-04-07 12:27:48,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:27:48" (1/1) ... [2022-04-07 12:27:48,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 12:27:48,567 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 12:27:48,717 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/benchmark05_conjunctive.i[873,886] [2022-04-07 12:27:48,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:27:48,739 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 12:27:48,749 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/benchmark05_conjunctive.i[873,886] [2022-04-07 12:27:48,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:27:48,768 INFO L208 MainTranslator]: Completed translation [2022-04-07 12:27:48,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:27:48 WrapperNode [2022-04-07 12:27:48,768 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 12:27:48,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 12:27:48,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 12:27:48,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 12:27:48,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:27:48" (1/1) ... [2022-04-07 12:27:48,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:27:48" (1/1) ... [2022-04-07 12:27:48,780 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:27:48" (1/1) ... [2022-04-07 12:27:48,780 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:27:48" (1/1) ... [2022-04-07 12:27:48,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:27:48" (1/1) ... [2022-04-07 12:27:48,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:27:48" (1/1) ... [2022-04-07 12:27:48,796 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:27:48" (1/1) ... [2022-04-07 12:27:48,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 12:27:48,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 12:27:48,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 12:27:48,801 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 12:27:48,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:27:48" (1/1) ... [2022-04-07 12:27:48,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:27:48,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:27:48,826 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-07 12:27:48,844 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-07 12:27:48,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 12:27:48,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 12:27:48,855 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 12:27:48,855 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 12:27:48,856 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 12:27:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 12:27:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 12:27:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 12:27:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 12:27:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 12:27:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 12:27:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-07 12:27:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 12:27:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 12:27:48,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 12:27:48,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 12:27:48,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 12:27:48,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 12:27:48,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 12:27:48,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 12:27:48,934 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 12:27:48,943 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 12:27:49,054 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 12:27:49,058 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 12:27:49,058 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 12:27:49,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:27:49 BoogieIcfgContainer [2022-04-07 12:27:49,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 12:27:49,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 12:27:49,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 12:27:49,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 12:27:49,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 12:27:48" (1/3) ... [2022-04-07 12:27:49,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7877e643 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:27:49, skipping insertion in model container [2022-04-07 12:27:49,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:27:48" (2/3) ... [2022-04-07 12:27:49,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7877e643 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:27:49, skipping insertion in model container [2022-04-07 12:27:49,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:27:49" (3/3) ... [2022-04-07 12:27:49,064 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark05_conjunctive.i [2022-04-07 12:27:49,067 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 12:27:49,067 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 12:27:49,096 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 12:27:49,100 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 12:27:49,100 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 12:27:49,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 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-07 12:27:49,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 12:27:49,117 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:27:49,117 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:27:49,117 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:27:49,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:27:49,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1005951186, now seen corresponding path program 1 times [2022-04-07 12:27:49,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:27:49,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539681756] [2022-04-07 12:27:49,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:27:49,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:27:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:49,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:27:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:49,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(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); {24#true} is VALID [2022-04-07 12:27:49,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-07 12:27:49,297 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #51#return; {24#true} is VALID [2022-04-07 12:27:49,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:27:49,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(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); {24#true} is VALID [2022-04-07 12:27:49,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-07 12:27:49,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #51#return; {24#true} is VALID [2022-04-07 12:27:49,299 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret6 := main(); {24#true} is VALID [2022-04-07 12:27:49,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {24#true} is VALID [2022-04-07 12:27:49,300 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!((~x~0 >= 0 && ~x~0 <= ~y~0) && ~y~0 < ~n~0); {29#(<= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-07 12:27:49,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#(<= (+ main_~x~0 1) main_~n~0)} assume !(~x~0 < ~n~0); {25#false} is VALID [2022-04-07 12:27:49,301 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1 else 0)); {25#false} is VALID [2022-04-07 12:27:49,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-07 12:27:49,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-07 12:27:49,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-07 12:27:49,302 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-07 12:27:49,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:27:49,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539681756] [2022-04-07 12:27:49,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539681756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:27:49,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:27:49,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 12:27:49,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408527024] [2022-04-07 12:27:49,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:27:49,307 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-07 12:27:49,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:27:49,310 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-07 12:27:49,333 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-07 12:27:49,334 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 12:27:49,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:27:49,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 12:27:49,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 12:27:49,349 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 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 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-07 12:27:49,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:27:49,437 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-07 12:27:49,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 12:27:49,438 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-07 12:27:49,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:27:49,438 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-07 12:27:49,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-07 12:27:49,450 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-07 12:27:49,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-07 12:27:49,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2022-04-07 12:27:49,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:27:49,530 INFO L225 Difference]: With dead ends: 34 [2022-04-07 12:27:49,530 INFO L226 Difference]: Without dead ends: 15 [2022-04-07 12:27:49,533 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 12:27:49,536 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 14 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 12:27:49,537 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 30 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 12:27:49,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-07 12:27:49,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-07 12:27:49,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:27:49,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-07 12:27:49,562 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-07 12:27:49,562 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-07 12:27:49,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:27:49,564 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-07 12:27:49,564 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-07 12:27:49,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:27:49,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:27:49,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-07 12:27:49,565 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-07 12:27:49,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:27:49,569 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-07 12:27:49,569 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-07 12:27:49,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:27:49,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:27:49,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:27:49,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:27:49,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-07 12:27:49,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-07 12:27:49,576 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-07 12:27:49,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:27:49,576 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-07 12:27:49,576 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:27:49,577 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-07 12:27:49,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 12:27:49,577 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:27:49,577 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:27:49,577 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 12:27:49,577 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:27:49,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:27:49,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1392462319, now seen corresponding path program 1 times [2022-04-07 12:27:49,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:27:49,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077183678] [2022-04-07 12:27:49,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:27:49,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:27:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:49,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:27:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:49,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {143#(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); {132#true} is VALID [2022-04-07 12:27:49,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#true} assume true; {132#true} is VALID [2022-04-07 12:27:49,763 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {132#true} {132#true} #51#return; {132#true} is VALID [2022-04-07 12:27:49,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {132#true} call ULTIMATE.init(); {143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:27:49,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {143#(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); {132#true} is VALID [2022-04-07 12:27:49,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {132#true} assume true; {132#true} is VALID [2022-04-07 12:27:49,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132#true} {132#true} #51#return; {132#true} is VALID [2022-04-07 12:27:49,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {132#true} call #t~ret6 := main(); {132#true} is VALID [2022-04-07 12:27:49,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {132#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {132#true} is VALID [2022-04-07 12:27:49,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {132#true} assume !!((~x~0 >= 0 && ~x~0 <= ~y~0) && ~y~0 < ~n~0); {137#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-07 12:27:49,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {137#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 main_~y~0))} assume !!(~x~0 < ~n~0);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {138#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-07 12:27:49,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {138#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 (+ main_~y~0 1)))} assume ~x~0 > ~y~0;#t~post5 := ~y~0;~y~0 := 1 + #t~post5;havoc #t~post5; {139#(and (or (<= main_~x~0 main_~y~0) (<= main_~n~0 main_~y~0)) (< main_~y~0 (+ main_~n~0 1)))} is VALID [2022-04-07 12:27:49,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {139#(and (or (<= main_~x~0 main_~y~0) (<= main_~n~0 main_~y~0)) (< main_~y~0 (+ main_~n~0 1)))} assume !(~x~0 < ~n~0); {140#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} is VALID [2022-04-07 12:27:49,769 INFO L272 TraceCheckUtils]: 10: Hoare triple {140#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1 else 0)); {141#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:27:49,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {141#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {142#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 12:27:49,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {142#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {133#false} is VALID [2022-04-07 12:27:49,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {133#false} assume !false; {133#false} is VALID [2022-04-07 12:27:49,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:27:49,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:27:49,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077183678] [2022-04-07 12:27:49,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077183678] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:27:49,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47181339] [2022-04-07 12:27:49,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:27:49,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:27:49,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:27:49,776 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:27:49,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 12:27:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:49,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 12:27:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:49,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:27:50,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {132#true} call ULTIMATE.init(); {132#true} is VALID [2022-04-07 12:27:50,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#true} #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); {132#true} is VALID [2022-04-07 12:27:50,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {132#true} assume true; {132#true} is VALID [2022-04-07 12:27:50,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132#true} {132#true} #51#return; {132#true} is VALID [2022-04-07 12:27:50,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {132#true} call #t~ret6 := main(); {132#true} is VALID [2022-04-07 12:27:50,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {132#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {132#true} is VALID [2022-04-07 12:27:50,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {132#true} assume !!((~x~0 >= 0 && ~x~0 <= ~y~0) && ~y~0 < ~n~0); {137#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-07 12:27:50,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {137#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 main_~y~0))} assume !!(~x~0 < ~n~0);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {138#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-07 12:27:50,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {138#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 (+ main_~y~0 1)))} assume ~x~0 > ~y~0;#t~post5 := ~y~0;~y~0 := 1 + #t~post5;havoc #t~post5; {171#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~n~0))} is VALID [2022-04-07 12:27:50,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {171#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~n~0))} assume !(~x~0 < ~n~0); {140#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} is VALID [2022-04-07 12:27:50,241 INFO L272 TraceCheckUtils]: 10: Hoare triple {140#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1 else 0)); {178#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:27:50,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {178#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {182#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:27:50,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {182#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {133#false} is VALID [2022-04-07 12:27:50,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {133#false} assume !false; {133#false} is VALID [2022-04-07 12:27:50,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:27:50,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:27:50,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {133#false} assume !false; {133#false} is VALID [2022-04-07 12:27:50,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {182#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {133#false} is VALID [2022-04-07 12:27:50,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {178#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {182#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:27:50,458 INFO L272 TraceCheckUtils]: 10: Hoare triple {140#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1 else 0)); {178#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:27:50,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {201#(or (and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0)) (< main_~x~0 main_~n~0))} assume !(~x~0 < ~n~0); {140#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} is VALID [2022-04-07 12:27:50,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {205#(or (< main_~x~0 main_~n~0) (and (< main_~y~0 main_~n~0) (<= main_~n~0 (+ main_~y~0 1))))} assume ~x~0 > ~y~0;#t~post5 := ~y~0;~y~0 := 1 + #t~post5;havoc #t~post5; {201#(or (and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0)) (< main_~x~0 main_~n~0))} is VALID [2022-04-07 12:27:50,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {209#(or (< (+ main_~x~0 1) main_~n~0) (and (< main_~y~0 main_~n~0) (<= main_~n~0 (+ main_~y~0 1))))} assume !!(~x~0 < ~n~0);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {205#(or (< main_~x~0 main_~n~0) (and (< main_~y~0 main_~n~0) (<= main_~n~0 (+ main_~y~0 1))))} is VALID [2022-04-07 12:27:50,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {132#true} assume !!((~x~0 >= 0 && ~x~0 <= ~y~0) && ~y~0 < ~n~0); {209#(or (< (+ main_~x~0 1) main_~n~0) (and (< main_~y~0 main_~n~0) (<= main_~n~0 (+ main_~y~0 1))))} is VALID [2022-04-07 12:27:50,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {132#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {132#true} is VALID [2022-04-07 12:27:50,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {132#true} call #t~ret6 := main(); {132#true} is VALID [2022-04-07 12:27:50,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132#true} {132#true} #51#return; {132#true} is VALID [2022-04-07 12:27:50,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {132#true} assume true; {132#true} is VALID [2022-04-07 12:27:50,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#true} #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); {132#true} is VALID [2022-04-07 12:27:50,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {132#true} call ULTIMATE.init(); {132#true} is VALID [2022-04-07 12:27:50,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:27:50,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47181339] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:27:50,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 12:27:50,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-04-07 12:27:50,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070432748] [2022-04-07 12:27:50,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 12:27:50,469 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 12:27:50,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:27:50,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:27:50,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:27:50,493 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-07 12:27:50,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:27:50,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-07 12:27:50,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-04-07 12:27:50,496 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:27:50,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:27:50,722 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-07 12:27:50,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 12:27:50,722 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 12:27:50,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:27:50,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:27:50,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2022-04-07 12:27:50,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:27:50,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2022-04-07 12:27:50,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 28 transitions. [2022-04-07 12:27:50,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:27:50,752 INFO L225 Difference]: With dead ends: 26 [2022-04-07 12:27:50,752 INFO L226 Difference]: Without dead ends: 18 [2022-04-07 12:27:50,753 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2022-04-07 12:27:50,753 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:27:50,754 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 42 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:27:50,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-07 12:27:50,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-07 12:27:50,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:27:50,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-07 12:27:50,760 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-07 12:27:50,760 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-07 12:27:50,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:27:50,761 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-07 12:27:50,761 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-07 12:27:50,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:27:50,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:27:50,761 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 18 states. [2022-04-07 12:27:50,762 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 18 states. [2022-04-07 12:27:50,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:27:50,762 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-07 12:27:50,763 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-07 12:27:50,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:27:50,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:27:50,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:27:50,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:27:50,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-07 12:27:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-07 12:27:50,764 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2022-04-07 12:27:50,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:27:50,764 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-07 12:27:50,764 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:27:50,764 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-07 12:27:50,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-07 12:27:50,765 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:27:50,765 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:27:50,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 12:27:50,979 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:27:50,980 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:27:50,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:27:50,980 INFO L85 PathProgramCache]: Analyzing trace with hash -832493620, now seen corresponding path program 2 times [2022-04-07 12:27:50,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:27:50,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541823225] [2022-04-07 12:27:50,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:27:50,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:27:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:51,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:27:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:51,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {360#(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); {347#true} is VALID [2022-04-07 12:27:51,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#true} assume true; {347#true} is VALID [2022-04-07 12:27:51,101 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {347#true} {347#true} #51#return; {347#true} is VALID [2022-04-07 12:27:51,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {347#true} call ULTIMATE.init(); {360#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:27:51,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {360#(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); {347#true} is VALID [2022-04-07 12:27:51,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {347#true} assume true; {347#true} is VALID [2022-04-07 12:27:51,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {347#true} {347#true} #51#return; {347#true} is VALID [2022-04-07 12:27:51,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {347#true} call #t~ret6 := main(); {347#true} is VALID [2022-04-07 12:27:51,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {347#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {347#true} is VALID [2022-04-07 12:27:51,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {347#true} assume !!((~x~0 >= 0 && ~x~0 <= ~y~0) && ~y~0 < ~n~0); {352#(<= main_~x~0 main_~y~0)} is VALID [2022-04-07 12:27:51,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {352#(<= main_~x~0 main_~y~0)} assume !!(~x~0 < ~n~0);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {353#(<= main_~x~0 (+ main_~y~0 1))} is VALID [2022-04-07 12:27:51,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {353#(<= main_~x~0 (+ main_~y~0 1))} assume ~x~0 > ~y~0;#t~post5 := ~y~0;~y~0 := 1 + #t~post5;havoc #t~post5; {354#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~x~0))} is VALID [2022-04-07 12:27:51,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {354#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~x~0))} assume !!(~x~0 < ~n~0);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {355#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-07 12:27:51,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {355#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 (+ main_~y~0 1)))} assume ~x~0 > ~y~0;#t~post5 := ~y~0;~y~0 := 1 + #t~post5;havoc #t~post5; {356#(and (or (<= main_~x~0 main_~y~0) (<= main_~n~0 main_~y~0)) (< main_~y~0 (+ main_~n~0 1)))} is VALID [2022-04-07 12:27:51,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {356#(and (or (<= main_~x~0 main_~y~0) (<= main_~n~0 main_~y~0)) (< main_~y~0 (+ main_~n~0 1)))} assume !(~x~0 < ~n~0); {357#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} is VALID [2022-04-07 12:27:51,105 INFO L272 TraceCheckUtils]: 12: Hoare triple {357#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1 else 0)); {358#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:27:51,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {358#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {359#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 12:27:51,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {359#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {348#false} is VALID [2022-04-07 12:27:51,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {348#false} assume !false; {348#false} is VALID [2022-04-07 12:27:51,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:27:51,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:27:51,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541823225] [2022-04-07 12:27:51,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541823225] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:27:51,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919452267] [2022-04-07 12:27:51,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 12:27:51,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:27:51,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:27:51,111 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:27:51,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 12:27:51,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 12:27:51,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:27:51,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 12:27:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:51,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:27:51,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {347#true} call ULTIMATE.init(); {347#true} is VALID [2022-04-07 12:27:51,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#true} #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); {347#true} is VALID [2022-04-07 12:27:51,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {347#true} assume true; {347#true} is VALID [2022-04-07 12:27:51,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {347#true} {347#true} #51#return; {347#true} is VALID [2022-04-07 12:27:51,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {347#true} call #t~ret6 := main(); {347#true} is VALID [2022-04-07 12:27:51,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {347#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {347#true} is VALID [2022-04-07 12:27:51,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {347#true} assume !!((~x~0 >= 0 && ~x~0 <= ~y~0) && ~y~0 < ~n~0); {352#(<= main_~x~0 main_~y~0)} is VALID [2022-04-07 12:27:51,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {352#(<= main_~x~0 main_~y~0)} assume !!(~x~0 < ~n~0);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {353#(<= main_~x~0 (+ main_~y~0 1))} is VALID [2022-04-07 12:27:51,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {353#(<= main_~x~0 (+ main_~y~0 1))} assume ~x~0 > ~y~0;#t~post5 := ~y~0;~y~0 := 1 + #t~post5;havoc #t~post5; {354#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~x~0))} is VALID [2022-04-07 12:27:51,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {354#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~x~0))} assume !!(~x~0 < ~n~0);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {355#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-07 12:27:51,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {355#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 (+ main_~y~0 1)))} assume ~x~0 > ~y~0;#t~post5 := ~y~0;~y~0 := 1 + #t~post5;havoc #t~post5; {394#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~n~0))} is VALID [2022-04-07 12:27:51,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {394#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~n~0))} assume !(~x~0 < ~n~0); {357#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} is VALID [2022-04-07 12:27:51,429 INFO L272 TraceCheckUtils]: 12: Hoare triple {357#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1 else 0)); {401#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:27:51,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {401#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {405#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:27:51,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {405#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {348#false} is VALID [2022-04-07 12:27:51,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {348#false} assume !false; {348#false} is VALID [2022-04-07 12:27:51,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:27:51,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:27:51,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {348#false} assume !false; {348#false} is VALID [2022-04-07 12:27:51,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {405#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {348#false} is VALID [2022-04-07 12:27:51,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {401#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {405#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:27:51,647 INFO L272 TraceCheckUtils]: 12: Hoare triple {357#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1 else 0)); {401#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:27:51,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {424#(or (and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0)) (< main_~x~0 main_~n~0))} assume !(~x~0 < ~n~0); {357#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} is VALID [2022-04-07 12:27:51,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {428#(or (< main_~x~0 main_~n~0) (and (< main_~y~0 main_~n~0) (<= main_~n~0 (+ main_~y~0 1))))} assume ~x~0 > ~y~0;#t~post5 := ~y~0;~y~0 := 1 + #t~post5;havoc #t~post5; {424#(or (and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0)) (< main_~x~0 main_~n~0))} is VALID [2022-04-07 12:27:51,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {354#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~x~0))} assume !!(~x~0 < ~n~0);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {428#(or (< main_~x~0 main_~n~0) (and (< main_~y~0 main_~n~0) (<= main_~n~0 (+ main_~y~0 1))))} is VALID [2022-04-07 12:27:51,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {353#(<= main_~x~0 (+ main_~y~0 1))} assume ~x~0 > ~y~0;#t~post5 := ~y~0;~y~0 := 1 + #t~post5;havoc #t~post5; {354#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~x~0))} is VALID [2022-04-07 12:27:51,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {352#(<= main_~x~0 main_~y~0)} assume !!(~x~0 < ~n~0);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {353#(<= main_~x~0 (+ main_~y~0 1))} is VALID [2022-04-07 12:27:51,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {347#true} assume !!((~x~0 >= 0 && ~x~0 <= ~y~0) && ~y~0 < ~n~0); {352#(<= main_~x~0 main_~y~0)} is VALID [2022-04-07 12:27:51,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {347#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {347#true} is VALID [2022-04-07 12:27:51,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {347#true} call #t~ret6 := main(); {347#true} is VALID [2022-04-07 12:27:51,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {347#true} {347#true} #51#return; {347#true} is VALID [2022-04-07 12:27:51,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {347#true} assume true; {347#true} is VALID [2022-04-07 12:27:51,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#true} #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); {347#true} is VALID [2022-04-07 12:27:51,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {347#true} call ULTIMATE.init(); {347#true} is VALID [2022-04-07 12:27:51,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:27:51,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919452267] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:27:51,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 12:27:51,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2022-04-07 12:27:51,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662424265] [2022-04-07 12:27:51,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 12:27:51,654 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-07 12:27:51,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:27:51,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:27:51,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:27:51,669 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-07 12:27:51,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:27:51,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-07 12:27:51,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-04-07 12:27:51,670 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:27:51,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:27:51,876 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-07 12:27:51,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 12:27:51,876 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-07 12:27:51,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:27:51,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:27:51,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2022-04-07 12:27:51,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:27:51,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2022-04-07 12:27:51,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 20 transitions. [2022-04-07 12:27:51,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:27:51,896 INFO L225 Difference]: With dead ends: 21 [2022-04-07 12:27:51,896 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 12:27:51,897 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2022-04-07 12:27:51,897 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:27:51,898 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 45 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:27:51,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 12:27:51,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 12:27:51,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:27:51,898 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-07 12:27:51,898 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-07 12:27:51,898 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-07 12:27:51,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:27:51,899 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 12:27:51,899 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 12:27:51,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:27:51,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:27:51,899 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-07 12:27:51,899 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-07 12:27:51,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:27:51,899 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 12:27:51,899 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 12:27:51,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:27:51,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:27:51,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:27:51,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:27:51,900 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-07 12:27:51,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 12:27:51,900 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2022-04-07 12:27:51,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:27:51,900 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 12:27:51,900 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:27:51,900 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 12:27:51,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:27:51,902 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 12:27:51,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 12:27:52,116 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-07 12:27:52,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 12:27:52,173 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 11) no Hoare annotation was computed. [2022-04-07 12:27:52,173 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 11) no Hoare annotation was computed. [2022-04-07 12:27:52,173 INFO L882 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2022-04-07 12:27:52,173 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 19 30) the Hoare annotation is: true [2022-04-07 12:27:52,174 INFO L882 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-07 12:27:52,174 INFO L882 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2022-04-07 12:27:52,174 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 19 30) no Hoare annotation was computed. [2022-04-07 12:27:52,174 INFO L878 garLoopResultBuilder]: At program point L26-2(lines 24 27) the Hoare annotation is: (let ((.cse0 (<= main_~x~0 main_~y~0))) (or (and .cse0 (<= main_~y~0 main_~n~0) (<= main_~y~0 main_~x~0)) (and (<= (+ main_~y~0 1) main_~n~0) .cse0))) [2022-04-07 12:27:52,174 INFO L882 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2022-04-07 12:27:52,174 INFO L878 garLoopResultBuilder]: At program point L24-2(lines 24 27) the Hoare annotation is: (and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~n~0) (<= main_~n~0 main_~y~0)) [2022-04-07 12:27:52,174 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 19 30) no Hoare annotation was computed. [2022-04-07 12:27:52,174 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 12:27:52,174 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-07 12:27:52,174 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 12:27:52,174 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 12:27:52,174 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 12:27:52,174 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 12:27:52,174 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 12:27:52,175 INFO L882 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-07 12:27:52,175 INFO L882 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-04-07 12:27:52,175 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-07 12:27:52,175 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 18) no Hoare annotation was computed. [2022-04-07 12:27:52,175 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 18) no Hoare annotation was computed. [2022-04-07 12:27:52,175 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-07 12:27:52,177 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1] [2022-04-07 12:27:52,178 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 12:27:52,180 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-07 12:27:52,180 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-07 12:27:52,180 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 12:27:52,181 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-07 12:27:52,181 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 12:27:52,181 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2022-04-07 12:27:52,181 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 12:27:52,181 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 12:27:52,181 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-07 12:27:52,182 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-07 12:27:52,182 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 12:27:52,182 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 12:27:52,182 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 12:27:52,182 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 12:27:52,182 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 12:27:52,184 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-07 12:27:52,184 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 12:27:52,184 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 12:27:52,184 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-07 12:27:52,184 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 12:27:52,185 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-07 12:27:52,185 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-07 12:27:52,185 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-07 12:27:52,185 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:27:52,185 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-07 12:27:52,185 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 12:27:52,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 12:27:52 BoogieIcfgContainer [2022-04-07 12:27:52,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 12:27:52,191 INFO L158 Benchmark]: Toolchain (without parser) took 3648.16ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 131.9MB in the beginning and 146.7MB in the end (delta: -14.8MB). Peak memory consumption was 22.7MB. Max. memory is 8.0GB. [2022-04-07 12:27:52,191 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory is still 148.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 12:27:52,191 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.92ms. Allocated memory is still 182.5MB. Free memory was 131.8MB in the beginning and 159.1MB in the end (delta: -27.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-07 12:27:52,191 INFO L158 Benchmark]: Boogie Preprocessor took 31.73ms. Allocated memory is still 182.5MB. Free memory was 159.1MB in the beginning and 157.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 12:27:52,192 INFO L158 Benchmark]: RCFGBuilder took 257.98ms. Allocated memory is still 182.5MB. Free memory was 157.5MB in the beginning and 146.4MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-07 12:27:52,192 INFO L158 Benchmark]: TraceAbstraction took 3129.86ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 145.6MB in the beginning and 146.7MB in the end (delta: -1.1MB). Peak memory consumption was 36.4MB. Max. memory is 8.0GB. [2022-04-07 12:27:52,193 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.09ms. Allocated memory is still 182.5MB. Free memory is still 148.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.92ms. Allocated memory is still 182.5MB. Free memory was 131.8MB in the beginning and 159.1MB in the end (delta: -27.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.73ms. Allocated memory is still 182.5MB. Free memory was 159.1MB in the beginning and 157.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 257.98ms. Allocated memory is still 182.5MB. Free memory was 157.5MB in the beginning and 146.4MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3129.86ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 145.6MB in the beginning and 146.7MB in the end (delta: -1.1MB). Peak memory consumption was 36.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 117 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 78 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 139 IncrementalHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 39 mSDtfsCounter, 139 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 47 SyntacticMatches, 9 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 22, 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, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 15 NumberOfFragments, 41 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 47 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 383 SizeOfPredicates, 8 NumberOfNonLiveVariables, 138 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 6/15 InterpolantCoveringCapability, 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 Derived loop invariant: ((x <= y && y <= n) && y <= x) || (y + 1 <= n && x <= y) RESULT: Ultimate proved your program to be correct! [2022-04-07 12:27:52,219 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...